Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Finding Top-N Chance Patterns with KeyGraph\(^{\tiny \textregistered}\)-Based Importance

  • Conference paper
Knowlege-Based and Intelligent Information and Engineering Systems (KES 2011)

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

Abstract

In this paper, as our first proposal, we discuss a method for finding a rare pattern, called a chance pattern, which connects a pair of more frequent patterns. Particularly, our chance pattern is defined with a KeyGraph \(^{\tiny \textregistered}\)-based importance of patterns. More concretely speaking, a chance pattern is a pattern C which often appears in a part of documents containing a frequent pattern X L as well as in those containing another pattern X R , that is, confidence values of association rules, X L ⇒C and X R ⇒C, are relatively high. It would be expected that such a chance pattern C reveals a hidden and implicit relationships between X L and X R . We design clique-search-based algorithms for finding chance patterns with Top-N confidence values.

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. Ganter, B., Wille, R.: Formal Concept Analysis - Mathematical Foundations, 284 pages. Springer, Heidelberg (1999)

    Book  MATH  Google Scholar 

  2. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. of the 20th Int’l Conf. on Very Large Databases - VLDB 1994, pp. 487–499 (1994)

    Google Scholar 

  3. Maeno, Y., Ohsawa, Y.: Human-Computer Interactive Annealing for Discovering Invisible Dark Events. IEEE Transactions on Industrial Electronics 54(2), 1184–1192 (2007)

    Article  Google Scholar 

  4. Ohsawa, Y.: Discovery of Chances Underlying Real Data. In: Arikawa, S., Shinohara, A. (eds.) Progress in Discovery Science. LNCS (LNAI), vol. 2281, pp. 168–177. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Ohsawa, Y., Benson, N.E., Yachida, M.: KeyGraph: Automatic Indexing by Segmenting and Unifing Co-occurence Graphs. The IEICE Transactions on Information and Systems (Japanese Edition) J82-D-I(2), 391–400 (1999) (in Japanese)

    Google Scholar 

  6. Ohsawa, Y., Yachida, M.: Discover Risky Active Faults by Indexing an Earthquake Sequence. In: Arikawa, S., Nakata, I. (eds.) DS 1999. LNCS (LNAI), vol. 1721, pp. 208–219. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  7. Omiecinski, E.R.: Alternative Interest Measures for Mining Associations in Databases. IEEE Transactions on Knowledge and Data Engineering 15(1), 57–69 (2003)

    Article  MathSciNet  Google Scholar 

  8. Tomita, E., Akutsu, T., Matsunaga, T.: Efficient Algorithms for Finding Maximum and Maximal Cliques: Effective Tools for Bioinformatics. In: Laskovski, A.N. (ed.) Biomedical Engineering, Trends in Electronics, Communications and Software, pp. 625–640. InTech, Vienna (2011)

    Google Scholar 

  9. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient Mining of Association Rules Using Closed Itemset Lattices. Information Systems 24(1), 25–46 (1999)

    Article  MATH  Google Scholar 

  10. Szathmary, L., Napoli, A., Valtchev, P.: Towards Rare Itemset Mining. In: Proc. of the 19th IEEE Int’l Conf. on Tools with Artificial Intelligence - ICTAI 2007, pp. 305–312 (2007)

    Google Scholar 

  11. Okubo, Y., Haraguchi, M.: An Algorithm for Finding Indicative Concepts Connecting Larger Concepts Based on Structural Constraints. In: The 9th Int’l Conf. on Formal Concept Analysis - ICFCA 2011, Contributions to ICFCA 2011, pp. 53–68 (2011)

    Google Scholar 

  12. Okubo, Y., Haraguchi, M.: An Algorithm for Extracting Rare Concepts with Concise Intents. In: Kwuida, L., Sertkaya, B. (eds.) ICFCA 2010. LNCS (LNAI), vol. 5986, pp. 145–160. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  13. Okubo, Y., Haraguchi, M., Nakajima, T.: Finding Rare Patterns with Weak Correlation Constraint. In: Proc. of the 2010 IEEE Int’l Conf. on Data Mining Workshops - ICDMW 2010, pp. 822–829 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Science and Technology, Hokkaido University, N-14 W-9, Sapporo, 060-0814, Japan

    Yoshiaki Okubo & Makoto Haraguchi

  2. Research Institute for Information Technology, Kyushu University, Fukuoka, 812-8581, Japan

    Sachio Hirokawa

Authors
  1. Yoshiaki Okubo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Makoto Haraguchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sachio Hirokawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Integrated Sensor Systems, University of Kaiserslautern, Erwin-Schroedinger-str. 12, 67663, Kaiserslautern, Germany

    Andreas König

  2. Knowledge-Based Systems Group, Department of Computer Science, University of Kaiserslautern, P.O. Box 3049, 67653, Kaiserslautern, Germany

    Andreas Dengel

  3. School of Business, University of Applied Sciences Northwestern Switzerland, Riggenbachstr. 16, 4600, Olten, Switzerland

    Knut Hinkelmann

  4. Graduate School of Engineering, Osaka Prefecture University, 1-1 Gakuen-cho, 599-8531, Sakai,, Osaka, Japan

    Koichi Kise

  5. KES International, P.O. Box 2115, BN43 9AF, Shoreham-by-sea, UK

    Robert J. Howlett

  6. University of South Australia, Adelaide, 5095, Mawson Lakes, SA, Australia

    Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Okubo, Y., Haraguchi, M., Hirokawa, S. (2011). Finding Top-N Chance Patterns with KeyGraph\(^{\tiny \textregistered}\)-Based Importance. In: König, A., Dengel, A., Hinkelmann, K., Kise, K., Howlett, R.J., Jain, L.C. (eds) Knowlege-Based and Intelligent Information and Engineering Systems. KES 2011. Lecture Notes in Computer Science(), vol 6882. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23863-5_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23863-5_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23862-8

  • Online ISBN: 978-3-642-23863-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation