Computer Science – Databases
Scientific paper
2011-06-22
Computer Science
Databases
Accepted at ICDM'11
Scientific paper
Mining patterns from multi-relational data is a problem attracting increasing interest within the data mining community. Traditional data mining approaches are typically developed for highly simplified types of data, such as an attribute-value table or a binary database, such that those methods are not directly applicable to multi-relational data. Nevertheless, multi-relational data is a more truthful and therefore often also a more powerful representation of reality. Mining patterns of a suitably expressive syntax directly from this representation, is thus a research problem of great importance. In this paper we introduce a novel approach to mining patterns in multi-relational data. We propose a new syntax for multi-relational patterns as complete connected subgraphs in a representation of the database as a K-partite graph. We show how this pattern syntax is generally applicable to multirelational data, while it reduces to well-known tiles [7] when the data is a simple binary or attribute-value table. We propose RMiner, an efficient algorithm to mine such patterns, and we introduce a method for quantifying their interestingness when contrasted with prior information of the data miner. Finally, we illustrate the usefulness of our approach by discussing results on real-world and synthetic databases.
Bie Tijl de
Spyropoulou Eirini
No associations
LandOfFree
Interesting Multi-Relational Patterns does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Interesting Multi-Relational Patterns, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interesting Multi-Relational Patterns will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-206885