Jiawei Han
Jian Pei
- 1.R. Agarwal, C. Aggarwal, and V. V. V. Prasad. A tree projection algorithm for generation of frequent itemsets. In Journal of Parallel and Distributed Computing (special Issue on High Performance Data Mining), (to appear), 2000. Google Scholar
Digital Library
- 2.R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. I994 Int. Conf. Very Large Data Bases (VLDB'94), pages 48-499, Santiago, Chile, September 1994. Google ScholarDigital Library
- 3.R. Agrawal and R. Srikmlt. Mining sequential patterns. In Proe. I995 Int. Conf. Data Engineering (ICDE'95), pages 3 14, Taipei, Taiwan, March 1995. Google ScholarDigital Library
- 4.J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proe. 2000 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'O0), Dallas, TX, May 2000. Google ScholarDigital Library
- 5.H. Mannila, H Toivonen, and A. I. Verkamo. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1:259 289, 1997. Google ScholarDigital Library
- 6.R. Srikant and R. Agrawal. Mining quantitative association rules in large relational tables. In Proc. I996 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'96), pages 1 12, Montreal, Canada, June 1996. Google ScholarDigital Library
- 7.R. Srikmlt and R. Agrawal. Mining sequential patterns: Generalizations and performance improvements. In Proc. 5th Int. Conf. Extending Database Technology (EDBT), pages 3 17, Avignon, France, March 1996. Google ScholarDigital Library
Index Terms
- FreeSpan: frequent pattern-projected sequential pattern mining
Recommendations
Efficient algorithms for mining constrained frequent patterns from uncertain data
U '09: Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain DataMining of frequent patterns is one of the popular knowledge discovery and data mining (KDD) tasks. It also plays an essential role in the mining of many other patterns such as correlation, sequences, and association rules. Hence, it has been the subject ...
Efficient algorithms for mining high-utility itemsets in uncertain databases
High-utility itemset mining (HUIM) is a useful set of techniques for discovering patterns in transaction databases, which considers both quantity and profit of items. However, most algorithms for mining high-utility itemsets (HUIs) assume that the ...
A method for mining top-rank-k frequent closed itemsets
Collective intelligent information and database systemsMining frequent closed itemsets (FCIs) is important in mining non-redundant (minimal) association rules. Therefore, many algorithms have been developed for mining FCIs with reduced mining time and memory usage. For mining FCIs, algorithms use the minimum ...
Comments