Skip to main content

Minimal Jumping Emerging Patterns: Computation and Practical Assessment

  • Conference paper
  • First Online:
Advances in Knowledge Discovery and Data Mining (PAKDD 2015)

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

Included in the following conference series:

Abstract

Jumping Emerging Patterns (JEP) are patterns that only occur in objects of a single class, a minimal JEP is a JEP where none of its proper subsets is a JEP. In this paper, an efficient method to mine the whole set of the minimal JEPs is detailed and fully proven. Moreover, our method has a larger scope since it is able to compute the essential JEPs and the top-k minimal JEPs. We also extract minimal JEPs where the absence of attributes is stated, and we show that this leads to the discovery of new valuable pieces of information. A performance study is reported to evaluate our approach and the practical efficiency of minimal JEPs in the design of rules to express correlations is shown.

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 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. Chen, X., Chen, J.: Emerging patterns and classification algorithms for dna sequence. JSW 6(6), 985–992 (2011)

    Google Scholar 

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

    Google Scholar 

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

    Article  Google Scholar 

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

    Chapter  Google Scholar 

  5. Ganter, B., Kuznetsov, S.O.: Hypotheses and version spaces. In: Ganter, B., de Moor, A., Lex, W. (eds.) ICCS 2003. LNCS (LNAI), vol. 2746, pp. 83–95. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  6. Kerber, R.: Chimerge: discretization of numeric attributes. In: Swartout, W.R. (ed.) AAAI, pp. 123–128. AAAI Press / The MIT Press (1992)

    Google Scholar 

  7. Kobyliński, Ł., Walczak, K.: Spatial emerging patterns for scene classification. In: Rutkowski, L., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2010, Part I. LNCS (LNAI), vol. 6113, pp. 515–522. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  8. Kobylinski, L., Walczak, K.: Efficient mining of jumping emerging patterns with occurrence counts for classification. T. Rough Sets 13, 73–88 (2011)

    Google Scholar 

  9. Li, J., Dong, G., Ramamohanarao, K.: Making use of the most expressive jumping emerging patterns for classification. In: Terano, T., Liu, H., Chen, A.L.P. (eds.) PAKDD 2000. LNCS (LNAI), vol. 1805, pp. 220–232. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  10. Lichman, M.: UCI machine learning repository (2013). http://archive.ics.uci.edu/ml

  11. Liu, H., Setiono, R.: Feature selection via discretization. IEEE Trans. Knowl. Data Eng. 9(4), 642–645 (1997)

    Article  Google Scholar 

  12. Lozano, S., Poezevara, G., Halm-Lemeille, M.P., Lescot-Fontaine, E., Lepailleur, A., Bissell-Siders, R., Cremilleux, B., Rault, S., Cuissart, B., Bureau, R.: Introduction of Jumping Fragments in Combination with QSARs for the Assessment of Classification in Ecotoxicology. J. Chem. Inf. Model. 50(8), 1330–1339 (2010)

    Article  Google Scholar 

  13. Mitchell, T.M.: Generalization as search. Artif. Intell. 18(2), 203–226 (1982)

    Article  Google Scholar 

  14. Novak, P.K., Lavrac, N., Webb, G.I.: Supervised descriptive rule discovery: A unifying survey of contrast set, emerging pattern and subgroup mining. Journal of Machine Learning Research 10, 377–403 (2009)

    MATH  Google Scholar 

  15. Terlecki, P., Walczak, K.: Jumping emerging patterns with negation in transaction databases classification and discovery. Inf. Sci. 177(24), 5675–5690 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  16. Terlecki, P., Walczak, K.: Efficient discovery of top-K minimal jumping emerging patterns. In: Chan, C.-C., Grzymala-Busse, J.W., Ziarko, W.P. (eds.) RSCTC 2008. LNCS (LNAI), vol. 5306, pp. 438–447. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  17. Wrobel, S.: An algorithm for multi-relational discovery of subgroups. In: Komorowski, J., Żytkow, J.M. (eds.) PKDD 1997. LNCS, vol. 1263, pp. 78–87. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bertrand Cuissart .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Kane, B., Cuissart, B., Crémilleux, B. (2015). Minimal Jumping Emerging Patterns: Computation and Practical Assessment. In: Cao, T., Lim, EP., Zhou, ZH., Ho, TB., Cheung, D., Motoda, H. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2015. Lecture Notes in Computer Science(), vol 9077. Springer, Cham. https://doi.org/10.1007/978-3-319-18038-0_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18038-0_56

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18037-3

  • Online ISBN: 978-3-319-18038-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics