Database Reference
In-Depth Information
19. F. Korn, A. Labrinidis, Y. Kotidis, and C. Faloutsos. Ratio rules: A new paradigm for fast,
quantifiable data mining. In
Proc. 1998 Int. Conf. Very Large Data Bases (VLDB'98)
, pages
582-593, New York, NY, Aug. 1998.
20. L.V.S. Lakshmanan, R. Ng, J. Han, and A. Pang. Optimization of constrained frequent set
queries with 2-variable constraints. In
Proc. 1999 ACM-SIGMOD Int. Conf. Management of
Data (SIGMOD'99)
, pages 157-168, Philadelphia, PA, June 1999.
21. W. Li, J. Han, and J. Pei. CMAR: Accurate and efficient classification based on multiple class-
association rules. In
Proc. 2001 Int. Conf. Data Mining (ICDM'01)
, pages 369-376, San Jose,
CA, Nov. 2001.
22. B. Liu, W. Hsu, and Y. Ma. Integrating classification and association rule mining. In
Proc.
1998 Int. Conf. Knowledge Discovery and Data Mining (KDD'98)
, pages 80-86, New York,
NY, Aug. 1998.
23. H. Mannila, H. Toivonen, and A. I. Verkamo. Efficient algorithms for discovering association
rules. In
Proc. AAAI'94 Workshop on Knowledge Discovery in Databases (KDD'94)
, pages
181-192, Seattle, WA, July 1994.
24. H. Mannila, H. Toivonen, and A. I. Verkamo. Discovery of frequent episodes in event sequences.
Data Mining and Knowledge Discovery
, 1:259-289, 1997.
25. R. Ng, L.V.S. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations
of constrained associations rules. In
Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data
(SIGMOD'98)
, pages 13-24, Seattle, WA, June 1998.
26. B. Özden, S. Ramaswamy, and A. Silberschatz. Cyclic association rules. In
Proc. 1998 Int.
Conf. Data Engineering (ICDE'98)
, pages 412-421, Orlando, FL, Feb. 1998.
27. J. Pei and J. Han. Can we push more constraints into frequent pattern mining? In
Proc. 2000
ACM SIGKDD Int. Conf. Knowledge Discovery in Databases (KDD'00)
, pages 350-354,
Boston, MA, Aug. 2000.
28. J. Pei, J. Han, and R. Mao. CLOSET: An efficient algorithm for mining frequent closed item-
sets. In
Proc. 2000 ACM-SIGMOD Int. Workshop on Data Mining and Knowledge Discovery
(DMKD'00)
, pages 11-20, Dallas, TX, May 2000.
29. J. Pei, J. Han, and L.V.S. Lakshmanan. Mining frequent itemsets with convertible constraints.
In
Proc. 2001 Int. Conf. Data Engineering (ICDE'01)
, pages 433-442, Heidelberg, Germany,
April 2001.
30. J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M.-C. Hsu. PrefixSpan:
Mining sequential patterns efficiently by prefix-projected pattern growth. In
Proc. 2001 Int.
Conf. Data Engineering (ICDE'01)
, pages 215-224, Heidelberg, Germany, April 2001.
31. J. Pei, J. Han, H. Lu, S. Nishio, S. Tang, and D. Yang. H-Mine: Hyper-structure mining of
frequent patterns in large databases. In
Proc. 2001 Int. Conf. Data Mining (ICDM'01)
, pages
441-448, San Jose, CA, Nov. 2001.
32. J. Pei, X. Zhang, M. Cho, H. Wang, and P. S. Yu. Maple: A fast algorithm for maximal pattern-
based clustering. In
Proceedings of the Third IEEE International Conference on Data Mining
(ICDM'03)
, Melbourne, Florida, Nov. 2003. IEEE.
33. H. Pinto, J. Han, J. Pei, K. Wang, Q. Chen, and U. Dayal. Multi-dimensional sequential pattern
mining. In
Proc. 2001 Int. Conf. Information and Knowledge Management (CIKM'01)
, pages
81-88, Atlanta, GA, Nov. 2001.
34. C. Silverstein, S. Brin, R. Motwani, and J. D. Ullman. Scalable techniques for mining causal
structures. In
Proc. 1998 Int. Conf. Very Large Data Bases (VLDB'98)
, pages 594-605, New
York, NY, Aug. 1998.
35. R. Srikant and R. Agrawal. Mining sequential patterns: Generalizations and performance im-
provements. In
Proc. 5th Int. Conf. Extending Database Technology (EDBT'96)
, pages 3-17,
Avignon, France, Mar. 1996.
36. R. Srikant, Q. Vu, and R. Agrawal. Mining association rules with item constraints. In
Proc.
1997 Int. Conf. Knowledge Discovery and Data Mining (KDD'97)
, pages 67-73, Newport
Beach, CA, Aug. 1997.
