Mining relational patterns from multiple relational tables

Abstract In this paper, we present the concept of relational patterns and our approach to extract them from multiple relational tables. Relational patterns are analogous to frequent itemsets extracted by the Apriori algorithm [R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, A.I. Verkamo, Advances in Knowledge Discovery and Data Mining, AAAI Press, 1995.] in the case of a single table. However, for the multiple relational tables, relational patterns capture co-occurrences of attributes as well as the relationships between these attributes, which are essential to avoid information loss. We describe our experiences from a test-bed implementation of our approach on a real hospital's discharge abstract database. This process raised issues, which were then implemented in order to enhance an analyst's ability to explore patterns while preventing high diversity and abundance of available data from blurring subtle patterns of interest. Finally, we evaluate the usefulness of relational patterns in the context of the discharge abstract data as well in other possible domains.

[1]  Heikki Mannila,et al.  Efficient Algorithms for Discovering Association Rules , 1994, KDD Workshop.

[2]  Heikki Mannila,et al.  Finding interesting rules from large sets of discovered association rules , 1994, CIKM '94.

[3]  Ramakrishnan Srikant,et al.  Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[4]  Heikki Mannila,et al.  Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.

[5]  Abraham Silberschatz,et al.  On Subjective Measures of Interestingness in Knowledge Discovery , 1995, KDD.

[6]  Ehud Gudes,et al.  FlexiMine - A Flexible Platform for KDD Research and Application Construction , 1998, KDD.

[7]  Gediminas Adomavicius,et al.  Discovery of Actionable Patterns in Databases: the Action Hierarchy Approach , 1997, KDD.

[8]  Randy Kerber,et al.  ChiMerge: Discretization of Numeric Attributes , 1992, AAAI.

[9]  Balaji Padmanabhan,et al.  A Belief-Driven Method for Discovering Unexpected Patterns , 1998, KDD.

[10]  Ramakrishnan Srikant,et al.  Mining quantitative association rules in large relational tables , 1996, SIGMOD '96.

[11]  Shamkant B. Navathe,et al.  An Efficient Algorithm for Mining Association Rules in Large Databases , 1995, VLDB.

[12]  Renée J. Miller,et al.  Association rules over interval data , 1997, SIGMOD '97.

[13]  Gregory Piatetsky-Shapiro,et al.  An Application of KEFM to the Analysis of Healthcare Information , 1994, KDD Workshop.

[14]  Gregory Piatetsky-Shapiro,et al.  Selecting and reporting What Is Interesting , 1996, Advances in Knowledge Discovery and Data Mining.

[15]  Abraham Silberschatz,et al.  What Makes Patterns Interesting in Knowledge Discovery Systems , 1996, IEEE Trans. Knowl. Data Eng..

[16]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[17]  David Wai-Lok Cheung,et al.  Efficient Mining of Association Rules in Distributed Databases , 1996, IEEE Trans. Knowl. Data Eng..