Doerfel, S.; Jäschke, R. & Stumme, G.
(2012):
Publication Analysis of the Formal Concept Analysis Community.
In: ICFCA 2012,
Berlin/Heidelberg.
[Volltext]
[Kurzfassung] [BibTeX][Endnote]
We present an analysis of the publication and citation networks of all previous editions of the three conferences most relevant to the FCA community: ICFCA, ICCS and CLA. Using data mining methods from FCA and graph analysis, we investigate patterns and communities among authors, we identify and visualize influential publications and authors, and we give a statistical summary of the conferences’ history.
@inproceedings{doerfel2012publication,
author = {Doerfel, Stephan and Jäschke, Robert and Stumme, Gerd},
title = {Publication Analysis of the Formal Concept Analysis Community},
editor = {Domenach, F. and Ignatov, D.I. and Poelmans, J.},
booktitle = {ICFCA 2012},
series = {Lecture Notes in Artificial Intelligence},
publisher = {Springer},
address = {Berlin/Heidelberg},
year = {2012},
volume = {7278},
pages = {77--95},
url = {https://www.kde.cs.uni-kassel.de/pub/pdf/doerfel2012publication.pdf},
keywords = {2012, analysis, community, concept, fca, home, info20pub, itegpub, l3s, myown, scientometrics},
abstract = {We present an analysis of the publication and citation networks of all previous editions of the three conferences most relevant to the FCA community: ICFCA, ICCS and CLA. Using data mining methods from FCA and graph analysis, we investigate patterns and communities among authors, we identify and visualize influential publications and authors, and we give a statistical summary of the conferences’ history.
}
}
%0 = inproceedings
%A = Doerfel, Stephan and Jäschke, Robert and Stumme, Gerd
%B = ICFCA 2012
%C = Berlin/Heidelberg
%D = 2012
%I = Springer
%T = Publication Analysis of the Formal Concept Analysis Community
%U = https://www.kde.cs.uni-kassel.de/pub/pdf/doerfel2012publication.pdf
Jäschke, R.; Hotho, A.; Schmitz, C.; Ganter, B. & Stumme, G.
(2008):
Discovering Shared Conceptualizations in Folksonomies.
In: Journal of Web Semantics,
Ausgabe/Number: 1,
Vol. 6,
Erscheinungsjahr/Year: 2008.
Seiten/Pages: 38-53.
[Volltext] [BibTeX]
[Endnote]
@article{jaeschke08discovering,
author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd},
title = {Discovering Shared Conceptualizations in Folksonomies},
journal = {Journal of Web Semantics},
year = {2008},
volume = {6},
number = {1},
pages = {38-53},
url = {http://dx.doi.org/10.1016/j.websem.2007.11.004},
keywords = {2008, FCA, OntologyHandbook, analysis, bibsonomy, concept, discovering, fca, folksonomies, formal, itegpub, l3s, myown, shared, triadic}
}
%0 = article
%A = Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd
%D = 2008
%T = Discovering Shared Conceptualizations in Folksonomies
%U = http://dx.doi.org/10.1016/j.websem.2007.11.004
Cattuto, C.; Schmitz, C.; Baldassarri, A.; Servedio, V. D. P.; Loreto, V.; Hotho, A.; Grahl, M. & Stumme, G.
(2007):
Network Properties of Folksonomies.
In: AI Communications Journal, Special Issue on ``Network Analysis in Natural Sciences and Engineering'',
Ausgabe/Number: 4,
Vol. 20,
Verlag/Publisher: IOS Press.
Erscheinungsjahr/Year: 2007.
Seiten/Pages: 245-262.
[Volltext] [BibTeX]
[Endnote]
@article{cattuto2007network,
author = {Cattuto, Ciro and Schmitz, Christoph and Baldassarri, Andrea and Servedio, Vito D. P. and Loreto, Vittorio and Hotho, Andreas and Grahl, Miranda and Stumme, Gerd},
title = {Network Properties of Folksonomies},
editor = {Hoche, Susanne and Nürnberger, Andreas and Flach, Jürgen},
journal = {AI Communications Journal, Special Issue on ``Network Analysis in Natural Sciences and Engineering''},
publisher = {IOS Press},
year = {2007},
volume = {20},
number = {4},
pages = {245-262},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2007/cattuto2007network.pdf},
issn = {0921-7126},
keywords = {2007, emergent, fca, folksonomies, folksonomy, itegpub, l3s, myown, network, semantics, seminar2009, tagorapub}
}
%0 = article
%A = Cattuto, Ciro and Schmitz, Christoph and Baldassarri, Andrea and Servedio, Vito D. P. and Loreto, Vittorio and Hotho, Andreas and Grahl, Miranda and Stumme, Gerd
%D = 2007
%I = IOS Press
%T = Network Properties of Folksonomies
%U = http://www.kde.cs.uni-kassel.de/stumme/papers/2007/cattuto2007network.pdf
Schmitz, C.; Grahl, M.; Hotho, A.; Stumme, G.; Catutto, C.; Baldassarri, A.; Loreto, V. & Servedio, V. D. P.
(2007):
Network Properties of Folksonomies.
In: Proc. WWW2007 Workshop ``Tagging and Metadata for Social Information Organization'',
Banff.
[Volltext]
[BibTeX][Endnote]
@inproceedings{schmitz07network,
author = {Schmitz, Christoph and Grahl, Miranda and Hotho, Andreas and Stumme, Gerd and Catutto, Ciro and Baldassarri, Andrea and Loreto, Vittorio and Servedio, Vito D. P.},
title = {Network Properties of Folksonomies},
booktitle = {Proc. WWW2007 Workshop ``Tagging and Metadata for Social Information Organization''},
address = {Banff},
year = {2007},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2007/schmitz07network.pdf},
keywords = {2007, emergent, fca, folksonomy, folksononomies, itegpub, l3s, myown, semantics, smallworld, sna, socialnetwork}
}
%0 = inproceedings
%A = Schmitz, Christoph and Grahl, Miranda and Hotho, Andreas and Stumme, Gerd and Catutto, Ciro and Baldassarri, Andrea and Loreto, Vittorio and Servedio, Vito D. P.
%B = Proc. WWW2007 Workshop ``Tagging and Metadata for Social Information Organization''
%C = Banff
%D = 2007
%T = Network Properties of Folksonomies
%U = http://www.kde.cs.uni-kassel.de/stumme/papers/2007/schmitz07network.pdf
Hotho, A.; Jäschke, R.; Schmitz, C. & Stumme, G.
(2006):
Information Retrieval in Folksonomies: Search and Ranking.
In: The Semantic Web: Research and Applications,
Heidelberg.
[BibTeX][Endnote]
@inproceedings{hotho2006information,
author = {Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd},
title = {Information Retrieval in Folksonomies: Search and Ranking},
editor = {Sure, York and Domingue, John},
booktitle = {The Semantic Web: Research and Applications},
series = {LNAI},
publisher = {Springer},
address = {Heidelberg},
year = {2006},
volume = {4011},
pages = {411-426},
keywords = {2006, FCA, IR, OntologyHandbook, folkrank, folksonomy, information, informationretrieval, itegpub, mimose, myown, pagerank, ranking, retrieval}
}
%0 = inproceedings
%A = Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd
%B = The Semantic Web: Research and Applications
%C = Heidelberg
%D = 2006
%I = Springer
%T = Information Retrieval in Folksonomies: Search and Ranking
Jäschke, R.; Hotho, A.; Schmitz, C.; Ganter, B. & Stumme, G.
(2006):
TRIAS - An Algorithm for Mining Iceberg Tri-Lattices.
In: Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 06),
Hong Kong.
[Volltext]
[BibTeX][Endnote]
@inproceedings{jaeschke06trias,
author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd},
title = {TRIAS - An Algorithm for Mining Iceberg Tri-Lattices},
booktitle = {Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 06)},
publisher = {IEEE Computer Society},
address = {Hong Kong},
year = {2006},
pages = {907-911},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/jaeschke2006trias.pdf},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2006.162},
isbn = {0-7695-2701-9},
keywords = {2006, FCA, OntologyHandbook, algorithm, analysis, concept, fca, folksonomies, folksonomy, formal, iceberg, itegpub, lattices, myown, nepomuk, tagging, tri, triadic, trias}
}
%0 = inproceedings
%A = Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd
%B = Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 06)
%C = Hong Kong
%D = 2006
%I = IEEE Computer Society
%T = TRIAS - An Algorithm for Mining Iceberg Tri-Lattices
%U = http://www.kde.cs.uni-kassel.de/stumme/papers/2006/jaeschke2006trias.pdf
Schmitz, C.; Hotho, A.; Jäschke, R. & Stumme, G.
(2006):
Mining Association Rules in Folksonomies.
In: Data Science and Classification: Proc. of the 10th IFCS Conf.,
Berlin, Heidelberg.
[BibTeX][Endnote]
@inproceedings{schmitz2006mining,
author = {Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd},
title = {Mining Association Rules in Folksonomies},
editor = {Batagelj, V. and Bock, H.-H. and Ferligoj, A. and vZiberna, A.},
booktitle = {Data Science and Classification: Proc. of the 10th IFCS Conf.},
series = {Studies in Classification, Data Analysis, and Knowledge Organization},
publisher = {Springer},
address = {Berlin, Heidelberg},
year = {2006},
pages = {261--270},
keywords = {2006, FCA, OntologyHandbook, association, folksonomy, itegpub, myown, rule}
}
%0 = inproceedings
%A = Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd
%B = Data Science and Classification: Proc. of the 10th IFCS Conf.
%C = Berlin, Heidelberg
%D = 2006
%I = Springer
%T = Mining Association Rules in Folksonomies
(2005):
Formal Concept Analysis - Foundations and Applications. LNAI Heidelberg
[BibTeX]
[Endnote]
@proceedings{ganter05formal,,
title = {Formal Concept Analysis -- Foundations and Applications},
editor = {Ganter, B. and Stumme, G. and Wille, R.},
series = {LNAI},
publisher = {Springer},
address = {Heidelberg},
year = {2005},
volume = {3626},
keywords = {2005, FCA, OntologyHandbook, itegpub, myown}
}
%0 = proceedings
%C = Heidelberg
%D = 2005
%I = Springer
%T = Formal Concept Analysis -- Foundations and Applications
Lakhal, L. & Stumme, G.
(2005):
Efficient Mining of Association Rules Based on Formal Concept Analysis. LNAI Heidelberg
[Volltext] [Kurzfassung] [BibTeX]
[Endnote]
Association rules are a popular knowledge discovery technique for
rehouse basket analysis. They indicate which items of the
rehouse are frequently bought together. The problem of association
le mining has first been stated in 1993. Five years later, several
search groups discovered that this problem has a strong connection
Formal Concept Analysis (FCA). In this survey, we will first
troduce some basic ideas of this connection along a specific
gorithm, and show how FCA helps in reducing the number
resulting rules without loss of information, before giving a
neral overview over the history and state of the art of applying
A for association rule mining.
@inbook{lakhal2005efficient,
author = {Lakhal, Lotfi and Stumme, Gerd},
title = {Efficient Mining of Association Rules Based on Formal Concept Analysis},
editor = {Ganter, Bernhard and Stumme, Gerd and Wille, Rudolf},
booktitle = {Formal Concept Analysis: Foundations and Applications},
series = {LNAI},
publisher = {Springer},
address = {Heidelberg},
year = {2005},
volume = {3626},
pages = {180-195},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/lakhal2005efficient.pdf},
keywords = {2005, analysis, association, book, closed, concept, condensed, data, discovery, fca, formal, itegpub, itemsets, kdd, knowledge, l3s, mining, myown, representations, rules},
abstract = {Association rules are a popular knowledge discovery technique for
rehouse basket analysis. They indicate which items of the
rehouse are frequently bought together. The problem of association
le mining has first been stated in 1993. Five years later, several
search groups discovered that this problem has a strong connection
Formal Concept Analysis (FCA). In this survey, we will first
troduce some basic ideas of this connection along a specific
gorithm, and show how FCA helps in reducing the number
resulting rules without loss of information, before giving a
neral overview over the history and state of the art of applying
A for association rule mining.}
}
%0 = inbook
%A = Lakhal, Lotfi and Stumme, Gerd
%B = Formal Concept Analysis: Foundations and Applications
%C = Heidelberg
%D = 2005
%I = Springer
%T = Efficient Mining of Association Rules Based on Formal Concept Analysis
%U = http://www.kde.cs.uni-kassel.de/stumme/papers/2005/lakhal2005efficient.pdf
Pasquier, N.; Taouil, R.; Bastide, Y.; Stumme, G. & Lakhal, L.
(2005):
Generating a Condensed Representation for Association Rules.
In: Journal Intelligent Information Systems (JIIS),
Ausgabe/Number: 1,
Vol. 24,
Verlag/Publisher: Kluwer Academic Publishers.
Erscheinungsjahr/Year: 2005.
Seiten/Pages: 29-60.
[Volltext] [BibTeX]
[Endnote]
@article{pasquier2005generating,
author = {Pasquier, Nicolas and Taouil, Rafik and Bastide, Yves and Stumme, Gerd and Lakhal, Lotfi},
title = {Generating a Condensed Representation for Association Rules},
journal = {Journal Intelligent Information Systems (JIIS)},
publisher = {Kluwer Academic Publishers},
year = {2005},
volume = {24},
number = {1},
pages = {29-60},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/pasquier2005generating.pdf},
keywords = {2005, OntologyHandbook, analysis, association, closed, concept, condensed, data, discovery, fca, formal, itegpub, itemset, kdd, knowledge, l3s, mining, myown, representations, rule, rules, sets}
}
%0 = article
%A = Pasquier, Nicolas and Taouil, Rafik and Bastide, Yves and Stumme, Gerd and Lakhal, Lotfi
%D = 2005
%I = Kluwer Academic Publishers
%T = Generating a Condensed Representation for Association Rules
%U = http://www.kde.cs.uni-kassel.de/stumme/papers/2005/pasquier2005generating.pdf
Stumme, G.
(2005):
A Finite State Model for On-Line Analytical Processing in
Triadic Contexts.
In: Proc. 3rd Intl. Conf. on Formal Concept Analysis,
Heidelberg.
[Volltext]
[BibTeX][Endnote]
@inproceedings{stumme05finite,
author = {Stumme, Gerd},
title = {A Finite State Model for On-Line Analytical Processing in
Triadic Contexts},
editor = {Ganter, Bernhard and Godin, Robert},
booktitle = {Proc. 3rd Intl. Conf. on Formal Concept Analysis},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
address = {Heidelberg},
year = {2005},
volume = {3403},
pages = {315-328},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/stumme2005finite.pdf},
isbn = {3-540-24525-1},
keywords = {2005, fca, folksonomies, itegpub, l3s, myown, olap, triadic}
}
%0 = inproceedings
%A = Stumme, Gerd
%B = Proc. 3rd Intl. Conf. on Formal Concept Analysis
%C = Heidelberg
%D = 2005
%I = Springer
%T = A Finite State Model for On-Line Analytical Processing in
Triadic Contexts
%U = http://www.kde.cs.uni-kassel.de/stumme/papers/2005/stumme2005finite.pdf
Stumme, G.
(2005):
A Finite State Model for On-Line Analytical Processing in Triadic
Contexts..
In: Proc. 3rd Intl. Conf. on Formal Concept Analysis,
[BibTeX][Endnote]
@inproceedings{stumme05finite,
author = {Stumme, Gerd},
title = {A Finite State Model for On-Line Analytical Processing in Triadic
Contexts.},
editor = {Ganter, Bernhard and Godin, Robert},
booktitle = {Proc. 3rd Intl. Conf. on Formal Concept Analysis},
series = {LNCS},
publisher = {Springer},
year = {2005},
volume = {3403},
pages = {315-328},
isbn = {3-540-24525-1},
keywords = {2005, FCA, OntologyHandbook, context, fca, itegpub, myown, olap, triadic}
}
%0 = inproceedings
%A = Stumme, Gerd
%B = Proc. 3rd Intl. Conf. on Formal Concept Analysis
%D = 2005
%I = Springer
%T = A Finite State Model for On-Line Analytical Processing in Triadic
Contexts.
Stumme, G.
(2005):
Conceptual Knowledge Processing (Invited Talk).
In: Ontologies-based techniques for DataBases and Information Systems,
Trondheim.
[Volltext]
[BibTeX][Endnote]
@inproceedings{stumme05conceptual,
author = {Stumme, Gerd},
title = {Conceptual Knowledge Processing (Invited Talk)},
editor = {Collard, Martine and Cavarero, Jean-Louis},
booktitle = {Ontologies-based techniques for DataBases and Information Systems},
address = {Trondheim},
year = {2005},
pages = {5},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/stumme2005some_slides.pdf},
keywords = {2005, conceptual, fca, itegpub, knowledge, l3s, myown, ontologies, processing}
}
%0 = inproceedings
%A = Stumme, Gerd
%B = Ontologies-based techniques for DataBases and Information Systems
%C = Trondheim
%D = 2005
%T = Conceptual Knowledge Processing (Invited Talk)
%U = http://www.kde.cs.uni-kassel.de/stumme/papers/2005/stumme2005some_slides.pdf
Cimiano, P.; Hotho, A.; Stumme, G. & Tane, J.
(2004):
Conceptual Knowledge Processing with Formal Concept
Analysis and Ontologies.
In: Concept Lattices.
2961. Aufl./Vol..
Hrsg./Editors: Eklund, P.
Verlag/Publisher: Springer,
Berlin/Heidelberg.
Erscheinungsjahr/Year: 2004.
Seiten/Pages: 189-207.
[Volltext] [BibTeX]
[Endnote]
@incollection{cimiano2004conceptual,
author = {Cimiano, Philipp and Hotho, Andreas and Stumme, Gerd and Tane, Julien},
title = {Conceptual Knowledge Processing with Formal Concept
Analysis and Ontologies},
editor = {Eklund, Peter},
booktitle = {Concept Lattices},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
address = {Berlin/Heidelberg},
year = {2004},
volume = {2961},
pages = {189--207},
url = {http://dx.doi.org/10.1007/978-3-540-24651-0_18},
isbn = {978-3-540-21043-6},
keywords = {2004, citedBy:doerfel2012publication, fca, icfca, itegpub, knowledge, l3s, myown, processing}
}
%0 = incollection
%A = Cimiano, Philipp and Hotho, Andreas and Stumme, Gerd and Tane, Julien
%B = Concept Lattices
%C = Berlin/Heidelberg
%D = 2004
%I = Springer
%T = Conceptual Knowledge Processing with Formal Concept
Analysis and Ontologies
%U = http://dx.doi.org/10.1007/978-3-540-24651-0_18
Cimiano, P.; Hotho, A.; Stumme, G. & Tane, J.
(2004):
Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies.
In: Concept Lattices,
Heidelberg.
[Volltext]
[Kurzfassung] [BibTeX][Endnote]
Among many other knowledge representations formalisms, Ontologies
d Formal Concept Analysis (FCA) aim at modeling 'concepts'. We
scuss how these two formalisms may complement another from an
plication point of view. In particular, we will see how FCA can
used to support Ontology Engineering, and how ontologies can be
ploited in FCA applications. The interplay of FCA and ontologies
studied along the life cycle of an ontology:
i) FCA can support the building of the ontology as a
earning technique.
ii) The established ontology can be analyzed and navigated by
sing techniques of FCA.
iii) Last but not least, the ontology may be used to improve an FCA
pplication.
@inproceedings{cimiano2004concept,
author = {Cimiano, Philipp and Hotho, Andreas and Stumme, Gerd and Tane, Julien},
title = {Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies},
editor = {Eklund, Peter},
booktitle = {Concept Lattices},
series = {LNAI},
publisher = {Springer},
address = {Heidelberg},
year = {2004},
volume = {2961},
pages = {189-207},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2004/cimiano2004concept.pdf},
isbn = {3-540-23258-3},
keywords = {2004, ckp, conceptual, fca, itegpub, knowledge, l3s, myown, ontologies, processing},
abstract = {Among many other knowledge representations formalisms, Ontologies
d Formal Concept Analysis (FCA) aim at modeling 'concepts'. We
scuss how these two formalisms may complement another from an
plication point of view. In particular, we will see how FCA can
used to support Ontology Engineering, and how ontologies can be
ploited in FCA applications. The interplay of FCA and ontologies
studied along the life cycle of an ontology:
i) FCA can support the building of the ontology as a
earning technique.
ii) The established ontology can be analyzed and navigated by
sing techniques of FCA.
iii) Last but not least, the ontology may be used to improve an FCA
pplication.}
}
%0 = inproceedings
%A = Cimiano, Philipp and Hotho, Andreas and Stumme, Gerd and Tane, Julien
%B = Concept Lattices
%C = Heidelberg
%D = 2004
%I = Springer
%T = Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies
%U = http://www.kde.cs.uni-kassel.de/stumme/papers/2004/cimiano2004concept.pdf
Stumme, G.
(2004):
Iceberg Query Lattices for Datalog.
In: Conceptual Structures at Work: 12th International Conference on Conceptual Structures (ICCS 2004),
Heidelberg.
[Volltext]
[BibTeX][Endnote]
@inproceedings{stumme2004iceberg,
author = {Stumme, Gerd},
title = {Iceberg Query Lattices for Datalog},
editor = {Wolff, Karl Erich and Pfeiffer, Heather D. and Delugach, Harry S.},
booktitle = {Conceptual Structures at Work: 12th International Conference on Conceptual Structures (ICCS 2004)},
series = {LNCS},
publisher = {Springer},
address = {Heidelberg},
year = {2004},
volume = {3127},
pages = {109-125},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2004/stumme2004iceberg.pdf},
keywords = {2004, analysis, concept, context, datalog, families, family, fca, formal, iceberg, itegpub, l3s, lattices, myown, pcf, power, queries, query}
}
%0 = inproceedings
%A = Stumme, Gerd
%B = Conceptual Structures at Work: 12th International Conference on Conceptual Structures (ICCS 2004)
%C = Heidelberg
%D = 2004
%I = Springer
%T = Iceberg Query Lattices for Datalog
%U = http://www.kde.cs.uni-kassel.de/stumme/papers/2004/stumme2004iceberg.pdf
Tane, J.; Schmitz, C. & Stumme, G.
(2004):
Semantic resource management for the web: an e-learning application.
In: Proc. 13th International World Wide Web Conference (WWW 2004),
[Volltext]
[BibTeX][Endnote]
@inproceedings{tane04semantic,
author = {Tane, Julien and Schmitz, Christoph and Stumme, Gerd},
title = {Semantic resource management for the web: an e-learning application},
booktitle = {Proc. 13th International World Wide Web Conference (WWW 2004)},
year = {2004},
pages = {1-10},
url = {http://www.www2004.org/proceedings/docs/2p1.pdf},
keywords = {2004, application, courseware, crawler, e-learning, eLearning, edutella, fca, itegpub, l3s, learning, myown, p2p, semantic, watchdog, web}
}
%0 = inproceedings
%A = Tane, Julien and Schmitz, Christoph and Stumme, Gerd
%B = Proc. 13th International World Wide Web Conference (WWW 2004)
%D = 2004
%T = Semantic resource management for the web: an e-learning application
%U = http://www.www2004.org/proceedings/docs/2p1.pdf
Stumme, G.; Taouil, R.; Bastide, Y.; Pasquier, N. & Lakhal, L.
(2002):
Computing iceberg concept lattices with TITANIC.
In: Data & Knowledge Engineering,
Ausgabe/Number: 2,
Vol. 42,
Verlag/Publisher: Elsevier Science Publishers B. V..
Erscheinungsjahr/Year: 2002.
Seiten/Pages: 189-222.
[Volltext] [Kurzfassung] [BibTeX]
[Endnote]
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.
@article{stumme2002computing,
author = {Stumme, Gerd and Taouil, Rafik and Bastide, Yves and Pasquier, Nicolas and Lakhal, Lotfi},
title = {Computing iceberg concept lattices with TITANIC},
journal = {Data & Knowledge Engineering},
publisher = {Elsevier Science Publishers B. V.},
address = {Amsterdam, The Netherlands, The Netherlands},
year = {2002},
volume = {42},
number = {2},
pages = {189--222},
url = {http://portal.acm.org/citation.cfm?id=606457},
doi = {10.1016/S0169-023X(02)00057-5},
issn = {0169-023X},
keywords = {citedBy:doerfel2012publication, fca, icfca, itegpub, l3s, myown, titanic},
abstract = {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.}
}
%0 = article
%A = Stumme, Gerd and Taouil, Rafik and Bastide, Yves and Pasquier, Nicolas and Lakhal, Lotfi
%C = Amsterdam, The Netherlands, The Netherlands
%D = 2002
%I = Elsevier Science Publishers B. V.
%T = Computing iceberg concept lattices with TITANIC
%U = http://portal.acm.org/citation.cfm?id=606457