Jochen Hipp
- {1} R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. of the ACM SIGMOD Int'l Conf. on Management of Data (ACM SIGMOD '93), Washington, USA, May 1993. Google Scholar
Digital Library
- {2} R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of the 20th Int'l Conf. on Very Large Databases (VLDB '94), Santiago, Chile, June 1994. Google ScholarDigital Library
- {3} R. Agrawal and R. Srikant. Mining sequential patterns. In Proc. of the Int'l Conf. on Data Engineering (ICDE), Taipei, Taiwan, March 1995. Google ScholarDigital Library
- {4} N. F. Ayan, A. U. Tansel, and E. Arkun. An efficient algorithm to update large itemsets with early pruning. In Proc. of the 5th Int'l Conf. on Knowledge Discovery and Data Mining (KDD '99), San Diego, California, USA, August 1999. Google ScholarDigital Library
- {5} R. J. Bayardo Jr., R. Agrawal, and D. Gunopulos. Constraint-based rule mining in large, dense databases. In Proc. of the 15th Int'l Conf. on Data Engineering, Sydney, Australia, March 1999. Google ScholarDigital Library
- {6} S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules to correlations. In Proc. of the ACM SIGMOD Int'l Conf. on Management of Data (ACM SIGMOD '97), 1997. Google ScholarDigital Library
- {7} S. Brin, R. Motwani, J. D. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket data. In Proc. of the ACM SIGMOD Int'l Conf. on Management of Data, 1997. Google ScholarDigital Library
- {8} T. Fukuda, Y. Morimoto, S. Morishita, and T. Tokuyama. Mining optimized association rules for numeric attributes. In Proc. of the 15th ACM SIGACT-SIGMOD- SIGART Syrup. on Principles of Database Systems (PODS '96), Montreal, Canada, June 1996. Google ScholarDigital Library
- {9} J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. of the 2000 ACM-SIGMOD Int'l Conf. on Management of Data, Dallas, Texas, USA, May 2000. Google ScholarDigital Library
- {10} C. Hidber. Online association rule mining. In Proc. of the 1999 ACM SIGMOD Conf. on Management of Data, 1999. Google ScholarDigital Library
- {11} J. Hipp, U. Güntzer, and G. Nakhaeizadeh. Mining association rules: Deriving a superior algorithm by analysing today's approaches. In Proc. of the 4th European Conf. on Principles and Practice of Knowledge Discovery, Lyon, France, September 2000. to appear.Google ScholarCross Ref
- {12} J. Hipp, A. Myka, R. Wirth, and U. Güntzer. A new algorithm for faster mining of generalized association rules. In Proc. of the 2nd European Symposium on Principles of Data Mining and Knowledge Discovery (PKDD '98), Nantes, France, September 1998. Google ScholarDigital Library
- {13} M. Houtsma and A. Swami. Set-oriented mining for association rules in relational databases. Technical Report RJ 9567, IBM Almaden Research Center, San Jose, California, Oktober 1993.Google Scholar
- {14} M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen, and A. I. Verkamo. Finding interesting rules from large sets of discovered association rules. In Proc. of the 3rd Int'l Conf. on Information and Knowledge Management , Gaithersburg, Maryland, 29. Nov - 2. Dez 1994. Google ScholarDigital Library
- {15} H. Mannila, H. Toivonen, and I. Verkamo. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1(3), November 1997. Google ScholarDigital Library
- {16} R. Motwani, E. Cohen, M. Datar, S. Fujiware, A. Gionis, P. Indyk, J. D. Ullman, and C. Yang. Finding interesting associations without support pruning. In Proc. of the 16th Int'l Conf. on Data engineering (ICDE). IEEE, 2000. Google ScholarDigital Library
- {17} R. Ng, L. S. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained associations rules. In Proc. of 1998 ACM SIGMOD Int'l Conf. on Management of Data, Seattle, Washington, USA, June 1998. Google ScholarDigital Library
- {18} N. Pasqnier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In Proc. of the 7th Int'l Conf. on Database Theory (ICDT'99), Jerusalem, Israel, January 1999.Google Scholar
- {19} J. Pei, J. Hart, and R. Mao. An efficient algorithm for mining frequent closed itemsets. In Proc. of the 2000 ACM-SIGMOD Int'l Conf. on Management of Data, Dallas, Texas, USA, May 2000.Google Scholar
- {20} R. Rastogi and K. Shim. Mining optimized support rules for numeric attributes. In Proc. of the 15th Int'l Conf. on Data Engineering, Sydney, Australia, March 1999. IEEE Computer Society Press. Google ScholarDigital Library
- {21} A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In Proc. of the 21st Conf. on Very Large Databases (VLDB '95), Zürich, Switzerland, September 1995. Google ScholarDigital Library
- {22} C. Silverstein, S. Brin, R. Motwani, and J. D. Ullman. Scalable techniques for mining causal structures. In Proc. of 1998 ACM SIGMOD Int'l Conf. on Management of Data, Seattle, Washington, USA, June 1998.Google Scholar
- {23} R. Srikant and R. Agrawal. Mining generalized association rules. In Proc. of the 21st Conf. on Very Large Databases (VLDB '95), Zürich, Switzerland, September 1995. Google ScholarDigital Library
- {24} R. Srikant and R. Agrawal. Mining quantitative association rules in large relational tables. In Proc. of the 1996 ACM SIGMOD Conf. on Management of Data, Montreal, Canada, June 1996. Google ScholarDigital Library
- {25} R. Srikant, Q. Vu, and R. Agrawal. Mining association-rules with item constraints. In Proc. of the 3rd Int'l Conf. on KDD and Data Mining (KDD '97), Newport Beach, California, August 1997.Google Scholar
- {26} S. Thomas, S. Bodagala, K. Alsabti, and S. Ranka. An efficient algorithm for the incremental updation of association rules in large databases. In Proc. of the 3rd Int 'l Conf. on KDD and Data Mining (KDD '97), Newport Beach, California, August 1997.Google Scholar
- {27} D. Tsur, J. D. Ullman, S. Abitboul, C. Clifton, R. Motwani, S. Nestorov, and A. Rosenthal. Query flocks: A generalization of association-rule mining. In Proc. of 1998 ACM SIGMOD Int'l Conf. on Management of Data, Seattle, Washington, USA, June 1998. Google ScholarDigital Library
- {28} M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In Proc. of the 3rd Int'l Conf. on KDD and Data Mining (KDD '97), Newport Beach, California, August 1997. Google ScholarDigital Library
Index Terms
- Algorithms for association rule mining — a general survey and comparison
Recommendations
Rapid association rule mining
CIKM '01: Proceedings of the tenth international conference on Information and knowledge managementAssociation rule mining is a well-researched area where many algorithms have been proposed to improve the speed of mining. In this paper, we propose an innovative algorithm called Rapid Association Rule Mining (RARM) to once again break this speed ...
A Survey on Association Rule Mining
ACCT '15: Proceedings of the 2015 Fifth International Conference on Advanced Computing & Communication TechnologiesTask of extracting useful and interesting knowledge from large data is called data mining. It has many aspects like clustering, classification, association mining, outlier detection, regression etc. Among them association rule mining is one of the ...
Comments