A Dynamic Binary Group Approach for Fast Mining Frequent Closed Itemsets

Yue Zhai; An Sheng Deng

doi:10.4028/www.scientific.net/AMM.644-650.1903

Paper Titles

Research and Analysis of Intrusion Prevention Based on Trusted in Cloud Environment
p.1887

A New Algorithm for Euclidean Shortest Path of Visiting Segments in a Polygon
p.1891

Content-Based Multimedia Files Search Technology
p.1895

Numerical Analysis of Roof Pre-Splitting Roadway Effect in Incline Coal Seam
p.1899

A Dynamic Binary Group Approach for Fast Mining Frequent Closed Itemsets
p.1903

A Key Management Algorithm Based on Fingerprint and Fuzzy Decision
p.1907

Parallel Optimization the AES Algorithm Based on MapReduce
p.1911

Research and Implementation of Optimizing CRS Code for Data Recovery in Cloud Storage System
p.1915

An Access Control Method Based on CP-ABE and ABS Algorithm in Cloud Storage
p.1919

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 644-650A Dynamic Binary Group Approach for Fast Mining...

A Dynamic Binary Group Approach for Fast Mining Frequent Closed Itemsets

Abstract:

Frequent closed itemsets play an important role in pruning redundant rules fast. A lot of algorithms for mining FCI by vertical data formats have been developed. Previous methods often consume more memory for storage Bit-Vectors and the time for computing the intersection among Bit-Vectors. In this paper, it uses Dynamic Binary Group for compress the database and generates DBG-lattice for mining FCI. Advantages of this method are fast computing the support and the intersection of two DBGs. Experimental results show the efficient of this method in both the mining time and memory usage.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 644-650)

Pages:

1903-1906

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.644-650.1903

Citation:

Cite this paper

Online since:

September 2014

Authors:

Yue Zhai*, An Sheng Deng

Keywords:

Dynamic Binary Group, Frequent Closed Itemsets, Lattice, Pruning

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] M.J. Zaki and C.J. Hsiao, CHARM: An Efficient Algorithm for Closed Itemset Mining, " Proc. 2002 SIAM Int'l Conf. Data Mining (SDM , 02), 457-473, Apr. (2002).

DOI: 10.1137/1.9781611972726.27

Google Scholar

[2] Dong, J., & Han, M. BitTable-FI: An efficient mining frequent itemsets algorithm. Knowledge Based Systems, 20(4), 329–335, (2007).

DOI: 10.1016/j.knosys.2006.08.005

Google Scholar

[3] T. Uno, T. Asai, Y. Uchida, H. Arimura, LCM: An Efficient Algorithm for Enumerat-ing Frequent Closed Item Sets, " In Proc. IEEE ICDM'03 Workshop FIMI, 03, (2003).

Google Scholar

[4] Vo, B., & Le, B. Mining minimal non-redundant association rules using frequent itemsets lattice. Journal of Intelligent Systems Technology and Applications, 10(1), 92–206. (2011).

DOI: 10.1504/ijista.2011.038265

Google Scholar

[5] Song, W., Yang, B., & Xu, Z. (2008). Index-BitTableFI: An improved algorithm for mining frequent itemsets. Knowledge Based Systems, 21(6), 507–513.

DOI: 10.1016/j.knosys.2008.03.011

Google Scholar