Mining relational patterns from multiple relational tables

Maytal Saar Tsechansky, Nava Pliskin, Gadi Rabinowitz, Avi Porath

Research output: Contribution to journalArticlepeer-review

28 Scopus citations

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

Original languageEnglish
Pages (from-to)177-195
Number of pages19
JournalDecision Support Systems
Volume27
Issue number1
DOIs
StatePublished - 1 Jan 1999

ASJC Scopus subject areas

  • Management Information Systems
  • Information Systems
  • Developmental and Educational Psychology
  • Arts and Humanities (miscellaneous)
  • Information Systems and Management

Fingerprint

Dive into the research topics of 'Mining relational patterns from multiple relational tables'. Together they form a unique fingerprint.

Cite this