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 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.
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 jaeschke2006trias
%A Jäschke, Robert
%A Hotho, Andreas
%A Schmitz, Christoph
%A Ganter, Bernhard
%A Stumme, Gerd
%B ICDM '06: Proceedings of the Sixth International Conference on Data Mining
%C Washington, DC, USA
%D 2006
%I IEEE Computer Society
%K
%P 907--911
%R 10.1109/ICDM.2006.162
%T TRIAS - An Algorithm for Mining Iceberg Tri-Lattices
%U http://www.kde.cs.uni-kassel.de/pub/pdf/jaeschke2006trias.pdf
%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 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.
%@ 0-7695-2701-9
@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 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.},
added-at = {2011-01-27T12:16:44.000+0100},
address = {Washington, DC, USA},
author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd},
biburl = {https://www.bibsonomy.org/bibtex/2797d40e05a48f4343d7695dac87b5870/jaeschke},
booktitle = {ICDM '06: Proceedings of the Sixth International Conference on Data Mining},
doi = {10.1109/ICDM.2006.162},
interhash = {b4964c3bdd2991a80873d7080ef6a73e},
intrahash = {797d40e05a48f4343d7695dac87b5870},
isbn = {0-7695-2701-9},
keywords = {},
pages = {907--911},
publisher = {IEEE Computer Society},
timestamp = {2011-09-22T11:56:28.000+0200},
title = {TRIAS - An Algorithm for Mining Iceberg Tri-Lattices},
url = {http://www.kde.cs.uni-kassel.de/pub/pdf/jaeschke2006trias.pdf},
year = 2006
}