Finding Trees From Unordered 0--1 Data

@misc{citeulike:2891446, 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...}, author = {Heikinheimo, Hannes and Mannila, Heikki and Sepp\"{a}nen, Jouni K. }, citeulike-article-id = {2891446}, keywords = {datamining, interestingness, mining, patterns, trees}, posted-at = {2008-06-13 14:15:32}, priority = {2}, title = {Finding Trees From Unordered 0--1 Data}, url = {http://citeseer.ist.psu.edu/761229.html}, year = {2006} }

TY - GEN ID - citeulike:2891446 L3 - citeulike-article-id:2891446 TI - Finding Trees From Unordered 0--1 Data N2 - 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... KW - datamining KW - interestingness KW - mining KW - patterns KW - trees AU - Heikinheimo, Hannes AU - Mannila, Heikki AU - Seppänen, Jouni PY - 2006/// UR - http://citeseer.ist.psu.edu/761229.html ER -