Article

Jumping Emerging Pattern Induction by Means of Graph Coloring and Local Reducts in Transaction Databases

Authors:

RSFDGrC '07: Proceedings of the 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing

Pages 363 - 370

https://doi.org/10.1007/978-3-540-72530-5_43

Published: 07 July 2009 Publication History

Abstract

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 computation with item aggregation. The preprocessing is reduced to graph coloring and solved with efficient classical heuristics. Our approach is contrasted with JEP-Producer, the recommended method for JEP induction. Moreover, a formal apparatus for classified transactional data has been proposed.

References

[1]

Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB '94. (1994) 487-499

Crossref

Google Scholar

[2]

Dong, G., Li, J.: Mining border descriptions of emerging patterns from dataset pairs. Knowl. Inf. Syst. 8 (2005) 178-202

Crossref

Google Scholar

[3]

Li, W., Han, J., Pei, J.: Cmar: Accurate and efficient classification based on multiple class-association rules. In: ICDM '01. (2001) 369-376

Crossref

Google Scholar

[4]

Bazan, J., Nguyen, H.S., Nguyen, S.H., Synak, P., Wroblewski, J.: Rough set algorithms in classification problem. Rough set methods and applications: new developments in knowl. disc. in inf. syst. (2000) 49-88

Crossref

Google Scholar

[5]

Slezak, D.: Association reducts: A framework for mining multi-attribute dependencies. (Volume 3488 of LNCS.) 354-363

Crossref

Google Scholar

[6]

Terlecki, P., Walczak, K.: Local reducts and jumping emerging patterns in relational databases. (Volume 4259 of LNCS.) 268-276

Crossref

Google Scholar

[7]

Wroblewski, J.: Covering with reducts - a fast algorithm for rule generation. In: Rough Sets and Current Trends in Computing. (1998) 402-407

Crossref

Google Scholar

[8]

Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. 2nd edn. The MIT Press, Cambridge, MA, USA (2001)

Crossref

Google Scholar

[9]

Terlecki, P., Walczak, K.: Attribute set dependence in apriori-like reduct computation. In: LNCS. (Volume 4062.) 268-276

Crossref

Google Scholar

[10]

D.J. Newman, S. Hettich, C.B., Merz, C.: UCI repository of machine learning databases (1998)

Google Scholar

Cited By

View all

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)Adaptive classification with jumping emerging patternsProceedings of the 3rd international conference on Rough sets and knowledge technology10.5555/1788028.1788042(39-46)Online publication date: 17-May-2008
https://dl.acm.org/doi/10.5555/1788028.1788042
Kobyliński ŁWalczak K(2008)Jumping emerging patterns with occurrence count in image classificationProceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining10.5555/1786574.1786670(904-909)Online publication date: 20-May-2008
https://dl.acm.org/doi/10.5555/1786574.1786670
Show More Cited By

Recommendations

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

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. ...
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 ...
List-coloring the square of a subcubic graph

The square G² of a graph G is the graph with the same vertex set G and with two vertices adjacent if their distance in G is at most 2. Thomassen showed that every planar graph G with maximum degree Δ(G) = 3 satisfies χ(G²) ≤ 7. Kostochka and Woodall ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

RSFDGrC '07: Proceedings of the 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing

July 2009

582 pages

ISBN:9783540725299

Editors:
Aijun An
Dept. of Computer Science and Engineering, York University, Toronto, Canada M3J 1P3
,
Jerzy Stefanowski
Institute of Computing Sciences, Poznań University of Technology, Poznań, Poland 60---965
,
Sheela Ramanna
Department of Applied Computer Science, University of Winnipeg, Winnipeg, Canada R3B 2E9
,
Cory J. Butz
Department of Computer Science, University of Regina, Regina, Canada S4S 0A2
,
Witold Pedrycz
Department of Electrical and Computer Engineering, University of Alberta, Edmonton, Canada T6G 2V4
,
Guoyin Wang
Institute of Compuer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing, P.R. China 40065

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 07 July 2009

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 15 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

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)Adaptive classification with jumping emerging patternsProceedings of the 3rd international conference on Rough sets and knowledge technology10.5555/1788028.1788042(39-46)Online publication date: 17-May-2008
https://dl.acm.org/doi/10.5555/1788028.1788042
Kobyliński ŁWalczak K(2008)Jumping emerging patterns with occurrence count in image classificationProceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining10.5555/1786574.1786670(904-909)Online publication date: 20-May-2008
https://dl.acm.org/doi/10.5555/1786574.1786670
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

Abstract

References

Cited By

Recommendations

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

Local projection in jumping emerging patterns discovery in transaction databases

List-coloring the square of a subcubic graph

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations