%0 Conference Paper %1 jaeschke2006trias %A Jäschke, Robert %A Hotho, Andreas %A Schmitz, Christoph %A Ganter, Bernhard %A Stumme, Gerd %B Data Mining, 2006. ICDM'06. Sixth International Conference on %D 2006 %K 12 2006 algorithm analysis concept dblp fca folksonomies folksonomy formal from:jaeschke ganter iccs_example icdm iceberg imported issi_example itegpub jaeschke kdubiq ki2007webmining l3s lattices methods_concepts mining myown nepomuk ol_tut2010 ol_web2.0 ontologyhandbook proceedings publication sosbuch summerschool tagging tri triadic trias trias_example wp5 %P 907--911 %T TRIAS--An Algorithm for Mining Iceberg Tri-Lattices %U http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4053125 %X In this paper, we present the foundations for mining frequent tri- concepts, which extend the notion of closed itemsets to three- dimensional data to allow for mining folksonomies. 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. this kind of data. In Section 3, we discuss Triadic Formal Concept Analysis and provide in Section 4 a formal definition of the problem of mining frequent triadic formal concepts; in Section 5, we introduce our T RIAS algorithm. Section 6 comes up with a real-world application, the folksonomy of the bookmark sharing system del.icio.us, and concludes with experiments on the effectiveness and efficiency of the algorithm.

@inproceedings{jaeschke2006trias, abstract = {In this paper, we present the foundations for mining frequent tri- concepts, which extend the notion of closed itemsets to three- dimensional data to allow for mining folksonomies. 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. this kind of data. In Section 3, we discuss Triadic Formal Concept Analysis and provide in Section 4 a formal definition of the problem of mining frequent triadic formal concepts; in Section 5, we introduce our T RIAS algorithm. Section 6 comes up with a real-world application, the folksonomy of the bookmark sharing system del.icio.us, and concludes with experiments on the effectiveness and efficiency of the algorithm.}, added-at = {2015-04-27T11:46:35.000+0200}, author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd}, biburl = {https://www.bibsonomy.org/bibtex/2d34aa47062752ad48b60a61c15562679/kdepublication}, booktitle = {Data Mining, 2006. ICDM'06. Sixth International Conference on}, citations = {74}, citedbyid = {14060951684432474494}, file = {file://TRIAS — An Algorithm for Mining Iceberg Tri-Lattices.pdf:pdf}, interhash = {b4964c3bdd2991a80873d7080ef6a73e}, intrahash = {d34aa47062752ad48b60a61c15562679}, keywords = {12 2006 algorithm analysis concept dblp fca folksonomies folksonomy formal from:jaeschke ganter iccs_example icdm iceberg imported issi_example itegpub jaeschke kdubiq ki2007webmining l3s lattices methods_concepts mining myown nepomuk ol_tut2010 ol_web2.0 ontologyhandbook proceedings publication sosbuch summerschool tagging tri triadic trias trias_example wp5}, md5sum = {e01bcaab411e7ddd9cc5e0c0dd923575}, organization = {IEEE}, pages = {907--911}, pdfmeat = {timestamp: 2013-08-04 16:06:19; queries: 5; inode: 1949821}, timestamp = {2015-04-27T11:52:38.000+0200}, title = {TRIAS--An Algorithm for Mining Iceberg Tri-Lattices}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4053125}, year = 2006 }