Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Rough Sets, Fuzzy Sets, Data Mining, and Granular-Soft Computing

RSFDGrC 2007: Rough Sets, Fuzzy Sets, Data Mining and Granular Computing pp 363–370Cite as

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

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4482))

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.

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.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB ’94, pp. 487–499 (1994)

    Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  4. Bazan, J., et al.: Rough set algorithms in classification problem. In: Rough set methods and applications: new developments in knowl. disc. in inf. syst., pp. 49–88 (2000)

    Google Scholar 

  5. Slezak, D.: Association reducts: A framework for mining multi-attribute dependencies. In: Hacid, M.-S., et al. (eds.) ISMIS 2005. LNCS (LNAI), vol. 3488, pp. 354–363. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Terlecki, P., Walczak, K.: Local reducts and jumping emerging patterns in relational databases. In: Greco, S., et al. (eds.) RSCTC 2006. LNCS (LNAI), vol. 4259, pp. 268–276. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Wróblewski, J.: Covering with Reducts - A Fast Algorithm for Rule Generation. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol. 1424, pp. 402–407. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  8. Cormen, T.H., et al.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  9. Terlecki, P., Walczak, K.: Attribute set dependence in apriori-like reduct computation. In: Wang, G.-Y., et al. (eds.) RSKT 2006. LNCS (LNAI), vol. 4062, pp. 268–276. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  10. Newman, D.J., et al.: UCI repository of machine learning databases (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warsaw, Poland

    Pawel Terlecki & Krzysztof Walczak

Authors
  1. Pawel Terlecki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Krzysztof Walczak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science and Engineering, York University, M3J 1P3, Toronto, Ontario, Canada

    Aijun An

  2. Institute of Computing Sciences, Poznań University of Technology, ul. Piotrowo 2, 60–965, Poznań, Poland

    Jerzy Stefanowski

  3. Department of Applied Computer Science, University of Winnipeg, R3B 2E9, Winnipeg, Manitoba, Canada

    Sheela Ramanna

  4. Department of Computer Science, University of Regina, S4S 0A2, Regina, Saskatchewan, Canada

    Cory J. Butz

  5. Department of Electrical and Computer Engineering, University of Alberta, T6G 2V4, Edmonton, Alberta, Canada

    Witold Pedrycz

  6. Institute of Compuer Science and Technology, Chongqing University of Posts and Telecommunications, 40065, Chongqing, P.R. China

    Guoyin Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Terlecki, P., Walczak, K. (2007). Jumping Emerging Pattern Induction by Means of Graph Coloring and Local Reducts in Transaction Databases. In: An, A., Stefanowski, J., Ramanna, S., Butz, C.J., Pedrycz, W., Wang, G. (eds) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. RSFDGrC 2007. Lecture Notes in Computer Science(), vol 4482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72530-5_43

Download citation

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

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72529-9

  • Online ISBN: 978-3-540-72530-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation