| Author | Title | Year | Journal/Proceedings | Reftype | DOI/URL |
|---|---|---|---|---|---|
| Doerfel, S., Jäschke, R. & Stumme, G. | Publication Analysis of the Formal Concept Analysis Community | 2012 | ICFCA 2012 | inproceedings | URL |
| 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. |
|||||
BibTeX:
@inproceedings{doerfel2012publication,
author = {Doerfel, Stephan and Jäschke, Robert and Stumme, Gerd},
title = {Publication Analysis of the Formal Concept Analysis Community},
booktitle = {ICFCA 2012},
publisher = {Springer},
year = {2012},
volume = {7278},
pages = {77--95},
url = {https://www.kde.cs.uni-kassel.de/pub/pdf/doerfel2012publication.pdf}
}
|
|||||
| Jäschke, R., Hotho, A., Schmitz, C., Ganter, B. & Stumme, G. | Discovering Shared Conceptualizations in Folksonomies [BibTeX] |
2008 | Journal of Web Semantics | article | URL |
BibTeX:
@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}
}
|
|||||
| Cimiano, P., Hotho, A., Stumme, G. & Tane, J. | Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies [BibTeX] |
2004 | Concept Lattices | incollection | URL |
BibTeX:
@incollection{cimiano2004conceptual,
author = {Cimiano, Philipp and Hotho, Andreas and Stumme, Gerd and Tane, Julien},
title = {Conceptual Knowledge Processing with Formal Concept
Analysis and Ontologies},
booktitle = {Concept Lattices},
publisher = {Springer},
year = {2004},
volume = {2961},
pages = {189--207},
url = {http://dx.doi.org/10.1007/978-3-540-24651-0_18}
}
|
|||||
| Stumme, G. | Iceberg Query Lattices for Datalog [BibTeX] |
2004 | Conceptual Structures at Work: 12th International Conference on Conceptual Structures (ICCS 2004) | inproceedings | URL |
BibTeX:
@inproceedings{stumme2004iceberg,
author = {Stumme, Gerd},
title = {Iceberg Query Lattices for Datalog},
booktitle = {Conceptual Structures at Work: 12th International Conference on Conceptual Structures (ICCS 2004)},
publisher = {Springer},
year = {2004},
volume = {3127},
pages = {109-125},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2004/stumme2004iceberg.pdf}
}
|
|||||
| Stumme, G., Taouil, R., Bastide, Y., Pasquier, N. & Lakhal, L. | Computing iceberg concept lattices with TITANIC | 2002 | Data & Knowledge Engineering | article | DOIURL |
| 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. |
|||||
BibTeX:
@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.},
year = {2002},
volume = {42},
number = {2},
pages = {189--222},
url = {http://portal.acm.org/citation.cfm?id=606457},
doi = {http://dx.doi.org/10.1016/S0169-023X(02)00057-5}
}
|
|||||
Created by JabRef export filters on 28/04/2024 by the social publication management platform PUMA