BibSonomy publications for /concept/tag/icebergThu Jan 27 12:14:52 CET 2011Washington, DC, USAICDM '06: Proceedings of the Sixth International Conference on Data Mining907--911TRIAS - An Algorithm for Mining Iceberg Tri-Lattices20062006 fca iceberg myown ol_tut2010 triadic trias 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.Wed Jan 19 15:17:53 CET 2011Amsterdam, The Netherlands, The NetherlandsData & Knowledge Engineeringaug2189--222Computing iceberg concept lattices with TITANIC422002computing concept fca iceberg kdd titanic We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suited for analyzing very large databases. They also serve as a condensed representation of frequent itemsets, as starting point for computing bases of association rules, and as a visualization method for association rules. Iceberg concept lattices are based on the theory of Formal Concept Analysis, a mathematical theory with applications in data analysis, information retrieval, and knowledge discovery. We present a new algorithm called TITANIC for computing (iceberg) concept lattices. It is based on data mining techniques with a level-wise approach. In fact, TITANIC can be used for a more general problem: Computing arbitrary closure systems when the closure operator comes along with a so-called weight function. The use of weight functions for computing closure systems has not been discussed in the literature up to now. Applications providing such a weight function include association rule mining, functional dependencies in databases, conceptual clustering, and ontology engineering. The algorithm is experimentally evaluated and compared with Ganter's Next-Closure algorithm. The evaluation shows an important gain in efficiency, especially for weakly correlated data.Wed Jun 30 09:35:22 CEST 2010Amsterdam, The Netherlands, The NetherlandsData \& Knowledge Engineeringaug2189--222Computing iceberg concept lattices with TITANIC422002analysis concept fca formal iceberg lattice titanic We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suited for analyzing very large databases. They also serve as a condensed representation of frequent itemsets, as starting point for computing bases of association rules, and as a visualization method for association rules. Iceberg concept lattices are based on the theory of Formal Concept Analysis, a mathematical theory with applications in data analysis, information retrieval, and knowledge discovery. We present a new algorithm called TITANIC for computing (iceberg) concept lattices. It is based on data mining techniques with a level-wise approach. In fact, TITANIC can be used for a more general problem: Computing arbitrary closure systems when the closure operator comes along with a so-called weight function. The use of weight functions for computing closure systems has not been discussed in the literature up to now. Applications providing such a weight function include association rule mining, functional dependencies in databases, conceptual clustering, and ontology engineering. The algorithm is experimentally evaluated and compared with Ganter's Next-Closure algorithm. The evaluation shows an important gain in efficiency, especially for weakly correlated data.Fri Jul 03 00:19:24 CEST 2009Universität Dortmund 763Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01)OctoberConceptual Clustering with Iceberg Concept Lattices20012001 analysis closed clustering concept conceptual discovery fca formal iceberg itemsets kdd knowledge lattices myown Mon Mar 02 21:40:27 CET 2009Hong KongProceedings of the 6th IEEE International Conference on Data Mining (ICDM 06)December907-911TRIAS - An Algorithm for Mining Iceberg Tri-Lattices20062006 FCA OntologyHandbook algorithm analysis concept fca folksonomies folksonomy formal iceberg itegpub lattices myown nepomuk tagging tri triadic trias Thu Mar 27 15:28:26 CET 2008{J.} Data and KnowledgeEngineering (DKE)2189-222Computing Iceberg Concept Lattices with {Titanic}4220022002 analysis closed concept fca formal iceberg itemsets lattices myown titanic Thu Aug 02 10:26:58 CEST 2007Proceedings of the 12th International Conference on Conceptual Structures (ICCS 2004)DBLP:conf/iccs/2004109-125Lecture Notes in Computer ScienceIceberg Query Lattices for Datalog.312720042004 analysis concept datalog fca formal iccs iceberg lattice Fri Nov 17 08:46:17 CET 2006Hong KongProc. 6th ICDM conferenceDecember(to appear)TRIAS - An Algorithm for Mining Iceberg Tri-Lattices2006algorithm analysis concept fca folksonomy formal iceberg lattices nepomuk tagging triadic trias Fri Nov 17 08:45:54 CET 2006{J.} Knowledge and Data Engineering (KDE)2189-222Computing Iceberg Concept Lattices with {Titanic}422002analysis closed concept fca formal iceberg itemset lattices titanic Fri Nov 17 08:45:54 CET 2006Technique et Science Informatiques (TSI)165-95Pascal: un alogorithme d'extraction des motifs fréquents212002analysis association closed concept condensed fca formal iceberg itemset lattices pascal representation rule titanic Fri Nov 17 08:45:47 CET 2006Universität Dortmund 763Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01)October{P}art of \cite{stumme02computing}Conceptual Clustering with Iceberg Concept Lattices2001analysis closed clustering concept conceptual discovery fca formal iceberg itemset kdd knowledge lattices Fri Nov 17 08:45:35 CET 2006Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases\url{http://ceur-ws.org/Vol-29.} {P}art of \cite{stumme02computing}Fast Computation of Concept Lattices Using Data Mining Techniques2000algorithm analysis closed computation concept condensed fca formal iceberg itemset lattices representation Fri Nov 17 08:45:28 CET 2006Conceptual Knowledge Discovery with Frequent Concept Lattices{FB}4-{P}reprint 20431999analysis association closed concept condensed data-mining discovery fca formal frequent iceberg itemset kdd knowledge lattices representation rule Wed Sep 20 19:42:33 CEST 2006Conceptual Knowledge Discovery with Frequent Concept Lattices{FB}4-{P}reprint 20431999frequent discovery formal rules concept knowledge condensed association iceberg kdd mining itemsets lattices analysis 1999 rule myown representations data closed fca Wed Sep 20 19:25:10 CEST 2006Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases\url{http://ceur-ws.org/Vol-29.} {P}art of \cite{stumme02computing}Fast Computation of Concept Lattices Using Data Mining Techniques2000computation formal concept condensed 2000 iceberg itemsets algorithm lattices analysis myown representations closed algorithms fca Wed Sep 20 19:20:19 CEST 2006Technique et Science Informatiques (TSI)165-95Pascal: un alogorithme d'extraction des motifs fréquents212002formal rules concept condensed iceberg association itemsets lattices analysis pascal myown representations closed 2002 titanic fca Mon Sep 18 21:04:23 CEST 2006HeidelbergConceptual Structures at Work: 12th International Conference on Conceptual Structures (ICCS 2004)109-125LNCSIceberg Query Lattices for Datalog312720042004 analysis concept datalog fca formal iceberg itegpub l3s lattices myown queries query Thu Feb 02 17:47:46 CET 2006HeidelbergConceptual Structures at Work: 12th International Conference on Conceptual Structures (ICCS 2004)109-125LNCSIceberg Query Lattices for Datalog31272004kde query 2004 datalog watchdog iceberg kassel prolearn lattices Tue Dec 20 20:21:42 CET 2005J. on Knowledge and Data Engineering2189--222Computing Iceberg Concept Lattices with Titanic422002computing concept iceberg lattices titanic