Artikel in Zeitschriften
Visualization techniques for mining large databases : A comparison.
IEEE Transactions on Knowledge and Data Engineering, 8(6):923-938, 1996.
D. Keim und H. Kriegel.
[BibTeX]
Buchbeiträge
Using Ontologies and Formal Concept Analysis for Organizing Business Knowledge.
In:
J. Becker und R. Knackstedt (Herausgeber):
Wissensmanagement mit Referenzmodellen - Konzepte für die Anwendungssystem- und Organisationsgestaltung, Seiten 163-174.
Physica, Heidelberg, 2002.
G. Stumme.
[doi]
[BibTeX]
Sonstiges
Theorie des kommunikativen Handelns.
1981.
J�rgen Habermas.
[BibTeX]
Technische Berichte
The Structure of Collaborative Tagging Systems.
Information Dynamics Lab, HP Labs , 2005.
Scott Golder und Bernardo A. Huberman.
[doi]
[BibTeX]
Artikel in Tagungsbänden
The Courseware Watchdog: an Ontology-based tool for finding and organizing
learning material.
In: K. David und L. Wegner
(Herausgeber):
Mobiles Lernen und Forschen - Beiträge der Fachtagung an der Universität, Seiten 93-104.
Kassel University Press, 2003.
Julien Tane, Christoph Schmitz, Gerd Stumme, Steffen Staab und R. Studer.
[doi]
[Kurzfassung]
[BibTeX]
Topics in education are changing with an ever faster pace. E-Learning
resources tend to be more and more decentralised. Users need increasingly to be able to
use the resources of the web. For this, they should have tools for finding and organizing
information in a decentral way. In this, paper, we show how an ontology-based tool
suite allows to make the most of the resources available on the web.
Buchbeiträge
Text Mining Scientific Papers: A Survey on FCA-Based Information Retrieval Research.
In:
P. Perner (Herausgeber):
Advances in Data Mining. Applications and Theoretical Aspects, Seiten 273-287.
Springer Berlin Heidelberg, 2012.
Jonas Poelmans, DmitryI. Ignatov, Stijn Viaene, Guido Dedene und SergeiO. Kuznetsov.
[doi]
[Kurzfassung]
[BibTeX]
Formal Concept Analysis (FCA) is an unsupervised clustering technique and many scientific papers are devoted to applying FCA in Information Retrieval (IR) research. We collected 103 papers published between 2003-2009 which mention FCA and information retrieval in the abstract, title or keywords. Using a prototype of our FCA-based toolset CORDIET, we converted the pdf-files containing the papers to plain text, indexed them with Lucene using a thesaurus containing terms related to FCA research and then created the concept lattice shown in this paper. We visualized, analyzed and explored the literature with concept lattices and discovered multiple interesting research streams in IR of which we give an extensive overview. The core contributions of this paper are the innovative application of FCA to the text mining of scientific papers and the survey of the FCA-based IR research.
Technische Berichte
Text Clustering Based on Background Knowledge.
Technical Report , University of Karlsruhe, Institute AIFB, 2003.
Andreas Hotho, Steffen Staab und Gerd Stumme.
[doi]
[Kurzfassung]
[BibTeX]
Text document clustering plays an important role in providing intuitive
navigation and browsing mechanisms by organizing large amounts of information
into a small number of meaningful clusters. Standard partitional or agglomerative
clustering methods efficiently compute results to this end.
However, the bag of words representation used for these clustering methods is often
unsatisfactory as it ignores relationships between important terms that do not
co-occur literally. Also, it is mostly left to the user to find out why a particular partitioning
has been achieved, because it is only specified extensionally. In order to
deal with the two problems, we integrate background knowledge into the process of
clustering text documents.
First, we preprocess the texts, enriching their representations by background knowledge
provided in a core ontology — in our application Wordnet. Then, we cluster
the documents by a partitional algorithm. Our experimental evaluation on Reuters
newsfeeds compares clustering results with pre-categorizations of news. In the experiments,
improvements of results by background knowledge compared to the baseline
can be shown for many interesting tasks.
Second, the clustering partitions the large number of documents to a relatively small
number of clusters, which may then be analyzed by conceptual clustering. In our approach,
we applied Formal Concept Analysis. Conceptual clustering techniques are
known to be too slow for directly clustering several hundreds of documents, but they
give an intensional account of cluster results. They allow for a concise description
of commonalities and distinctions of different clusters. With background knowledge
they even find abstractions like “food” (vs. specializations like “beef” or “corn”).
Thus, in our approach, partitional clustering reduces first the size of the problem
such that it becomes tractable for conceptual clustering, which then facilitates the
understanding of the results.
Artikel in Tagungsbänden
Set-oriented mining for association rules in relational databases.
In:
Proceedings of the 11th International Conference on Data Engineering
(ICDE'95), Seiten 25-33.
IEEE Computer Society Press, 1995.
M. Houtsma und A. Swami.
[BibTeX]
Semantic resource management for the web: an e-learning application.
In:
Proc. 13th International World Wide Web Conference (WWW 2004), Seiten 1-10.
2004.
Julien Tane, Christoph Schmitz und Gerd Stumme.
[doi]
[BibTeX]
Reverse Pivoting in Conceptual Information Systems..
In: H. Delugach und G. Stumme
(Herausgeber):
Conceptual Structures: Broadening the Base. , Band 2120, Reihe LNAI, Seiten 202-215.
Springer, Heidelberg, 2001.
J. Hereth und G. Stumme.
[doi]
[BibTeX]
Reverse Pivoting in Conceptual Information Systems.
In: H. S. Delugach und G. Stumme
(Herausgeber):
Conceptual Structures: Broadening the Base, Band 2120, Reihe Lecture Notes in Computer Science, Seiten 202-215.
Springer, 2001.
J. Hereth und G. Stumme.
[BibTeX]
Relational Scaling and Databases.
In: U. Priss, D. Corbett und G. Angelova
(Herausgeber):
Conceptual Structures: Integration and Interfaces, 10th International
Conference on Conceptual Structures, ICCS 2002, Borovets, Bulgaria,
July 15-19, 2002, Proceedings, Band 2393, Reihe Lecture Notes in Computer Science, Seiten 62-76.
Springer, 2002.
J. Hereth.
[BibTeX]
Publication Analysis of the Formal Concept Analysis Community.
In: F. Domenach, D. Ignatov und J. Poelmans
(Herausgeber):
ICFCA 2012, Band 7278, Reihe Lecture Notes in Artificial Intelligence, Seiten 77-95.
Springer, Berlin/Heidelberg, 2012.
Stephan Doerfel, Robert Jäschke und Gerd Stumme.
[doi]
[Kurzfassung]
[BibTeX]
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.
Plädoyer für eine philosophische Grundlegung der Begrifflichen Wissensverarbeitung.
In: R. Wille und M. Zickwolff
(Herausgeber):
Begriffliche Wissensverarbeitung - Grundfragen und Aufgaben, Seiten 11-25.
B. I. -Wissenschaftsverlag, Mannheim, 1994.
Rudolf Wille.
[BibTeX]
Sonstiges
Philosophisches W�rterbuch.
1976.
W. Brugger.
[BibTeX]
Artikel in Tagungsbänden
On-Line Analytical Processing with Conceptual Information Systems.
In: K. Tanaka und S. Ghandeharizadeh
(Herausgeber):
Proc. 5th Intl. Conf. on Foundations of Data Organization (FODO'98), Seiten 117-126.
1998.
Short version of testumme00conceptual
Gerd Stumme.
[doi]
[BibTeX]
Mining non-derivable association rules.
In:
Proc. SIAM International Conference on Data Mining.
Newport Beach, CA, 2005.
Bart Goethals, Juhu Muhonen und Hannu Toivonen.
[BibTeX]
Sonstiges
Mining knowledge in geographical data.
1998. Technical Report. ftp://ftp.fas.sfu.ca/pub/cs/han/ kdd/geosurvey98.ps.
K. Koperski, J. Han und J. Adhikary.
[BibTeX]
Artikel in Tagungsbänden
Mining frequent patterns without candidate generation..
In:
Proc. ACM SIGMOD Int'l Conf. on Management of Data, Seiten 1-12.
2000.
J. Han, J. Pei und Y. Yin.
[BibTeX]
Mining Association Rules in Folksonomies.
In: V. Batagelj, H.-H. Bock, A. Ferligoj und A. Žiberna
(Herausgeber):
Data Science and Classification. Proceedings of the 10th IFCS Conf., Reihe Studies in Classification, Data Analysis, and Knowledge Organization, Seiten 261-270.
Springer, Heidelberg, 2006.
Christoph Schmitz, Andreas Hotho, Robert Jäschke und Gerd Stumme.
[doi]
[Kurzfassung]
[BibTeX]
Social bookmark tools are rapidly emerging on the Web. In such
systems users are setting up lightweight conceptual structures
called folksonomies. These systems provide currently relatively few
structure. We discuss in this paper, how association rule mining
can be adopted to analyze and structure folksonomies, and how the results can be used
for ontology learning and supporting emergent semantics. We
demonstrate our approach on a large scale dataset stemming from an
online system.
Mining All Non-derivable Frequent Itemsets.
In:
PKDD '02: Proceedings of the 6th European Conference on Principles
of Data Mining and Knowledge Discovery, Seiten 74-85.
Springer-Verlag, London, UK, 2002.
Toon Calders und Bart Goethals.
[BibTeX]
Metarule-guided mining of multi-dimensional association rules using
data cubes..
In:
Proc. of the 3rd KDD Int'l Conf..
1997.
M. Kamber, J. Han und Y. Chiang.
[BibTeX]
Sonstiges
Magier oder Magister? �ber die Einheit der Wissenschaft im Verst�ndigungsprozess.
1974.
Hartmut von Hentig.
[BibTeX]
Artikel in Tagungsbänden
MAFIA: A maximal frequent itemset algorithm for transactional databases.
In:
Proc. of the 17th Int. Conf. on Data Engineering.
IEEE Computer Society, 2001.
D. Burdick, M. Calimlim und J. Gehrke.
[BibTeX]
Lattices of Triadic Concept Graphs.
In: B. Ganter und G. W. Mineau
(Herausgeber):
Conceptual Structures: Logical, Linguistic, and Computational Issues, Band 1867, Reihe Lecture Notes in Computer Science, Seiten 332-341.
Springer, 2000.
B. Groh und R. Wille.
[BibTeX]
Sonstiges
LaTeX: A Document Preparation System.
1986.
Leslie Lamport.
[BibTeX]
Artikel in Tagungsbänden
Knowledge discovery in textual databases.
In:
Proceedings of the 1st international conference on Knowledge Discovery
and Data mining (KDD'95), Seiten 112-117.
AAAI Press, 1995.
R. Feldman und I. Dagan.
[BibTeX]
Knowledge discovery in databases : An attribute oriented approach.
In:
Proceedings of the 18th international conference on Very Large Data
Bases (VLDB'92), Seiten 547-559.
Morgan Kaufmann, 1992.
J. Han, Y. Cai und N. Cercone.
[BibTeX]
Knowledge discovery from telecommunication network alarm databases.
In:
Proceedings of the 12th International Conference on Data Engineering
(ICDE'96), Seiten 115-122.
IEEE Computer Society Press, 1996.
K. H�t�nen, M. Klemettinen, H. Mannila, P. Ronkainen und H. Toivonen.
[BibTeX]
Knowledge discovery and data mining : Towards a unifying framework.
In:
Proceedings of the 2nd international conference on Knowledge Discovery
and Data mining (KDD'96), Seiten 82-88.
AAAI Press, 1996.
U. M. Fayyad, G. Piatetsky-Shapiro und P. Smyth.
[BibTeX]
Artikel in Zeitschriften
Knowledge acquisition via incremental conceptual clustering.
Machine Learning, 2(2):139-172, 1987.
D. H. Fisher.
[BibTeX]
Sonstiges
IT Baseline Protection Manual.
http://www.bsi.de/gshb/. 2003.
German Federal Office for Information Security.
[BibTeX]
Artikel in Tagungsbänden
Information Retrieval in Folksonomies: Search and Ranking.
In:
Proceedings of the 3rd European Semantic Web Conference, Reihe Lecture Notes in Computer Science, Seiten 411-426.
Springer, 2006.
Andreas Hotho, Robert Jäschke, Christoph Schmitz und Gerd Stumme.
[BibTeX]
Artikel in Zeitschriften
Incremental concept formation algorithms based on Galois
(concept) lattices.
Computational Intelligence, 11(2):246-267, 1995.
R. Godin, R. Missaoui und H. Alaoui.
[BibTeX]
Artikel in Tagungsbänden
Implementing data cubes efficiently.
In:
Proceedings of the 1996 ACM SIGMOD international conference on Management
of Data (SIGMOD'96), Seiten 205-216.
ACM Press, 1996.
V. Harinarayan, A. Rajaraman und J. D. Ullman.
[BibTeX]
Iceberg Query Lattices for Datalog.
In: K. E. Wolff, H. D. Pfeiffer und H. S. Delugach
(Herausgeber):
Conceptual Structures at Work: 12th International Conference on Conceptual Structures (ICCS 2004), Band 3127, Reihe LNCS, Seiten 109-125.
Springer, Heidelberg, 2004.
Gerd Stumme.
[doi]
[BibTeX]
GeoMiner : A system prototype for spatial data mining.
In:
Proceedings of the 1997 ACM SIGMOD international conference on Management
of Data (SIGMOD'97), Seiten 553-556.
ACM Press, 1997.
J. Han, K. Koperski und N. Stefanovic.
[BibTeX]
Buchbeiträge
From data mining to knowledge discovery : An overview.
In:
U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth und R. Uthurusamy (Herausgeber):
Advances in Knowledge Discovery and Data Mining, Seiten 1-30.
AAAI Press, 1996.
U. M. Fayyad, G. Piatetsky-Shapiro und P. Smyth.
[BibTeX]
Sonstiges
Formal Concept Analysis: Mathematical foundations.
1999.
B. Ganter und R. Wille.
[BibTeX]
Formal Concept Analysis: Mathematical Foundations.
1999. Translation of: itFormale Begriffsanalyse: Mathematische
Grundlagen. Springer, Heidelberg 1996..
B. Ganter und R. Wille.
[BibTeX]
Tagungsbände
Formal Concept Analysis: Foundations and Applications.
LNAI. Band 3626.
Springer, Heidelberg, 2005.
http://www.informatik.uni-trier.de/~ley/db/conf/fca/fca2005.html.
B. Ganter, G. Stumme und R. Wille.
[doi]
[BibTeX]
Technische Berichte
Formal concept analysis with ConImp : Introduction to the
basic features.
Technische Hochschule Darmstadt, 1998. http://www.mathematik.tu-darmstadt.de/~burmeister/ConImpIntro.ps.
P. Burmeister.
[BibTeX]
Artikel in Tagungsbänden
Formal Concept Analysis on its Way from Mathematics to Computer Science.
In: U. Priss, D. Corbett und G. Angelova
(Herausgeber):
Conceptual Structures: Integration and Interfaces , Band 2393, Reihe LNAI, Seiten 2-19.
Springer, Heidelberg, 2002.
Invited Talk, summary of testumme03offtonew
G. Stumme.
[doi]
[BibTeX]
Finding interesting rules from large sets of discovered association
rules.
In:
Proceedings of the 3rd international Conference on Information and
Knowledge Management (CIKM'94), Seiten 401-407.
ACM Press, 1994.
M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen und A. I. Verkamo.
[BibTeX]
Artikel in Zeitschriften
Finding all closed sets : A general approach.
Order, 8:283-290, 1991.
B. Ganter und K. Reuter.
[BibTeX]
Dissertation
Fast algorithms for discovering the maximum frequent sets.
Doktorarbeit, University of New York, 1998.
D. Lin.
[BibTeX]
Buchbeiträge
Exploration of the power of attribute oriented induction in data
mining.
In:
U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth und R. Uthurusamy (Herausgeber):
Advances in Knowledge Discovery and Data Mining, Seiten 399-421.
AAAI Press, 1996.
J. Han und Y. Fu.
[BibTeX]
Dissertation
Enhancements to the data mining process.
Doktorarbeit, University of Stanford, 1997.
G. H. John.
[BibTeX]
Artikel in Tagungsbänden
Découverte de r�gles pertinentes dans les bases de donn�es.
In:
Actes des 14�mes journ�es Bases de Donn�es Avanc�es (BDA'98), Seiten 197-211.
1998.
A. Fayet, A. Giacometti, D. Laurent und N. Spyratos.
[BibTeX]
Dynamic itemset counting and implication rules for market basket
data.
In:
Proceedings of the 1997 ACM SIGMOD international conference on Management
of Data (SIGMOD'97), Seiten 255-264.
ACM Press, 1997.
S. Brin, R. Motwani, J. D. Ullman und S. Tsur.
[BibTeX]
Artikel in Zeitschriften
Document Retrieval for Email Search and Discovery using Formal Concept Analysis.
Journal of Applied Artificial Intelligence (AAI), 17(3):257-280, 2003.
Richard J. Cole, Peter W. Eklund und Gerd Stumme.
[doi]
[Kurzfassung]
[BibTeX]
This paper discusses an document discovery tool based on
conceptual clustering by formal concept analysis. The program
allows users to navigate email using a visual lattice metaphor
rather than a tree. It implements a virtual file structure over
email where files and entire directories can appear in multiple
positions. The content and shape of the lattice formed by the
conceptual ontology can assist in email discovery. The system
described provides more flexibility in retrieving stored emails
than what is normally available in email clients. The paper
discusses how conceptual ontologies can leverage traditional
document retrieval systems and aid knowledge discovery in document
collections.
Artikel in Tagungsbänden
Discovery of spatial association rules in geographic information
databases.
In:
Proceedings of the 4th international Symposium on advances in Spatial
Databases (SSD'95), Reihe Lecture Notes in Computer Science, Vol. 951, Seiten 47-66.
Springer-Verlag, 1995.
K. Koperski und J. Han.
[BibTeX]
Discovery of multiple-level association rules from large databases.
In:
Proceedings of the 21st international conference on Very Large Data
Bases (VLDB'95), Seiten 420-431.
Morgan Kaufmann, 1995.
J. Han und Y. Fu.
[BibTeX]
Discovering trends in text databases.
In:
Proceedings of the 3rd international conference on Knowledge Discovery
and Data mining (KDD'97), Seiten 227-230.
AAAI Press, 1997.
B. Lent, R. Agrawal und R. Srikant.
[BibTeX]
Artikel in Zeitschriften
Discovering Shared Conceptualizations in Folksonomies.
Journal of Web Semantics, 6(1):38-53, 2008.
Robert Jäschke, Andreas Hotho, Christoph Schmitz, Bernhard Ganter und Gerd Stumme.
[doi]
[BibTeX]
Artikel in Tagungsbänden
Discovering all most specific sentences by randomized algorithms.
In:
Proceedings of the 6th biennial International Conference on Database
Theory (ICDT'97), Reihe Lecture Notes in Computer Science, Vol. 1186, Seiten 215-229.
Springer-Verlag, 1997.
D. Gunopulos, H. Mannila und S. Saluja.
[BibTeX]
Artikel in Zeitschriften
Design of class hierarchies based on concept (Galois) lattices..
TAPOS, 4(2):117-134, 1998.
R. Godin, H. Mili, G. Mineau, R. Missaoui, A. Arfi und T. Chau.
[BibTeX]
Artikel in Tagungsbänden
DBMiner : A system for mining knowledge in large relational
databases.
In:
Proceedings of the 2nd international conference on Knowledge Discovery
and Data mining (KDD'96), Seiten 250-255.
AAAI Press, 1996.
J. Han, Y. Fu, W. Wang, J. Chiang, W. Gong, K. Koperski, D. Li, Y. Lu, A. Rajan, N. Stefanovic, B. Xia und O. R. Zaïane.
[BibTeX]
DBMiner : A system for data mining in relational databases
and data warehouses.
In:
Proceedings of the 1997 GASCON metting of minds (GASCON'97), Seiten 249-260.
1997.
ftp://ftp.fas.sfu.ca/pub/cs/han/kdd/cascon97.ps
J. Han, J. Chiang, S. Chee, J. Chen, Q. Chen, S. Cheng, W. Gong, M. Kamber, K. Koperski G. Liu, Y. Lu, N. Stefanovic, L. Winstone, B. Xia, O. R. Zaïane, S. Zhang und H. Zhu.
[BibTeX]
Sonstiges
Data: Mining: Concepts and Techniques.
2002.
J. Han und M. Kamber.
[BibTeX]
Artikel in Zeitschriften
Data-driven discovery of quantitative rules in relational databases.
IEEE Transansaction on Knowledge and Data Engineering, 5(1):29-40, 1993.
J. Han, Y. Cai und N. Cercone.
[BibTeX]
Sonstiges
Data Mining: Concepts and Techniques.
2000.
J. Han und M. Kamber.
[BibTeX]
Dissertation
Data Mining: algorithmes par niveau, techniques d'implementation
et applications.
Doktorarbeit, Université de Clermont-Ferrand II, 2000.
Y. Bastide.
[BibTeX]
Artikel in Tagungsbänden
Data mining, hypergraph transversals, and machine learning.
In:
Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART symposium on Principles
of Database Systems (PODS'97), Seiten 209-216.
ACM Press, 1997.
D. Gunopulos, R. Khardon, H. Mannila und H. Toivonen.
[BibTeX]
Creation and Merging of Ontology Top-Levels.
In: A. de Moor, W. Lex und B. Ganter
(Herausgeber):
Conceptual Structures for Knowledge Creation and Communication., Band 2746, Reihe LNAI, Seiten 131-145.
Springer, Heidelberg, 2003.
Bernhard Ganter und Gerd Stumme.
[doi]
[Kurzfassung]
[BibTeX]
We provide a new method for systematically structuring the top-down level of ontologies.
It is based on an interactive, top--down knowledge acquisition
process, which assures that the knowledge engineer
considers all possible cases while avoiding redundant acquisition.
The method is suited especially for creating/merging the top
part(s) of the ontologies, where high accuracy is required, and for supporting the merging of two (or more) ontologies on that level.
Artikel in Zeitschriften
Creating a Web Analysis and Visualization Environment.
Computer Networks and ISDN Systems, 28(1&):109-117, 1995.
Robert E. Kent und Christian Neuss.
[doi]
[BibTeX]
Tagungsbände
Contributions to ICCS 2005.
kassel university press, Kassel, 2005.
Frithjof Dau, Marie-Laure Mugnier und Gerd Stumme.
[doi]
[BibTeX]
Artikel in Tagungsbänden
Concise Representation of Frequent Patterns Based on Disjunction-Free
Generators.
In:
ICDM '01: Proceedings of the 2001 IEEE International Conference on
Data Mining, Seiten 305-312.
IEEE Computer Society, Washington, DC, USA, 2001.
Marzena Kryszkiewicz.
[BibTeX]
Tagungsbände
Conceptual Structures: Common Semantics for Sharing Knowledge, 13th International Conference on Conceptual Structures, ICCS 2005, Kassel, Germany, July 17-22, 2005, Proceedings.
Lecture Notes in Computer Science. Band 3596.
Springer, 2005.
Frithjof Dau, Marie-Laure Mugnier und Gerd Stumme.
[doi]
[BibTeX]
Conceptual Structures - Broadening the Base. Proc. 9th International Conference on Conceptual Structures.
LNAI. Band 2120.
Springer, Heidelberg, 2001.
H. Delugach und G. Stumme.
[BibTeX]
Artikel in Tagungsbänden
Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies.
In: P. Eklund
(Herausgeber):
Concept Lattices, Band 2961, Reihe LNAI, Seiten 189-207.
Springer, Heidelberg, 2004.
Philipp Cimiano, Andreas Hotho, Gerd Stumme und Julien Tane.
[doi]
[Kurzfassung]
[BibTeX]
Among many other knowledge representations formalisms, Ontologies
and Formal Concept Analysis (FCA) aim at modeling 'concepts'. We
discuss how these two formalisms may complement another from an
application point of view. In particular, we will see how FCA can
be used to support Ontology Engineering, and how ontologies can be
exploited in FCA applications. The interplay of FCA and ontologies
is studied along the life cycle of an ontology:
(i) FCA can support the building of the ontology as a
learning technique.
(ii) The established ontology can be analyzed and navigated by
using techniques of FCA.
(iii) Last but not least, the ontology may be used to improve an FCA
application.
Buchbeiträge
Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies.
In:
P. Eklund (Herausgeber):
Concept Lattices, Seiten 189-207.
Springer, Berlin/Heidelberg, 2004.
Philipp Cimiano, Andreas Hotho, Gerd Stumme und Julien Tane.
[doi]
[BibTeX]
Artikel in Zeitschriften
Conceptual Knowledge Discovery - a Human-Centered Approach.
Journal of Applied Artificial Intelligence (AAI), 17(3):281-301, 2003.
Joachim Hereth, Gerd Stumme, Rudolf Wille und Uta Wille.
[doi]
[Kurzfassung]
[BibTeX]
In this paper we discuss Conceptual Knowledge Discovery in Databases (CKDD) as it is developing in the field of Conceptual Knowledge
Processing. Conceptual Knowledge
Processing is based on the mathematical theory of Formal Concept
Analysis which has become a successful theory for data analysis during
the last two decades. CKDD aims to support a human-centered process
of discovering knowledge from data by visualizing and analyzing
the conceptual structure of the data. We dicuss how the
management system TOSCANA for conceptual information systems
supports CKDD, and illustrate it by two applications in database
marketing and flight movement analysis. Finally, we present a
new tool for conceptual deviation discovery, Chianti.
Artikel in Tagungsbänden
Conceptual Information Systems Discussed Through an IT-Security Tool.
In: R. Dieng und O. Corby
(Herausgeber):
Knowledge Engineering and Knowledge Management. Methods, Models, and Tools., Band 1937, Reihe LNAI, Seiten 352-365.
Springer, Heidelberg, 2000.
K. Becker, G. Stumme, R. Wille, U. Wille und M. Zickwolff.
[doi]
[BibTeX]
Artikel in Zeitschriften
Computing iceberg concept lattices with TITANIC.
Data & Knowledge Engineering, 42(2):189-222, 2002.
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier und Lotfi Lakhal.
[doi]
[Kurzfassung]
[BibTeX]
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.
Comparing performance of algorithms for generating concept lattices.
Journal of Experimental and Theoretical Artificial Intelligence, 14:189-216, 2002.
S. Kuznetsov und S. Obiedkov.
[doi]
[BibTeX]
Sonstiges
Collaborative tagging as a tripartite network.
2005. ttarXiv:cs.DS/0512090.
R. Lambiotte und M. Ausloos.
[doi]
[Kurzfassung]
[BibTeX]
We describe online collaborative communities by tripartite networks,
the nodes being persons, items and tags. We introduce projection
methods in order to uncover the structures of the networks, i.e.
communities of users, genre families... <br />To do so, we focus
on the correlations between the nodes, depending on their profiles,
and use percolation techniques that consist in removing less correlated
links and observing the shaping of disconnected islands. The structuring
of the network is visualised by using a tree representation. The
notion of diversity in the system is also discussed.
Sonstiges
Classification and regression trees.
1984.
L. Breiman, J. H. Friedman, R. A. Olshen und C. J. Stone.
[BibTeX]
Artikel in Tagungsbänden
Bitmap based algorithms for mining association rules.
In:
Actes des 14�mes journ�es Bases de Donn�es Avanc�es (BDA'98), Seiten 157-175.
1998.
G. Gardarin, P. Pucheral und F. Wu.
[BibTeX]
BibSonomy: A Social Bookmark and Publication Sharing System.
In:
Proc. of the ICCS 2006 Conceptual Structures Tool Interoperability
Workshop.
2006.
(to appear)
Andreas Hotho, Robert Jäschke, Christoph Schmitz und Gerd Stumme.
[BibTeX]
BibSonomy: A Social Bookmark and Publication Sharing System.
In: A. de Moor, S. Polovina und H. Delugach
(Herausgeber):
Proceedings of the First Conceptual Structures Tool Interoperability Workshop at the 14th International Conference on Conceptual Structures, Seiten 87-102.
Aalborg Universitetsforlag, Aalborg, 2006.
Andreas Hotho, Robert Jäschke, Christoph Schmitz und Gerd Stumme.
[doi]
[Kurzfassung]
[BibTeX]
Social bookmark tools are rapidly emerging on the Web. In such
systems users are setting up lightweight conceptual structures
called folksonomies. The reason for their immediate success is the
fact that no specific skills are needed for participating. In this
paper we specify a formal model for folksonomies and briefly describe
our own system BibSonomy, which allows for sharing both bookmarks
and publication references in a kind of personal library.
Beyond market baskets: Generalizing association rules to correlation.
In:
Proceedings of the 1997 ACM SIGMOD international conference on Management
of Data (SIGMOD'97), Seiten 265-276.
ACM Press, 1997.
S. Brin, R. Motwani und C. Silverstein.
[BibTeX]
Buchbeiträge
Bayesian networks for knowledge discovery.
In:
U. Fayyad, G. Piatetsky-Shapiro, P. Smyth und R. Uthurusamy (Herausgeber):
Advances in Knowledge Discovery and Data Mining, Seiten 273-305.
AAAI Press, 1996.
D. Heckerman.
[BibTeX]
Artikel in Tagungsbänden
Attribute Exploration on the Web.
In: P. Cellier, F. Distel und B. Ganter
(Herausgeber):
Contributions to the 11th International Conference on Formal Concept Analysis, Seiten 19-34.
2013.
Robert Jäschke und Sebastian Rudolph.
[doi]
[Kurzfassung]
[BibTeX]
We propose an approach for supporting attribute exploration by web information retrieval, in particular by posing appropriate queries to search engines, crowd sourcing systems, and the linked open data cloud. We discuss underlying general assumptions for this to work and the degree to which these can be taken for granted.
Approximation of Frequency Queries by Means of Free-Sets.
In:
PKDD '00: Proceedings of the 4th European Conference on Principles
of Data Mining and Knowledge Discovery, Seiten 75-85.
Springer-Verlag, London, UK, 2000.
Jean-Francois Boulicaut, Artur Bykowski und Christophe Rigotti.
[BibTeX]
Artikel in Zeitschriften
An incremental concept formation approach for learning from databases.
Theoretical Computer Science : Special issue on formal methods in
databases and software engineering, 133(2):387-419, 1994.
R. Godin und R. Missaoui.
[BibTeX]
Artikel in Tagungsbänden
Aggregate-query processing in data warehousing environments.
In:
Proceedings of the 21st international conference on Very Large Data
Bases (VLDB'95), Seiten 358-369.
Morgan Kaufmann, 1995.
A. Gupta, V. Harinarayan und D. Quass.
[BibTeX]
Tagungsbände
Advances in Formal Concept Analysis for Knowledge Discovery in Databases. Proc. Workshop FCAKDD of the 15th European
Conference on Artificial Intelligence (ECAI 2002).
Lyon, France, 2002.
V. Duquenne, B. Ganter, M. Liquiere, E. M. Nguifo und G. Stumme.
[doi]
[BibTeX]
Artikel in Tagungsbänden
A Logical Generalization of Formal Concept Analysis.
In: G. Mineau und B. Ganter
(Herausgeber):
Int. Conf. Conceptual Structures, Reihe LNCS 1867, Seiten 371-384.
Springer, 2000.
S. Ferr� und O. Ridoux.
[Kurzfassung]
[BibTeX]
We propose a generalization of Formal Concept Analysis (FCA) in which
sets of attributes are replaced by expressions of an almost arbitrary
logic. We prove that all FCA can be reconstructed on this basis.
We show that from any logic that is used in place of sets of attributes
can be derived a contextualized logic that takes into account the
formal context and that is isomorphic to the concept lattice. We
then justify the generalization of FCA compared with existing extensions
and in the perspective of its application to information systems.
Artikel in Zeitschriften
A lattice conceptual clustering system and its application to browsing retrieval.
Machine Learning, 24(2):95-122, 1996.
Claudio Carpineto und Giovanni Romano.
[doi]
[Kurzfassung]
[BibTeX]
The theory of concept (or Galois) lattices provides a simple and formal approach to conceptual clustering. In this paper we present GALOIS, a system that automates and applies this theory. The algorithm utilized by GALOIS to build a concept lattice is incremental and efficient, each update being done in time at most quadratic in the number of objects in the lattice. Also, the algorithm may incorporate background information into the lattice, and through clustering, extend the scope of the theory. The application we present is concerned with information retrieval via browsing, for which we argue that concept lattices may represent major support structures. We describe a prototype user interface for browsing through the concept lattice of a document-term relation, possibly enriched with a thesaurus of terms. An experimental evaluation of the system performed on a medium-sized bibliographic database shows good retrieval performance and a significant improvement after the introduction of background knowledge.
ER -
Artikel in Tagungsbänden
A Finite State Model for On-Line Analytical Processing in
Triadic Contexts.
In: B. Ganter und R. Godin
(Herausgeber):
Proc. 3rd Intl. Conf. on Formal Concept Analysis, Band 3403, Reihe Lecture Notes in Computer Science, Seiten 315-328.
Springer, Heidelberg, 2005.
Gerd Stumme.
[doi]
[BibTeX]
A data-mining methodology and its application to semi-automatic knowledge
acquisition.
In:
Proceedings of the 8th international conference on Database and Expert
systems Applications (DEXA'97), Reihe Lecture Notes in Computer Science, Vol. 1308, Seiten 670-677.
Springer-Verlag, 1997.
M. Klemettinen, H. Mannila und H. Toivonen.
[BibTeX]
A condensed representation to find frequent patterns..
In:
PODS.
2001.
Artur Bykowski und Christophe Rigotti.
[doi]
[BibTeX]