MaxMining: A Novel Algorithm for Mining Maximal Frequent Itemset

Article Preview

Abstract:

We present a new algorithm for mining maximal frequent itemsets, MaxMining, from big transaction databases. MaxMining employs the depth-first traversal and iterative method. It re-represents the transaction database by vertical tidset format, travels the search space with effective pruning strategies which reduces the search space dramatically. MaxMining removes all the non-maximal frequent itemsets to get the exact set of maximal frequent itemsets directly, no need to enumerate all the frequent itemsets from smaller ones step by step. It backtracks to the proper ancestor directly, needless level by level, ignoring those redundant frequent itemsets. We found that MaxMining can be more effective to find all the maximal frequent itemsets from big databases than many of proposed algorithms with ordinary pruning strategies.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1765-1768

Citation:

Online since:

January 2015

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2015 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Xingdong Wu, Gong-Qing Wu, Wei Ding. Data Mining with Big Data[J]. IEEE Transactions on Knowledge and Data Engineering, Vol. 26, No. 1, January 2014. pp.97-107.

DOI: 10.1109/tkde.2013.109

Google Scholar

[2] A. Rajaraman and J. Ullman, Mining of Massive Data Sets. Cambridge University Press, (2011).

Google Scholar

[3] A. Labrinidis and H. Jagadish, Challenges and Opportunities with Big Data, Proc. VLDB Endowment, vol. 5, no. 12, 2012, p.2032-(2033).

DOI: 10.14778/2367502.2367572

Google Scholar

[4] E. Schadt, The Changing Privacy Landscape in the Era of Big Data, Molecular Systems, Vol. 8, (2012).

Google Scholar

[5] C. Wang, S.S.M. Chow, Q. Wang, K. Ren, and W. Lou, Privacy-preserving Public Auditing for Secure Cloud Storage, IEEE Trans. Computers, vol. 62, no. 2 , Feb. 2013: pp.362-375.

DOI: 10.1109/tc.2011.245

Google Scholar

[6] Zdanowicz, J. Detecting money laundering and terrorist financing via data mining. Communications of the ACM, 2004, pp.53-55.

DOI: 10.1145/986213.986239

Google Scholar

[7] Stephen Lavelle, Fabricating Synthetic Data in Support of Training for Domestic Terrorist Activity Data Mining Research[D]. Naval Postgraduate School, Monterey, CA, (2010).

Google Scholar

[8] Office of the Director of National Intelligence. Data Mining Report. Office of the Director of National Intelligence, (2009).

Google Scholar

[9] Agrawal R., Imielinski T., Swami A., Mining Association Rules between Sets of Items in Large Databases. in: Inter. Proc. of the 1993 ACM SIGMOD, Washington DC, 1993. pp.207-216.

DOI: 10.1145/170036.170072

Google Scholar

[10] Karam Gouda, Mohammed J. Zaki. Efficiently Mining Maximal Frequent Itemsets. in: Proceedings of 2001 IEEE International Conference on Data Mining. San Jose California. 2001. pp.63-170.

DOI: 10.1109/icdm.2001.989514

Google Scholar

[11] Endu Duneja, Bhopal M, Sachan R. A survey on frequent itemset mining with association rules[J]. International Journal of Computer Applications, 2012, 46(23): pp.18-24.

Google Scholar