Jumping emerging patterns with negation in transaction databases - Classification and discovery

Information Sciences

Volumn 177, Issue 24, 2007, Pages 5675-5690

  Terlecki, Pawel ^a   Walczak, Krzysztof ^a  

^a WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Contradictory database; Extended database; Jumping emerging pattern; Local reduct; Negation; Rough set; Transaction database

Indexed keywords

CLASSIFICATION (OF INFORMATION); INFORMATION SCIENCE; PROBLEM SOLVING; ROUGH SET THEORY;

JUMPING EMERGING PATTERNS WITH NEGATION (JEPN); LOCAL REDUCT; TRANSACTION DATABASE;

DATABASE SYSTEMS;

EID: 34648858606     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2007.07.018     Document Type: Article

References (30)

1. Antonie M.-L., and Zaiane O.R. Mining positive and negative association rules: an approach for confined rules. PKDD'04: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004), Springer-Verlag New York, Inc., New York, NY, USA 27-38
2. Bailey J., Manoukian T., and Ramamohanarao K. Fast algorithms for mining emerging patterns. PKDD'02 (2002), Springer-Verlag 39-50
3. Jan Bazan, Hung Son Nguyen, Sinh Hoa Nguyen, Piotr Synak, Jakub Wroblewski, Rough set algorithms in classification problem. Rough Set Methods and Applications: New Develop. in Knowl. Disc. in Inform. Syst., 2000, pp. 49-88.
4. Jean-François Boulicaut, Artur Bykowski, Baptiste Jeudy, Towards the tractable discovery of association rules with negations, in: Intl. Conf. on Flexible Query Answering Systems, 2000, pp. 425-434.
5. C.L. Blake, D.J. Newman, S. Hettich, C.J. Merz, UCI Repository of Machine Learning Databases, 1998.
6. Dong G., and Li J. Mining border descriptions of emerging patterns from dataset pairs. Knowl. Inform. Syst. 8 2 (2005) 178-202
7. Hongjian Fan, Efficient mining of interesting emerging patterns and their effective use in classification, Ph.D. thesis, University of Melbourne, 2004.
8. Fan H., and Ramamohanarao K. An efficient single-scan algorithm for mining essential jumping emerging patterns for classification. PAKDD'02: Proceedings of the 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining (2002), Springer-Verlag, London, UK 456-462
9. Fan H., and Ramamohanarao K. Fast discovery and the generalization of strong jumping emerging patterns for building compact and accurate classifiers. IEEE Trans. Knowl. Data Eng. 18 6 (2006) 721-737
10. Fayyad U.M., and Irani K.B. Multi-interval discretization of continuous-valued attributes for classification learning. In: Bajcsy R. (Ed). Proceedings of the 13th International Joint Conference on Artificial Intelligence (1993), Morgan Kaufman 1022-1029
11. Fortes I., Balcßzar J.L., and Morales R. Bounding negative information in frequent sets algorithms. Advances in Artificial Intelligence. Lecture Notes in Artificial Intelligence vol. 2226 (2001), Springer 50-58
12. Farhad Hussain, Huan Liu, Einoshin Suzuki, Hongjun Lu, Exception rule mining with a relative interestingness measure, in: PAKDD, 2000, pp. 86-97.
13. Kryszkiewicz M., and Cichon K. Support oriented discovery of generalized disjunction-free representation of frequent patterns with negation. Lecture Notes in Computer Science 3518 (2005) 672-682
14. Li J., Dong G., and Ramamohanarao K. Making use of the most expressive jumping emerging patterns for classification. Knowl. Inform. Syst. 3 2 (2001) 1-29
15. Li J., and Jones J. Using multiple and negative target rules to make classifiers more understandable. Knowl.-Based Syst. 19 6 (2006) 438-444
16. Padmanabhan B., and Tuzhilin A. Small is beautiful: discovering the minimal set of unexpected patterns. KDD'00: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2000), ACM Press, New York, NY, USA 54-63
17. Pawlak Z. Rough sets. Int. J. Comput. Inform. Sci. 11 (1982) 341-356
18. Pawlak Z. Rough Sets: Theoretical Aspects of Reasoning about Data (1992), Kluwer Academic Publishers, Dordrecht
19. Pawlak Z., and Skowron A. Rough sets: some extensions. Inform. Sci. 177 1 (2007) 28-40
20. Pawlak Z., and Skowron A. Rudiments of rough sets. Inform. Sci. 177 1 (2007) 3-27
21. Savasere A., Omiecinski E., and Navathe S.B. Mining for strong negative associations in a large database of customer transactions. ICDE'98: Proceedings of the Fourteenth International Conference on Data Engineering (1998), IEEE Computer Society, Washington, DC, USA 494-502
22. Silverstein C., Brin S., and Motwani R. Beyond market baskets: generalizing association rules to dependence rules. Data Min. Knowl. Discov. 2 1 (1998) 39-68
23. Skowron A., and Rauszer C. The discernibility matrices and functions in information systems. In: Slowinski R. (Ed). Intelligent Decision Support (1992), Kluwer Academic Publishers, Dordrecht, The Netherlands 331-362
24. Terlecki P., and Walczak K. Attribute set dependence in apriori-like reduct computation. 1st International Conference on Rough Sets and Knowledge Technology. Lecture Notes in Artificial Intelligence vol. 4062 (2006), Springer-Verlag 268-276
25. Terlecki P., and Walczak K. Local reducts and jumping emerging patterns in relational databases. 5th International Conference on Rough Sets and Current Trends in Computing. Lecture Notes in Artificial Intelligence vol. 2903 (2006), Springer-Verlag 358-367
26. Terlecki P., and Walczak K. On the relation between rough set reducts and jumping emerging patterns. Inform. Sci. 177 1 (2007) 74-83
27. Jakub Wroblewski, Covering with reducts - a fast algorithm for rule generation, in: Rough Sets and Current Trends in Computing, 1998, pp. 402-407.
28. Wu X., Zhang C., and Zhang S. Efficient mining of both positive and negative association rules. ACM Trans. Inform. Syst. 22 3 (2004) 381-405
29. Yuan X., Buckles B.P., Yuan Z., and Zhang J. Mining negative association rules. ISCC'02: Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02) (2002), IEEE Computer Society, Washington, DC, USA 623
30. Ramamohanarao K., Wang Z., and Fan H. Exploiting Maximal Emerging Patterns for Classification. Lecture Notes in Computer Science vol. 3339 (2004), Springer-Verlag 1062-1068