Article

Local reducts and jumping emerging patterns in relational databases

Authors:

Pawel Terlecki,

Krzysztof WalczakAuthors Info & Claims

RSCTC'06: Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing

Pages 358 - 367

https://doi.org/10.1007/11908029_38

Published: 06 November 2006 Publication History

Publisher Site

Abstract

This paper refers to the notion of minimal pattern in relational databases. We study the analogy between two concepts: a local reduct, from the rough set theory, and a jumping emerging pattern, originally defined for transactional data. Their equivalence within a positive region and similarities between eager and lazy classification methods based on both ideas are demonstrated. Since pattern discovery approaches vary significantly, efficiency tests have been performed in order to decide, which solution provides a better tool for the analysis of real relational datasets.

References

[1]

H. Fan, Efficient Mining of Interesting Emerging Patterns and Their Effective Use in Classification. University of Melbourne: PhD thesis, 2004.

Google Scholar

[2]

G. Dong and J. Li, "Mining border descriptions of emerging patterns from dataset pairs," Knowl. Inf. Syst., vol. 8, no. 2, pp. 178-202, 2005.

Digital Library

Google Scholar

[3]

J. Wroblewski, The Adaptive Methods for Object Classification. Warsaw University, Institute of Informatics: PhD thesis, 2002.

Google Scholar

[4]

P. Terlecki and K. Walczak, "On the relation between rough set reducts and jumping emerging patterns," Information Sciences, 2006 (to be published).

Google Scholar

[5]

A. Skowron and C. Rauszer, "The discernibility matrices and functions in information systems," in Intelligent Decision Support (R. Slowinski, ed.), (Dordrecht, The Netherlands), pp. 331-362, Kluwer Academic Publishers, 1992.

Google Scholar

[6]

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

Digital Library

Google Scholar

[7]

J. Li, G. Dong, K. Ramamohanarao, and L. Wong, "Deeps: A new instance-based lazy discovery and classification system," Mach. Learn., vol. 54, no. 2, pp. 99-124, 2004.

Digital Library

Google Scholar

[8]

N. Shan and W. Ziarko, "An incremental learning algorithm for constructing decision rules," in Rough Sets, Fuzzy Sets and Knowledge Discovery (W. Ziarko, ed.), pp. 326-334, Springer Verlag, Berlin, 1994.

Digital Library

Google Scholar

[9]

P. Terlecki and K. Walczak, "Attribute set dependence in apriori-like reduct computation," in Rough Sets and Knowl. Techn., 2006 (to be published).

Digital Library

Google Scholar

[10]

M. Jürgens and H.-J. Lenz, "Tree based indexes vs. bitmap indexes - a performance study.," Int. Journal of Cooperative Inf. Syst., vol. 10, no. 3, pp. 355-376, 2001.

Crossref

Google Scholar

[11]

C. B. D.J. Newman, S. Hettich and C. Merz, "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)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

Local reducts and jumping emerging patterns in relational databases
1. Computing methodologies

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 ...
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. ...
Federating Object-Oriented and Relational Databases: The IRO-DB Experience
COOPIS '97: Proceedings of the Second IFCIS International Conference on Cooperative Information Systems

From the beginning of 1994 to the end of 1996, the IRO-DB (Interoperable Relational and Object-Oriented Databases) ESPRIT project has developed tools for accessing relational and object-oriented databases in an integrated way, and for designing and ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

RSCTC'06: Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing

November 2006

951 pages

ISBN:3540476938

Editors:
Salvatore Greco
Faculty of Economics, University of Catania, Corso Italia, 55, Catania, Italy
,
Yutaka Hata
Graduate School of Engineering, Department of Electrical Engineering and Computer Sciences, University of Hyogo, 2167 Shosha, Himeji, Hyogo, Japan
,
Shoji Hirano
Department of Medical Informatics, Faculty of Medicine, Shimane University, 89-1 Enya-cho, Izumo, Shimane, Hyogo, Japan
,
Masahiro Inuiguchi
Department of Systems Innovation, Graduate School of Engineering Science, Osaka University, 1-3, Machikaneyama, Toyonaka, Osaka, Hyogo, Japan
,
Sadaaki Miyamoto
Department of Risk Engineering, School of Systems and Information Engineering, University of Tsukuba, 1-3, Machikaneyama, Toyonaka, Ibaraki, Hyogo, Japan

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 06 November 2006

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
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)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

Local projection in jumping emerging patterns discovery in transaction databases

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

Federating Object-Oriented and Relational Databases: The IRO-DB Experience

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations