Finding top-N chance patterns with KeyGraph®-based importance

Yoshiaki Okubo; Makoto Haraguchi; Sachio Hirokawa

doi:10.1007/978-3-642-23863-5_47

Finding top-N chance patterns with KeyGraph®-based importance

Yoshiaki Okubo, Makoto Haraguchi, Sachio Hirokawa

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

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®-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.

Original language	English
Title of host publication	Knowledge-Based and Intelligent Information and Engineering Systems - 15th International Conference, KES 2011, Proceedings
Pages	457-468
Number of pages	12
Edition	PART 2
DOIs	https://doi.org/10.1007/978-3-642-23863-5_47
Publication status	Published - 2011
Event	15th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, KES 2011 - Kaiserslautern, Germany Duration: Sept 12 2011 → Sept 14 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 2
Volume	6882 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	15th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, KES 2011
Country/Territory	Germany
City	Kaiserslautern
Period	9/12/11 → 9/14/11

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-23863-5_47

Cite this

Okubo, Y., Haraguchi, M., & Hirokawa, S. (2011). Finding top-N chance patterns with KeyGraph®-based importance. In Knowledge-Based and Intelligent Information and Engineering Systems - 15th International Conference, KES 2011, Proceedings (PART 2 ed., pp. 457-468). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6882 LNAI, No. PART 2). https://doi.org/10.1007/978-3-642-23863-5_47

Finding top-N chance patterns with KeyGraph®-based importance. / Okubo, Yoshiaki; Haraguchi, Makoto; Hirokawa, Sachio.
Knowledge-Based and Intelligent Information and Engineering Systems - 15th International Conference, KES 2011, Proceedings. PART 2. ed. 2011. p. 457-468 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6882 LNAI, No. PART 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Okubo, Y, Haraguchi, M & Hirokawa, S 2011, Finding top-N chance patterns with KeyGraph®-based importance. in Knowledge-Based and Intelligent Information and Engineering Systems - 15th International Conference, KES 2011, Proceedings. PART 2 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 6882 LNAI, pp. 457-468, 15th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, KES 2011, Kaiserslautern, Germany, 9/12/11. https://doi.org/10.1007/978-3-642-23863-5_47

Okubo Y, Haraguchi M, Hirokawa S. Finding top-N chance patterns with KeyGraph®-based importance. In Knowledge-Based and Intelligent Information and Engineering Systems - 15th International Conference, KES 2011, Proceedings. PART 2 ed. 2011. p. 457-468. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2). doi: 10.1007/978-3-642-23863-5_47

Okubo, Yoshiaki ; Haraguchi, Makoto ; Hirokawa, Sachio. / Finding top-N chance patterns with KeyGraph®-based importance. Knowledge-Based and Intelligent Information and Engineering Systems - 15th International Conference, KES 2011, Proceedings. PART 2. ed. 2011. pp. 457-468 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).

@inproceedings{a552c175246c4f4e8372ad96d3010f65,

title = "Finding top-N chance patterns with KeyGraph{\textregistered}-based importance",

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{\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 XL as well as in those containing another pattern XR, that is, confidence values of association rules, XL ⇒ 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 XR. We design clique-search-based algorithms for finding chance patterns with Top-N confidence values.",

author = "Yoshiaki Okubo and Makoto Haraguchi and Sachio Hirokawa",

year = "2011",

doi = "10.1007/978-3-642-23863-5_47",

language = "English",

isbn = "9783642238628",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

number = "PART 2",

pages = "457--468",

booktitle = "Knowledge-Based and Intelligent Information and Engineering Systems - 15th International Conference, KES 2011, Proceedings",

edition = "PART 2",

note = "15th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, KES 2011 ; Conference date: 12-09-2011 Through 14-09-2011",

}

TY - GEN

T1 - Finding top-N chance patterns with KeyGraph®-based importance

AU - Okubo, Yoshiaki

AU - Haraguchi, Makoto

AU - Hirokawa, Sachio

PY - 2011

Y1 - 2011

N2 - 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®-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 XL as well as in those containing another pattern XR, that is, confidence values of association rules, XL ⇒ 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 XR. We design clique-search-based algorithms for finding chance patterns with Top-N confidence values.

AB - 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®-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 XL as well as in those containing another pattern XR, that is, confidence values of association rules, XL ⇒ 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 XR. We design clique-search-based algorithms for finding chance patterns with Top-N confidence values.

UR - http://www.scopus.com/inward/record.url?scp=80053145038&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80053145038&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-23863-5_47

DO - 10.1007/978-3-642-23863-5_47

M3 - Conference contribution

AN - SCOPUS:80053145038

SN - 9783642238628

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 457

EP - 468

BT - Knowledge-Based and Intelligent Information and Engineering Systems - 15th International Conference, KES 2011, Proceedings

T2 - 15th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, KES 2011

Y2 - 12 September 2011 through 14 September 2011

ER -

Finding top-N chance patterns with KeyGraph®-based importance

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this