article

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

Authors:

Pawel Terlecki,

Krzysztof WalczakAuthors Info & Claims

Information Sciences—Informatics and Computer Science, Intelligent Systems, Applications: An International Journal, Volume 177, Issue 24

Pages 5675 - 5690

https://doi.org/10.1016/j.ins.2007.07.018

Published: 20 December 2007 Publication History

Abstract

This paper examines jumping emerging patterns with negation (JEPNs), i.e. JEPs that can contain negated items. We analyze the basic relations between these patterns and classical JEPs in transaction databases and local reducts from the rough set theory. JEPNs provide an interesting type of knowledge and can be successfully used for classification purposes. By analogy to JEP-Classifier, we consider negJEP-Classifier and JEPN-Classifier and compare their accuracy. The results are contrasted with changes in rule set complexity. In connection with the problem of JEPN discovery, JEP-Producer and rough set methods are examined.

References

[1]

Antonie, Maria-Luiza and Zaiane, Osmar R., Mining positive and negative association rules: an approach for confined rules. In: PKDD'04: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases, Springer-Verlag New York, Inc., New York, NY, USA. pp. 27-38.

Digital Library

[2]

Bailey, James, Manoukian, Thomas and Ramamohanarao, Kotagiri, Fast algorithms for mining emerging patterns. In: PKDD'02, Springer-Verlag. pp. 39-50.

Digital Library

[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.

Digital Library

[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, Guozhu and Li, Jinyan, Mining border descriptions of emerging patterns from dataset pairs. Knowl. Inform. Syst. v8 i2. 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, Hongjian and Ramamohanarao, Kotagiri, An efficient single-scan algorithm for mining essential jumping emerging patterns for classification. In: PAKDD'02: Proceedings of the 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, Springer-Verlag, London, UK. pp. 456-462.

Digital Library

[9]

Fan, Hongjian and Ramamohanarao, Kotagiri, Fast discovery and the generalization of strong jumping emerging patterns for building compact and accurate classifiers. IEEE Trans. Knowl. Data Eng. v18 i6. 721-737.

Digital Library

[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, Morgan Kaufman. pp. 1022-1029.

[11]

Fortes, I., Balcí¿zar, J.L. and Morales, R., Bounding negative information in frequent sets algorithms. In: Lecture Notes in Artificial Intelligence, vol. 2226. Springer. pp. 50-58.

Digital Library

[12]

Farhad Hussain, Huan Liu, Einoshin Suzuki, Hongjun Lu, Exception rule mining with a relative interestingness measure, in: PAKDD, 2000, pp. 86-97.

Digital Library

[13]

Kryszkiewicz, Marzena and Cichon, Katarzyna, Support oriented discovery of generalized disjunction-free representation of frequent patterns with negation. Lecture Notes in Computer Science. v3518. 672-682.

[14]

Li, Jinyan, Dong, Guozhu and Ramamohanarao, Kotagiri, Making use of the most expressive jumping emerging patterns for classification. Knowl. Inform. Syst. v3 i2. 1-29.

Digital Library

[15]

Li, Jiuyong and Jones, Jason, Using multiple and negative target rules to make classifiers more understandable. Knowl.-Based Syst. v19 i6. 438-444.

[16]

Padmanabhan, Balaji and Tuzhilin, Alexander, Small is beautiful: discovering the minimal set of unexpected patterns. In: KDD'00: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM Press, New York, NY, USA. pp. 54-63.

Digital Library

[17]

Pawlak, Zdzislaw, Rough sets. Int. J. Comput. Inform. Sci. v11. 341-356.

[18]

Pawlak, Zdzislaw, Rough Sets: Theoretical Aspects of Reasoning about Data. 1992. Kluwer Academic Publishers, Dordrecht.

Digital Library

[19]

Pawlak, Zdzislaw and Skowron, Andrzej, Rough sets: some extensions. Inform. Sci. v177 i1. 28-40.

[20]

Pawlak, Zdzislaw and Skowron, Andrzej, Rudiments of rough sets. Inform. Sci. v177 i1. 3-27.

[21]

Savasere, Ashoka, Omiecinski, Edward and Navathe, Shamkant B., Mining for strong negative associations in a large database of customer transactions. In: ICDE'98: Proceedings of the Fourteenth International Conference on Data Engineering, IEEE Computer Society, Washington, DC, USA. pp. 494-502.

Digital Library

[22]

Silverstein, Craig, Brin, Sergey and Motwani, Rajeev, Beyond market baskets: generalizing association rules to dependence rules. Data Min. Knowl. Discov. v2 i1. 39-68.

Digital Library

[23]

Skowron, Andrzej and Rauszer, Cecylia, The discernibility matrices and functions in information systems. In: Slowinski, R. (Ed.), Intelligent Decision Support, Kluwer Academic Publishers, Dordrecht, The Netherlands. pp. 331-362.

[24]

Terlecki, Pawel and Walczak, Krzysztof, Attribute set dependence in apriori-like reduct computation. In: Lecture Notes in Artificial Intelligence, vol. 4062. Springer-Verlag. pp. 268-276.

[25]

Terlecki, Pawel and Walczak, Krzysztof, Local reducts and jumping emerging patterns in relational databases. In: Lecture Notes in Artificial Intelligence, vol. 2903. Springer-Verlag. pp. 358-367.

Digital Library

[26]

Terlecki, Pawel and Walczak, Krzysztof, On the relation between rough set reducts and jumping emerging patterns. Inform. Sci. v177 i1. 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.

Digital Library

[28]

Wu, Xindong, Zhang, Chengqi and Zhang, Shichao, Efficient mining of both positive and negative association rules. ACM Trans. Inform. Syst. v22 i3. 381-405.

Digital Library

[29]

Yuan, Xiaohui, Buckles, Bill P., Yuan, Zhaoshan and Zhang, Jian, Mining negative association rules. In: ISCC'02: Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02), IEEE Computer Society, Washington, DC, USA. pp. 623

Digital Library

[30]

Ramamohanarao, Kotagiri, Wang, Zhou and Fan, Hongjian, . In: Lecture Notes in Computer Science, vol. 3339. Springer-Verlag. pp. 1062-1068.

Cited By

Loyola-González OMedina-Pérez MChoo K(2020)A Review of Supervised Classification based on Contrast Patterns: Applications, Trends, and ChallengesJournal of Grid Computing10.1007/s10723-020-09526-y18:4(797-845)Online publication date: 4-Oct-2020
https://dl.acm.org/doi/10.1007/s10723-020-09526-y
Weng CHuang T(2018)Observation of sales trends by mining emerging patterns in dynamic marketsApplied Intelligence10.1007/s10489-018-1231-148:11(4515-4529)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.1007/s10489-018-1231-1
He ZGu FZhao CLiu XWu JWang J(2017)Conditional discriminative pattern miningInformation Sciences: an International Journal10.1016/j.ins.2016.09.047375:C(1-15)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1016/j.ins.2016.09.047
Show More Cited By

Index Terms

Jumping emerging patterns with negation in transaction databases - Classification and discovery
1. Computing methodologies
  1. Machine learning
    1. Learning paradigms
      1. Supervised learning
        Supervised learning by classification
    2. Machine learning approaches
      1. Classification and regression trees
2. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis
      1. Pattern matching

Recommendations

Local projection in jumping emerging patterns discovery in transaction databases
PAKDD'08: Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining

This paper considers a rough set approach for the problem of finding minimal jumping emerging patterns (JEPs) in classified transactional datasets. The discovery is transformed into a series of transactionwise local reduct computations. In order to ...
Adaptive classification with jumping emerging patterns
RSKT'08: Proceedings of the 3rd international conference on Rough sets and knowledge technology

In this paper a generic adaptive classification scheme based on a classifier with reject option is proposed. A testing set is considered iteratively, accepted, semi-labeled cases are used to modify the underlying hypothesis and improve its accuracy for ...
Jumping Emerging Pattern Induction by Means of Graph Coloring and Local Reducts in Transaction Databases
RSFDGrC '07: Proceedings of the 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing

This paper demonstrates how to employ rough set framework in order to induce JEPs in transactional data. The algorithm employs local reducts in order to generate desired JEPs and additional EPs. The number of the latter is decreased by preceding reduct ...

Comments

Information & Contributors

Information

Published In

cover image Information Sciences: an International Journal

Information Sciences: an International Journal Volume 177, Issue 24

December, 2007

305 pages

ISSN:0020-0255

Issue’s Table of Contents

Copyright © Elsevier Inc. © 2007.

Publisher

Elsevier Science Inc.

United States

Publication History

Published: 20 December 2007

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Loyola-González OMedina-Pérez MChoo K(2020)A Review of Supervised Classification based on Contrast Patterns: Applications, Trends, and ChallengesJournal of Grid Computing10.1007/s10723-020-09526-y18:4(797-845)Online publication date: 4-Oct-2020
https://dl.acm.org/doi/10.1007/s10723-020-09526-y
Weng CHuang T(2018)Observation of sales trends by mining emerging patterns in dynamic marketsApplied Intelligence10.1007/s10489-018-1231-148:11(4515-4529)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.1007/s10489-018-1231-1
He ZGu FZhao CLiu XWu JWang J(2017)Conditional discriminative pattern miningInformation Sciences: an International Journal10.1016/j.ins.2016.09.047375:C(1-15)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1016/j.ins.2016.09.047
Nofong V(2016)EDTrendProceedings of the Australasian Computer Science Week Multiconference10.1145/2843043.2843051(1-8)Online publication date: 1-Feb-2016
https://dl.acm.org/doi/10.1145/2843043.2843051
Terlecki P(2010)On the relation between jumping emerging patterns and rough set theory with application to data classificationTransactions on rough sets XII10.5555/1880429.1880442(236-338)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.5555/1880429.1880442
Terlecki PWalczak K(2008)Local projection in jumping emerging patterns discovery in transaction databasesProceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining10.5555/1786574.1786647(723-730)Online publication date: 20-May-2008
https://dl.acm.org/doi/10.5555/1786574.1786647

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents