A Unifying Polynomial Model for Efficient Discovery of Frequent Itemsets

Slimane Oulad-Naoui, Hadda Cherroun, Djelloul Ziadi

2015

Abstract

It is well-known that developing a unifying theory is one of the most important issues in Data Mining research. In the last two decades, a great deal has been devoted to the algorithmic aspects of the Frequent Itemset (FI) Mining problem. We are motivated by the need of formal modeling in the field. Thus, we introduce and analyze, in this theoretical study, a new model for the FI mining task. Indeed, we encode the itemsets as words over an ordered alphabet, and state this problem by a formal series over the counting semiring (N,+,x,0,1), whose the range constitutes the itemsets and the coefficients their supports. This formalism offers many advantages in both fundamental and practical aspects: The introduction of a clear and unified theoretical framework through which we can express the main FI-approaches, the possibility of their generalization to mine other more complex objects, and their incrementalization and/or parallelization; in practice, we explain how this problem can be seen as that of word recognition by an automaton, allowing an efficient implementation in O(|Q|) space and O(|FL||Q|]) time, where Q is the set of states of the automaton used for representing the data, and FL the set of prefixial maximal FI.

References

  1. Agrawal, R. and Srikant, R. (1994). Fast algorithms for mining association rules in large databases. In VLDB'94, Proceedings of 20th International Conference on Very Large Data Bases, September 12-15, 1994, Santiago de Chile, Chile, pages 487-499.
  2. Cheung, W. and Zaïane, O. R. (2003). Incremental mining of frequent patterns without candidate generation or support constraint. In 7th International Database Engineering and Applications Symposium (IDEAS 2003), 16-18 July 2003, Hong Kong, China, pages 111-116.
  3. Godin, R., Missaoui, R., and Alaoui, H. (1995). Incremental concept formation algorithms based on galois (concept) lattices. Computational Intelligence, 11:246- 267.
  4. Goethals, B. (2004). Memory issues in frequent itemset mining. In Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), Nicosia, Cyprus, March 14-17, 2004, pages 530-534.
  5. Goethals, B. and Zaki, M. J., editors (2003). FIMI 7803, Frequent Itemset Mining Implementations, Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations, 19 December 2003, Melbourne, Florida, USA, volume 90 of CEUR Workshop Proceedings. CEUR-WS.org.
  6. Han, J., Cheng, H., Xin, D., and Yan, X. (2007). Frequent pattern mining: current status and future directions. Data Min. Knowl. Discov., 15(1):55-86.
  7. Han, J., Pei, J., and Yin, Y. (2000). Mining frequent patterns without candidate generation. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, May 16-18, 2000, Dallas, Texas, USA., pages 1-12.
  8. Han, J., Pei, J., Yin, Y., and Mao, R. (2004). Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min. Knowl. Discov., 8(1):53-87.
  9. Hipp, J., Güntzer, U., and Nakhaeizadeh, G. (2000). Algorithms for association rule mining - A general survey and comparison. SIGKDD Explorations, 2(1):58-64.
  10. Pasquier, N., Bastide, Y., Taouil, R., and Lakhal, L. (1999). Discovering frequent closed itemsets for association rules. In Proceedings of the 7th International Conference on Database Theory, ICDT 7899, pages 398-416, London, UK, UK. Springer-Verlag.
  11. Pijls, W. and Kosters, W. A. (2010). Mining frequent itemsets: a perspective from operations research. Statistica Neerlandica, 64(4):367-387.
  12. Salomaa, A., Soittola, M., Bauer, F., and Gries, D. (1978). Automata-theoretic aspects of formal power series. Texts and monographs in computer science. SpringerVerlag.
  13. Totad, S. G., Geeta, R. B., and Reddy, P. V. G. D. P. (2012). Batch incremental processing for fp-tree construction using fp-growth algorithm. Knowl. Inf. Syst., 33(2):475-490.
  14. Valtchev, P., Missaoui, R., and Godin, R. (2008). A framework for incremental generation of closed itemsets. Discrete Applied Mathematics, 156(6):924-949.
  15. Wille, R. (1982). Restructuring lattice theory: An approach based on hierarchies of concepts. In Rival, I., editor, Ordered Sets, volume 83 of NATO Advanced Study Institutes Series, pages 445-470. Springer Netherlands.
  16. Wu, X., Kumar, V., Quinlan, J. R., Ghosh, J., Yang, Q., Motoda, H., McLachlan, G. J., Ng, A. F. M., Liu, B., Yu, P. S., Zhou, Z., Steinbach, M., Hand, D. J., and Steinberg, D. (2008). Top 10 algorithms in data mining. Knowl. Inf. Syst., 14(1):1-37.
  17. Yang, Q. and Wu, X. (2006). 10 challenging problems in data mining research. International Journal of Information Technology and Decision Making, 5(4):597- 604.
  18. Zaki, M. (2000). Scalable algorithms for association mining. Knowledge and Data Engineering, IEEE Transactions on, 12(3):372-390.
  19. Zaki, M. J. and Ogihara, M. (1998). Theoretical foundations of association rules. In 3rd ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery.
  20. Zaki, M. J. and Wagner Meira, J. (2014). Data Mining and Analysis: Fundamental Concepts and Algorithms. Cambridge University Press.
Download


Paper Citation


in Harvard Style

Oulad-Naoui S., Cherroun H. and Ziadi D. (2015). A Unifying Polynomial Model for Efficient Discovery of Frequent Itemsets . In Proceedings of 4th International Conference on Data Management Technologies and Applications - Volume 1: DATA, ISBN 978-989-758-103-8, pages 49-59. DOI: 10.5220/0005516200490059


in Bibtex Style

@conference{data15,
author={Slimane Oulad-Naoui and Hadda Cherroun and Djelloul Ziadi},
title={A Unifying Polynomial Model for Efficient Discovery of Frequent Itemsets},
booktitle={Proceedings of 4th International Conference on Data Management Technologies and Applications - Volume 1: DATA,},
year={2015},
pages={49-59},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005516200490059},
isbn={978-989-758-103-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of 4th International Conference on Data Management Technologies and Applications - Volume 1: DATA,
TI - A Unifying Polynomial Model for Efficient Discovery of Frequent Itemsets
SN - 978-989-758-103-8
AU - Oulad-Naoui S.
AU - Cherroun H.
AU - Ziadi D.
PY - 2015
SP - 49
EP - 59
DO - 10.5220/0005516200490059