Mining interesting patterns in multi-relational data with N-ary relationships

Eirini Spyropoulou; Tijl De Bie; Mario Boley

doi:10.1007/978-3-642-40897-7_15

Mining interesting patterns in multi-relational data with N-ary relationships

Eirini Spyropoulou, Tijl De Bie, Mario Boley

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

Abstract

We present a novel method for mining local patterns from multi-relational data in which relationships can be of any arity. More specifically, we define a new pattern syntax for such data, develop an efficient algorithm for mining it, and define a suitable interestingness measure that is able to take into account prior information of the data miner. Our approach is a strict generalisation of prior work on multi-relational data in which relationships were restricted to be binary, as well as of prior work on local pattern mining from a single n-ary relationship. Remarkably, despite being more general our algorithm is comparably fast or faster than the state-of-the-art in these less general problem settings.

Original language	English
Title of host publication	Discovery Science - 16th International Conference, DS 2013, Proceedings
Publisher	Springer Verlag
Pages	217-232
Number of pages	16
ISBN (Print)	9783642408960
DOIs	https://doi.org/10.1007/978-3-642-40897-7_15
State	Published - 2013
Externally published	Yes
Event	16th International Conference on Discovery Science, DS 2013 - Singapore, Singapore Duration: 6 Oct 2013 → 9 Oct 2013

Publication series

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

Conference

Conference	16th International Conference on Discovery Science, DS 2013
Country/Territory	Singapore
City	Singapore
Period	6/10/13 → 9/10/13

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-40897-7_15

Cite this

Spyropoulou, E., De Bie, T., & Boley, M. (2013). Mining interesting patterns in multi-relational data with N-ary relationships. In Discovery Science - 16th International Conference, DS 2013, Proceedings (pp. 217-232). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8140 LNAI). Springer Verlag. https://doi.org/10.1007/978-3-642-40897-7_15

Spyropoulou, Eirini ; De Bie, Tijl ; Boley, Mario. / Mining interesting patterns in multi-relational data with N-ary relationships. Discovery Science - 16th International Conference, DS 2013, Proceedings. Springer Verlag, 2013. pp. 217-232 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{9d9f289035174e9fa281d28117f101f7,

title = "Mining interesting patterns in multi-relational data with N-ary relationships",

abstract = "We present a novel method for mining local patterns from multi-relational data in which relationships can be of any arity. More specifically, we define a new pattern syntax for such data, develop an efficient algorithm for mining it, and define a suitable interestingness measure that is able to take into account prior information of the data miner. Our approach is a strict generalisation of prior work on multi-relational data in which relationships were restricted to be binary, as well as of prior work on local pattern mining from a single n-ary relationship. Remarkably, despite being more general our algorithm is comparably fast or faster than the state-of-the-art in these less general problem settings.",

author = "Eirini Spyropoulou and {De Bie}, Tijl and Mario Boley",

year = "2013",

doi = "10.1007/978-3-642-40897-7_15",

language = "English",

isbn = "9783642408960",

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

publisher = "Springer Verlag",

pages = "217--232",

booktitle = "Discovery Science - 16th International Conference, DS 2013, Proceedings",

address = "Germany",

note = "16th International Conference on Discovery Science, DS 2013 ; Conference date: 06-10-2013 Through 09-10-2013",

}

Spyropoulou, E, De Bie, T & Boley, M 2013, Mining interesting patterns in multi-relational data with N-ary relationships. in Discovery Science - 16th International Conference, DS 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8140 LNAI, Springer Verlag, pp. 217-232, 16th International Conference on Discovery Science, DS 2013, Singapore, Singapore, 6/10/13. https://doi.org/10.1007/978-3-642-40897-7_15

Mining interesting patterns in multi-relational data with N-ary relationships. / Spyropoulou, Eirini; De Bie, Tijl; Boley, Mario.
Discovery Science - 16th International Conference, DS 2013, Proceedings. Springer Verlag, 2013. p. 217-232 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8140 LNAI).

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

TY - GEN

T1 - Mining interesting patterns in multi-relational data with N-ary relationships

AU - Spyropoulou, Eirini

AU - De Bie, Tijl

AU - Boley, Mario

PY - 2013

Y1 - 2013

N2 - We present a novel method for mining local patterns from multi-relational data in which relationships can be of any arity. More specifically, we define a new pattern syntax for such data, develop an efficient algorithm for mining it, and define a suitable interestingness measure that is able to take into account prior information of the data miner. Our approach is a strict generalisation of prior work on multi-relational data in which relationships were restricted to be binary, as well as of prior work on local pattern mining from a single n-ary relationship. Remarkably, despite being more general our algorithm is comparably fast or faster than the state-of-the-art in these less general problem settings.

AB - We present a novel method for mining local patterns from multi-relational data in which relationships can be of any arity. More specifically, we define a new pattern syntax for such data, develop an efficient algorithm for mining it, and define a suitable interestingness measure that is able to take into account prior information of the data miner. Our approach is a strict generalisation of prior work on multi-relational data in which relationships were restricted to be binary, as well as of prior work on local pattern mining from a single n-ary relationship. Remarkably, despite being more general our algorithm is comparably fast or faster than the state-of-the-art in these less general problem settings.

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

U2 - 10.1007/978-3-642-40897-7_15

DO - 10.1007/978-3-642-40897-7_15

M3 - Conference contribution

AN - SCOPUS:84888336993

SN - 9783642408960

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

SP - 217

EP - 232

BT - Discovery Science - 16th International Conference, DS 2013, Proceedings

PB - Springer Verlag

T2 - 16th International Conference on Discovery Science, DS 2013

Y2 - 6 October 2013 through 9 October 2013

ER -

Spyropoulou E, De Bie T, Boley M. Mining interesting patterns in multi-relational data with N-ary relationships. In Discovery Science - 16th International Conference, DS 2013, Proceedings. Springer Verlag. 2013. p. 217-232. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-40897-7_15

Mining interesting patterns in multi-relational data with N-ary relationships

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this