Speed-up technique for association rule mining based on an artificial life algorithm

Masaaki Kanakubo, Masafumi Hagiwara

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Association rule mining is one of the most important issues in data mining. Apriori computation schemes greatly reduce the computation time by pruning the candidate itemset. However, a large computation time is required when the treated data are dense and the amount of data is large. With apriori methods, the problem of becoming incomputable cannot be avoided when the total number of items is large. On the other hand, bottom-up approaches such as artificial life approaches are the opposite to of the top-down approaches of searches covering all transactions, and may provide new methods of breaking away from the completeness of searches in conventional algorithms. Here, an artificial life data mining technique is proposed in which one transaction is considered as one individual, and association rules are accumulated by the interaction of randomly selected individuals. The proposed algorithm is compaired to other methods in application to a large-scale actual dataset, and it is verified that its performance is greatly superior to that of the method using transaction data virtually divided and that of apriori method by sampling approach, thus demonstrating its usefulness.

Original languageEnglish
Title of host publicationProceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007
Pages318-323
Number of pages6
DOIs
Publication statusPublished - 2007
Event2007 IEEE International Conference on Granular Computing, GrC 2007 - San Jose, CA, United States
Duration: 2007 Nov 22007 Nov 4

Other

Other2007 IEEE International Conference on Granular Computing, GrC 2007
CountryUnited States
CitySan Jose, CA
Period07/11/207/11/4

Fingerprint

Artificial Life
Association Rule Mining
Association rules
Speedup
Data mining
Transactions
Data Mining
Sampling
Association Rules
Bottom-up
Pruning
Completeness
Covering
Interaction

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Theoretical Computer Science

Cite this

Kanakubo, M., & Hagiwara, M. (2007). Speed-up technique for association rule mining based on an artificial life algorithm. In Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007 (pp. 318-323). [4403117] https://doi.org/10.1109/GRC.2007.4403117

Speed-up technique for association rule mining based on an artificial life algorithm. / Kanakubo, Masaaki; Hagiwara, Masafumi.

Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007. 2007. p. 318-323 4403117.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kanakubo, M & Hagiwara, M 2007, Speed-up technique for association rule mining based on an artificial life algorithm. in Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007., 4403117, pp. 318-323, 2007 IEEE International Conference on Granular Computing, GrC 2007, San Jose, CA, United States, 07/11/2. https://doi.org/10.1109/GRC.2007.4403117
Kanakubo M, Hagiwara M. Speed-up technique for association rule mining based on an artificial life algorithm. In Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007. 2007. p. 318-323. 4403117 https://doi.org/10.1109/GRC.2007.4403117
Kanakubo, Masaaki ; Hagiwara, Masafumi. / Speed-up technique for association rule mining based on an artificial life algorithm. Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007. 2007. pp. 318-323
@inproceedings{98ec34c32e0c454cb71da920093b0ccf,
title = "Speed-up technique for association rule mining based on an artificial life algorithm",
abstract = "Association rule mining is one of the most important issues in data mining. Apriori computation schemes greatly reduce the computation time by pruning the candidate itemset. However, a large computation time is required when the treated data are dense and the amount of data is large. With apriori methods, the problem of becoming incomputable cannot be avoided when the total number of items is large. On the other hand, bottom-up approaches such as artificial life approaches are the opposite to of the top-down approaches of searches covering all transactions, and may provide new methods of breaking away from the completeness of searches in conventional algorithms. Here, an artificial life data mining technique is proposed in which one transaction is considered as one individual, and association rules are accumulated by the interaction of randomly selected individuals. The proposed algorithm is compaired to other methods in application to a large-scale actual dataset, and it is verified that its performance is greatly superior to that of the method using transaction data virtually divided and that of apriori method by sampling approach, thus demonstrating its usefulness.",
author = "Masaaki Kanakubo and Masafumi Hagiwara",
year = "2007",
doi = "10.1109/GRC.2007.4403117",
language = "English",
isbn = "076953032X",
pages = "318--323",
booktitle = "Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007",

}

TY - GEN

T1 - Speed-up technique for association rule mining based on an artificial life algorithm

AU - Kanakubo, Masaaki

AU - Hagiwara, Masafumi

PY - 2007

Y1 - 2007

N2 - Association rule mining is one of the most important issues in data mining. Apriori computation schemes greatly reduce the computation time by pruning the candidate itemset. However, a large computation time is required when the treated data are dense and the amount of data is large. With apriori methods, the problem of becoming incomputable cannot be avoided when the total number of items is large. On the other hand, bottom-up approaches such as artificial life approaches are the opposite to of the top-down approaches of searches covering all transactions, and may provide new methods of breaking away from the completeness of searches in conventional algorithms. Here, an artificial life data mining technique is proposed in which one transaction is considered as one individual, and association rules are accumulated by the interaction of randomly selected individuals. The proposed algorithm is compaired to other methods in application to a large-scale actual dataset, and it is verified that its performance is greatly superior to that of the method using transaction data virtually divided and that of apriori method by sampling approach, thus demonstrating its usefulness.

AB - Association rule mining is one of the most important issues in data mining. Apriori computation schemes greatly reduce the computation time by pruning the candidate itemset. However, a large computation time is required when the treated data are dense and the amount of data is large. With apriori methods, the problem of becoming incomputable cannot be avoided when the total number of items is large. On the other hand, bottom-up approaches such as artificial life approaches are the opposite to of the top-down approaches of searches covering all transactions, and may provide new methods of breaking away from the completeness of searches in conventional algorithms. Here, an artificial life data mining technique is proposed in which one transaction is considered as one individual, and association rules are accumulated by the interaction of randomly selected individuals. The proposed algorithm is compaired to other methods in application to a large-scale actual dataset, and it is verified that its performance is greatly superior to that of the method using transaction data virtually divided and that of apriori method by sampling approach, thus demonstrating its usefulness.

UR - http://www.scopus.com/inward/record.url?scp=46749150490&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=46749150490&partnerID=8YFLogxK

U2 - 10.1109/GRC.2007.4403117

DO - 10.1109/GRC.2007.4403117

M3 - Conference contribution

AN - SCOPUS:46749150490

SN - 076953032X

SN - 9780769530321

SP - 318

EP - 323

BT - Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007

ER -