Mining unexpected rules by pushing user dynamics

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

Volumn , Issue , 2003, Pages 246-255

  Wang, Ke ^a   Jiang, Yuelong ^a   Lakshmanan, Laks V S ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Association rule; Subjective interestingness; Unexpected rule

Indexed keywords

INTERESTING RULES; INTERESTINGNESS; PRIOR KNOWLEDGE; SUBJECTIVE INTERESTINGNESS; THREE PROBLEMS; USER DYNAMICS;

ASSOCIATIVE PROCESSING; DATA MINING;

ASSOCIATION RULES;

EID: 33646753131     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/956750.956780     Document Type: Conference Paper

References (23)

1. Kdd-cup-98 dataset. http://kdd.ics.uci.edu/databases/kddcup98/kddcup98. html.
2. R. Agrawal and R. Srikant. Fast algorithm for mining association rules. In VLDB, pages 487-499, September 1994.
3. R. Bayardo and R. Agrawal. Mining the most interesting rules. In SIGKDD. SIGKDD, 1999.
4. R. Bayardo, R. Agrawal, and D. Gunopulos. Constraint-based rule mining in large, dense databases. In ICDE. IEEE, 1999.
5. K. Beyer and R. Ramakrishnan. Bottom-up computation of sparse and iceberg cubes. In SIGMOD, pages 359-370, 1999.
6. S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules to correlations. In SIGMOD, pages 265-276, 1997.
7. M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonene, and A. Verkamo. Finding interesting rules from large sets of discovered association rules. In CIKM 94, 1994.
8. B. Liu and W. Hsu. Post-analysis of learned rules. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), pages 828-834. AAAI, Aug. 1996.
9. B. Liu, W. Hsu, and S. Chen. Using general impressions to analyze discovered classification rules. In KDD, 1997.
10. R. Ng, L. V. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained associations rules. In SIGMOD, pages 13-24, 1998.
11. B. Padmanabhan and A. Tuzhilin. A belief-drievn method for discovering unexpected patterns. In KDD-98. SIGKDD, 1998.
12. B. Padmanabhan and A. Tuzhilin. Unexpectedness as a measure of interestingness in knowledge discovery. In KDD-98. SIGKDD, 1998.
13. B. Padmanabhan and A. Tuzhilin. Small is beautiful: Discovering the minimal set of unexpected patterns. In SIGKDD, pages 54-63. SIGKDD, 2000.
14. G. Piatesky-Shapiro. Discovery, analysis and presentation of strong rules. In Knowledge Discovery in Databases, pages 229-248. MIT Press, 1991.
15. G. Piatesky-Shapiro and C. Matheus. The interestingness of deviations. In KDD-94. SIGKDD, 1994.
16. S. Sahar. Interestingnes via what is not interesting. In SIGKDD, pages 332-336. SIGKDD, 1999.
17. A. Silberschatz and A. Tuzhilin. On subjective measures of interestingnessin in knowledge discovery. In KDD, pages 275-281. KDD, 1995.
18. A. Silberschatz and A. Tuzhilin. What makes patterns interesting in knowledge discovery systems. In IEEE Transactions on Knowledge and Data Engineering, 1996.
19. R. Srikant, Q. Vu, and R. Agrawal. Mining association rules with item constraints. In KDD, pages 67-73. SIGKDD, 1997.
20. P.-N. Tan and V. Kumar. Interestingness measures for association patterns: A perspectives. In KDD-2000 Workshop on Post-Processing in Machine Learning and Data Mining, 2000.
21. K. Wang, Y. He, and J. Han. Pushing support constraints into frequent itemset mining. In VLDB, 2000.
22. K. Wang, Y. Jiang, J. Yu, G. Dong, and J. Han. Pushing aggregate constraints by divide-and-approximate. In ICDE. IEEE, 2003.
23. M. Zaki. Generating non-redundant association rules. In SIGKDD 2000. SIGKDD, 2000.