Skip to main content
SpringerLink
Log in

Efficient Discovery of Top-K Minimal Jumping Emerging Patterns

  • Conference paper
Rough Sets and Current Trends in Computing (RSCTC 2008)

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

Included in the following conference series:

Abstract

Jumping emerging patterns, like other discriminative patterns, help to understand differences between decision classes and build accurate classifiers. Since their discovery is usually time-consuming and pruning with minimum support may require several adjustments, we consider the problem of finding top-k minimal jumping emerging patterns. We describe the approach based on a CP-Tree that gradually raises minimum support during mining. Also, a general strategy for pruning non-minimal patterns and their descendants is proposed. We employ the concept of attribute set dependence to test pattern minimality. A two and multiple class version of the problem is discussed. Experiments evaluate pruning capabilities and execution time.

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

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dong, G., Li, J.: Efficient mining of emerging patterns: discovering trends and differences. In: KDD, pp. 43–52. ACM Press, New York (1999)

    Google Scholar 

  2. Fan, H., Ramamohanarao, K.: Fast discovery and the generalization of strong jumping emerging patterns for building compact and accurate classifiers. IEEE Trans. on Knowl. and Data Eng. 18(6), 721–737 (2006)

    Article  Google Scholar 

  3. Li, J., Liu, G., Wong, L.: Mining statistically important equivalence classes and delta-discriminative emerging patterns. In: KDD, pp. 430–439 (2007)

    Google Scholar 

  4. Li, J., Dong, G., Ramamohanarao, K.: Making use of the most expressive jumping emerging patterns for classification. Knowl. Inf. Syst. 3(2), 1–29 (2001)

    MATH  Google Scholar 

  5. Terlecki, P., Walczak, K.: On the relation between rough set reducts and jumping emerging patterns. Information Sciences 177(1), 74–83 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Terlecki, P., Walczak, K.: Local projection in jumping emerging patterns discovery in transaction databases. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 723–730. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  7. Terlecki, P., Walczak, K.: Attribute set dependence in apriori-like reduct computation. In: Wang, G.-Y., Peters, J.F., Skowron, A., Yao, Y. (eds.) RSKT 2006. LNCS (LNAI), vol. 4062, pp. 268–276. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Shen, L., Shen, H., Pritchard, P., Topor, R.: Finding the n largest itemsets. In: ICDM (1998)

    Google Scholar 

  9. Fu, A.W.-C., Kwong, R.W.-w., Tang, J.: Mining n-most interesting itemsets. In: Ohsuga, S., Raś, Z.W. (eds.) ISMIS 2000. LNCS (LNAI), vol. 1932, pp. 59–67. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  10. Wang, J., Lu, Y., Tzvetkov, P.: Tfp: An efficient algorithm for mining top-k frequent closed itemsets. IEEE Trans. on Knowl. and Data Eng. 17(5), 652–664 (2005); Senior Member-Jiawei Han

    Article  Google Scholar 

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

    Article  Google Scholar 

  12. Fan, H., Ramamohanarao, K.: An efficient single-scan algorithm for mining essential jumping emerging patterns for classification. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol. 2336, pp. 456–462. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. Tzvetkov, P., Yan, X., Han, J.: Tsp: Mining top-k closed sequential patterns. Knowl. Inf. Syst. 7(4), 438–457 (2005)

    Article  Google Scholar 

  14. Savasere, A., Omiecinski, E., Navathe, S.B.: An efficient algorithm for mining association rules in large databases. In: VLDB, pp. 432–444 (1995)

    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. Department of Computer Science, The University of Akron, OH 44325-4003, Akron, USA

    Chien-Chung Chan

  2. Department of Electrical Engineering and Computer Science, University of Kansas, KS 66045, Lawrence, USA

    Jerzy W. Grzymala-Busse

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

    Wojciech P. Ziarko

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Terlecki, P., Walczak, K. (2008). Efficient Discovery of Top-K Minimal Jumping Emerging Patterns. In: Chan, CC., Grzymala-Busse, J.W., Ziarko, W.P. (eds) Rough Sets and Current Trends in Computing. RSCTC 2008. Lecture Notes in Computer Science(), vol 5306. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88425-5_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88425-5_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88423-1

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation