Scalable algorithms for association mining
作者： M.J. Zaki
DOI: 10.1109/69.846291
关键词: Association mining 、 Scalable algorithms 、 Knowledge extraction 、 Association rule learning 、 Computer science 、 Tree traversal 、 Data mining
摘要: Association rule discovery has emerged as an important problem in knowledge discovery and data mining. The association mining task consists of identifying the frequent itemsets, and then forming conditional implication rules among them. We present efficient algorithms for the discovery of frequent itemsets which forms the compute intensive phase of the task. The algorithms utilize the structural properties of frequent itemsets to facilitate fast discovery. The items are organized into a subset lattice search space, which is decomposed into small …
computer.org
acm.org
core.ac.uk
ieeecomputersociety.org
rpi.edu 
cnr.it 参考文章(36)
Heikki Mannila, Hannu T. T. Toivonen, Rakesh Agrawal, Rayadurgam Srikant, Verkamo: Fast Discovery of Association Rules knowledge discovery and data mining. ,(1996)
Dao-I Lin, Zvi M. Kedem, Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set extending database technology. pp. 105- 119 ,(1998) , 10.1007/BFB0100980
Srinivasan Parthasarathy, Mitsunori Ogihara, Mohammed J Zaki, Wei Li, New algorithms for fast discovery of association rules knowledge discovery and data mining. pp. 283- 286 ,(1997)
Ramakrishnan Srikant, Rakesh Agrawal, Fast algorithms for mining association rules very large data bases. pp. 580- 592 ,(1998)
Srinivasan Parthasarathy, Mohammed J. Zaki, Wei Li, Memory placement techniques for parallel association mining knowledge discovery and data mining. pp. 304- 308 ,(1998)
Ramakrishnan Srikant, Rakesh Agrawal, Fast Algorithms for Mining Association Rules in Large Databases very large data bases. pp. 487- 499 ,(1994)
Mohammed J. Zaki, Srinivasan Parthasarathy, Mitsunori Ogihara, Wei Li, Parallel Algorithms for Discovery of Association Rules Data Mining and Knowledge Discovery. ,vol. 1, pp. 343- 373 ,(1997) , 10.1023/A:1009773317876
Heikki Mannila, A. Inkeri Verkamo, Ramakrishnan Srikant, Hannu Toivonen, Rakesh Agrawal, Fast discovery of association rules knowledge discovery and data mining. pp. 307- 328 ,(1996)
Heikki Mannila, Sanjeev Saluja, Dimitrios Gunopulos, Discovering All Most Specific Sentences by Randomized Algorithms international conference on database theory. pp. 215- 229 ,(1997)
Shamkant B. Navathe, Edward Omiecinski, Ashoka Savasere, An Efficient Algorithm for Mining Association Rules in Large Databases very large data bases. pp. 432- 444 ,(1995)