TRIAS - An algorithm for mining iceberg tri-lattices

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2006, Pages 907-911

  Jäschke, Robert ^a,b   Hotho, Andreas ^a   Schmitz, Christoph ^a   Ganter, Bernhard ^c   Stumme, Gerd ^a,b  

^a UNIVERSITY OF KASSEL   (Germany)

^b L3S RESEARCH CENTER   (Germany)

^c DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ICEBERG TRILATTICES; ITEM SETS;

DATA STRUCTURES; PROBLEM SOLVING; REAL TIME SYSTEMS; THREE DIMENSIONAL;

DATA MINING;

EID: 34748864098     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2006.162     Document Type: Conference Paper

References (14)

1. K. Biedermann. Triadic Galois connections. In K. Denecke and O. Lüders, editors, General algebra and applications in discrete mathematics, pages 23-33, Aachen, 1997. Shaker Verlag.
2. K. Biedermann. Powerset trilattices. In M. Mugnier and M. Chein, editors, Conceptual Structures: Theory, Tools and Applications, volume 1453 of Lecture Notes in Computer Science, pages 209-221. Springer, 1998.
3. B. Ganter. Algorithmen zur formalen Begriffsanalyse. In B. Ganter, R. Wille, and K. E. Wolff, editors, Beiträge zur Begriffsanalyse, pages 241-254. B.I.-Wissenschaftsverlag, Mannheim, 1987.
4. B. Ganter and S.A. Obiedkov. Implications in triadic contexts. In Conceptual Structures at Work: 12th International Conference on Conceptual Structures, volume 3127 of Lecture Notes in Computer Science, pages 186-195. Springer, 2004.
5. B. Ganter and R. Wille. Formal Concept Analysis: Mathematical Foundations. Springer, 1999.
6. A. Hotho, R. Jäschke, C. Schmitz, and G. Stumme. Information retrieval in folksonomies: Search and ranking. In Y. Sure and J. Domingue, editors, The Semantic Web: Research and Applications, volume 4011 of LNAI, pages 411-426, Heidelberg, June 2006. Springer.
7. S. Krolak-Schwerdt, P. Orlik, and B. Ganter. TRIPAT: a model for analyzing three-mode binary data. In H. H. Bock, W. Lenski, and M. M. Richter, editors, Studies in Classification, Data Analysis, and Knowledge Organization, volume 4 of Information systems and data analysis, pages 298-307. Springer, Berlin, 1994.
8. F. Lehmann and R. Wille. A triadic approach to formal concept analysis. In G. Ellis, R. Levinson, W. Rich, and J. F. Sowa, editors, Conceptual structures: applications, implementation and theory, volume 954 of Lecture Notes in Artificial Intelligence, pages 32-43. Springer Verlag, 1995.
9. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Closed set based discovery of small covers for association rules. In Actes des 15èmes journées Bases de Données Avancées (BDA'99), pages 361-381, Octobre 1999.
10. C. S. Peirce. Collected Papers. Harvard Universit Press, Cambridge, 1931-1935.
11. C. Schmitz, A. Hotho, R. Jäschke, and G. Stumme. Mining association rules in folksonomies. In V. Batagelj, H.-H. Bock, A. Ferligoj, and A. Žiberna, editors, Data Science and Classification: Proc. of the 10th IFCS Conf, Studies in Classification, Data Analysis, and Knowledge Organization, pages 261-270, Berlin, Heidelberg, 2006. Springer.
12. G. Stumme. Conceptual knowledge discovery with frequent concept lattices. FB4-Preprint 2043, TU Darmstadt, 1999.
13. R. Wille. Restructuring lattice theory: An approach based on hierarchies of concepts. In I. Rival, editor, Ordered Sets, pages 445-470. Reidel, Dordrecht-Boston, 1982.
14. M. J. Zaki and C.-J. Hsiao. Charm: An efficient algorithm for closed association rule mining, technical report 99-10. Technical, report, Computer Science Dept., Rensselaer Polytechnic, October 1999.