Finding Trees from Unordered 0–1 Data

  • Hannes Heikinheimo
  • Heikki Mannila
  • Jouni K. Seppänen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4213)

Abstract

Tree structures are a natural way of describing occurrence relationships between attributes in a dataset. We define a new class of tree patterns for unordered 0–1 data and consider the problem of discovering frequently occurring members of this pattern class. Intuitively, a tree T occurs in a row u of the data, if the attributes of T that occur in u form a subtree of T containing the root. We show that this definition has advantageous properties: only shallow trees have a significant probability of occurring in random data, and the definition allows a simple levelwise algorithm for mining all frequently occurring trees. We demonstrate with empirical results that the method is feasible and that it discovers interesting trees in real data.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Hannes Heikinheimo
    • 1
  • Heikki Mannila
    • 1
  • Jouni K. Seppänen
    • 1
  1. 1.HIIT Basic Research Unit, Lab. Computer and Information ScienceHelsinki University of TechnologyFinland

Personalised recommendations