Affiliation:
1. Université François-Rabelais de Tours, Blois France
Abstract
In 1993, Rakesh Agrawal, Tomasz Imielinski and Arun N. Swami published one of the founding papers of Pattern Mining: "Mining Association Rules between Sets of Items in Large Databases". Beyond the introduction to a new problem, it introduced a new methodology in terms of resolution and evaluation. For two decades, Pattern Mining has been one of the most active fields in Knowledge Discovery in Databases. This paper provides a bibliometric survey of the literature relying on 1,087 publications from five major international conferences: KDD, PKDD, PAKDD, ICDM and SDM. We first measured a slowdown of research dedicated to Pattern Mining while the KDD field continues to grow. Then, we quantified the main contributions with respect to languages, constraints and condensed representations to outline the current directions. We observe a sophistication of languages over the last 20 years, although association rules and itemsets are so far the most studied ones. As expected, the minimal support constraint predominates the extraction of patterns with approximately 50% of the publications. Finally, condensed representations used in 10% of the papers had relative success particularly between 2005 and 2008.
Publisher
Association for Computing Machinery (ACM)
Reference26 articles.
1. Mining association rules between sets of items in large databases
2. J. L.
Balcázar
.
Minimum-size bases of association rules
. In W. Daelemans B. Goethals and K. Morik editors ECML/PKDD (1) volume
5211
of
Lecture Notes in Computer Science pages
86
--
101
.
Springer 2008
. 10.1007/978-3-540-87479-9_24 J. L. Balcázar. Minimum-size bases of association rules. In W. Daelemans B. Goethals and K. Morik editors ECML/PKDD (1) volume 5211 of Lecture Notes in Computer Science pages 86--101. Springer 2008. 10.1007/978-3-540-87479-9_24
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献