CP-summary: A concise representation for browsing frequent itemsets

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2009, Pages 687-695

  Poernomo, Ardian Kristanto ^a   Gopalkrishnan, Vivekanand ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Concise representations; Conditional profile; Frequent itemset; Summarization

Indexed keywords

CONCISE REPRESENTATIONS; CONDITIONAL PROFILE; FALSE NEGATIVES; FALSE POSITIVE; FREQUENT ITEMSET; FREQUENT ITEMSETS; SUMMARIZATION;

EID: 70350637779     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1557019.1557096     Document Type: Conference Paper

References (18)

1. F. N. Afrati, A. Gionis, and H. Mannila. Approximating a collection of frequent sets. In KDD, pages 12-19, 2004.
2. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In SIGMOD Conference, pages 94-105, 1998.
3. R. Agrawal, T. Imielinski, and A. N. Swami. Mining association rules between sets of items in large databases. In SIGMOD Conference, pages 207-216, 1993.
4. T. Calders and B. Goethals. Non-derivable itemset mining. DMKD, 14(1):171-206, 2007.
5. H. Cheng, X. Yan, J. Han, and P. S. Yu. Direct discriminative pattern mining for effective classification. In ICDE, pages 169-178, 2008.
6. J. Cheng, Y. Ke, and W. Ng. σ-tolerance closed frequent itemsets. In ICDM, pages 139-148, 2006.
7. D. Gunopulos, R. Khardon, H. Mannila, and H. Toivonen. Data mining, hypergraph transversals, and machine learning. In PODS, pages 209-216. ACM Press, 1997.
8. R. Jin, M. Abu-Ata, Y. Xiang, and N. Ruan. Effective and efficient itemset pattern summarization: regression-based approaches. In KDD, pages 399-407, 2008.
9. J. A. Kelner and D. A. Spielman. A randomized polynomial-time simplex algorithm for linear programming. In STOC, pages 51-60, 2006.
10. M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen, and A. I. Verkamo. Finding interesting rules from large sets of discovered association rules. In CIKM, pages 401-407, 1994.
11. M. Kryszkiewicz and M. Gajek. Concise representation of frequent patterns based on generalized disjunction-free generators. In PAKDD, pages 159-171, 2002.
12. B. Liu, W. Hsu, and Y. Ma. Integrating classification and association rule mining. In KDD, pages 80-86, 1998.
13. H. Mannila and H. Toivonen. Multiple uses of frequent sets and condensed representations (extended abstract). In KDD, pages 189-194, 1996.
14. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In ICDT, pages 398-416, 1999.
15. C. Wang and S. Parthasarathy. Summarizing itemset patterns using probabilistic models. In KDD, pages 730-735, 2006.
16. D. Xin, J. Han, X. Yan, and H. Cheng. Mining compressed frequent-pattern sets. In VLDB, pages 709-720, 2005.
17. X. Yan, H. Cheng, J. Han, and D. Xin. Summarizing itemset patterns: a profile-based approach. In KDD, pages 314-323, 2005.
18. X. Yan, P. S. Yu, and J. Han. Graph indexing: A frequent structure-based approach. In SIGMOD Conference, pages 335-346, 2004.