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, 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
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
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
warehouse basket analysis. They indicate which items of the
warehouse are frequently bought together. The problem of association
rule mining has first been stated in 1993. Five years later, several
research groups discovered that this problem has a strong connection
to Formal Concept Analysis (FCA). In this survey, we will first
introduce some basic ideas of this connection along a specific
algorithm, and show how FCA helps in reducing the number
of resulting rules without loss of information, before giving a
general overview over the history and state of the art of applying
FCA 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.
(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, datalog, fca, formal, iceberg, itegpub, l3s, lattices, myown, 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