论文信息 - TRIAS--An Algorithm for Mining Iceberg Tri-Lattices

TRIAS--An Algorithm for Mining Iceberg Tri-Lattices

In this paper, we present the foundations for mining frequent tri-concepts, which extend the notion of closed item-sets to three-dimensional data to allow for mining folk-sonomies. We provide a formal definition of the problem, and present an efficient algorithm for its solution as well as experimental results on a large real-world example.

[1] Rudolf Wille,et al. A Triadic Approach to Formal Concept Analysis , 1995, ICCS.

[2] Klaus Biedermann. Powerset Trilattices , 1998, ICCS.

[3] Bernhard Ganter,et al. TRIPAT: a Model for Analyzing Three-Mode Binary Data , 1994 .

[4] Andreas Hotho,et al. Information Retrieval in Folksonomies: Search and Ranking , 2006, ESWC.

[5] Gerd Stumme. Conceptual knowledge discovery with frequent concept lattices , 1999 .

[6] Bernhard Ganter,et al. Implications in Triadic Formal Contexts , 2004, ICCS.

[7] Bernhard Ganter,et al. Formal Concept Analysis: Mathematical Foundations , 1998 .

[8] Andreas Hotho,et al. Mining Association Rules in Folksonomies , 2006, Data Science and Classification.

[9] Nicolas Pasquier,et al. Closed Set Based Discovery of Small Covers for Association Rules , 1999, Proc. 15èmes Journées Bases de Données Avancées, BDA.

[10] Klaus Biedermann,et al. Triadic Galois connections , 1997 .

[11] G. L.. Collected Papers , 1912, Nature.

[12] Mohammed J. Zaki,et al. CHARM: An Efficient Algorithm for Closed Association Rule Mining , 2007 .