Skip to main content

Local Table Condensation in Rough Set Approach for Jumping Emerging Pattern Induction

  • Conference paper
ICCS 2007

Abstract

This paper extends the rough set approach for JEP induction based on the notion of a condensed decision table. The original transaction database is transformed to a relational form and patterns are induced by means of local reducts. The transformation employs an item aggregation obtained by coloring a graph that re0ects con0icts among items. For e±ciency reasons we propose to perform this preprocessing locally, i.e. at the transaction level, to achieve a higher dimensionality gain. Special maintenance strategy is also used to avoid graph rebuilds. Both global and local approach have been tested and discussed for dense and synthetically generated sparse datasets.

The research has been partially supported by grant No 3 T11C 002 29 received from Polish Ministry of Education and Science.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • 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

    Article  Google Scholar 

  • J. Li and L. Wong, “Emerging patterns and gene expression data,” in Proc. of 12th Workshop on Genome Informatics, pp. 3 13, 2001

    Google Scholar 

  • 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 de-velopments in knowl. disc. in inf. syst., pp. 49 88, 2000

    Google Scholar 

  • P. Terlecki and K. Walczak, “Local reducts and jumping emerging patterns in relational databases,” vol. 4259 of LNCS, pp. 268 276.

    Google Scholar 

  • P. Terlecki and K. Walczak, “Jumping emerging pattern induction by means of graph coloring and local reducts in transaction databases,” in JRS’07, 2007.

    Google Scholar 

  • C. B. D. J. Newman, S. Hettich and C. Merz, “UCI repository of machine learnign databases,” 1998.

    Google Scholar 

  • R. Agrawal and R. Srikant, Fast algorithms for mining association rules in large databases,” in VLDB’ 94, pp. 487 499, 1994

    Google Scholar 

  • G. Karypsis, CLUTO. A Clustering Toolkit. Release 2.0. Univ. of Minnesota, 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag London Limited

About this paper

Cite this paper

Terlecki, P., Walczak, K. (2007). Local Table Condensation in Rough Set Approach for Jumping Emerging Pattern Induction. In: Akhgar, B. (eds) ICCS 2007. Springer, London. https://doi.org/10.1007/978-1-84628-992-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-1-84628-992-7_14

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84628-990-3

  • Online ISBN: 978-1-84628-992-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics