Author | Title | Year | Journal/Proceedings | Reftype | DOI/URL |
---|---|---|---|---|---|
Keim, D. & Kriegel, H. | Visualization techniques for mining large databases : A comparison [BibTeX] |
1996 | IEEE Transactions on Knowledge and Data Engineering Vol. 8(6), pp. 923-938 |
article | |
BibTeX:
@article{Keim96, author = {Keim, D. and Kriegel, H.}, title = {Visualization techniques for mining large databases : A comparison}, journal = {IEEE Transactions on Knowledge and Data Engineering}, publisher = {IEEE Computer Society Press}, year = {1996}, volume = {8}, number = {6}, pages = {923--938} } |
|||||
Stumme, G. | Using Ontologies and Formal Concept Analysis for Organizing Business Knowledge [BibTeX] |
2002 | Wissensmanagement mit Referenzmodellen -- Konzepte für die Anwendungssystem- und Organisationsgestaltung, pp. 163-174 | incollection | URL |
BibTeX:
@incollection{stumme02using, author = {Stumme, G.}, title = {Using Ontologies and Formal Concept Analysis for Organizing Business Knowledge}, booktitle = {Wissensmanagement mit Referenzmodellen -- Konzepte für die Anwendungssystem- und Organisationsgestaltung}, publisher = {Physica}, year = {2002}, pages = {163-174}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2001/REFMOD01.ps} } |
|||||
Habermas, J. | Theorie des kommunikativen Handelns [BibTeX] |
1981 | book | ||
BibTeX:
@book{habermas81theorie, author = {Habermas, J�rgen}, title = {Theorie des kommunikativen Handelns}, publisher = {Suhrkamp}, year = {1981} } |
|||||
Golder, S. & Huberman, B.A. | The Structure of Collaborative Tagging Systems [BibTeX] |
2005 | techreport | URL | |
BibTeX:
@techreport{GH05structure, author = {Golder, Scott and Huberman, Bernardo A.}, title = {The Structure of Collaborative Tagging Systems}, year = {2005}, url = {http://arxiv.org/abs/cs.DL/0508082} } |
|||||
Tane, J., Schmitz, C., Stumme, G., Staab, S. & Studer, R. | The Courseware Watchdog: an Ontology-based tool for finding and organizing learning material | 2003 | Mobiles Lernen und Forschen - Beiträge der Fachtagung an der Universität, pp. 93-104 | inproceedings | URL |
Abstract: Topics in education are changing with an ever faster pace. E-Learning
sources tend to be more and more decentralised. Users need increasingly to be able to e the resources of the web. For this, they should have tools for finding and organizing formation in a decentral way. In this, paper, we show how an ontology-based tool ite allows to make the most of the resources available on the web. |
|||||
BibTeX:
@inproceedings{tane03courseware, author = {Tane, Julien and Schmitz, Christoph and Stumme, Gerd and Staab, Steffen and Studer, R.}, title = {The Courseware Watchdog: an Ontology-based tool for finding and organizing |
|||||
Poelmans, J., Ignatov, D., Viaene, S., Dedene, G. & Kuznetsov, S. | Text Mining Scientific Papers: A Survey on FCA-Based Information Retrieval Research | 2012 | Vol. 7377Advances in Data Mining. Applications and Theoretical Aspects, pp. 273-287 |
incollection | DOI URL |
Abstract: 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. | |||||
BibTeX:
@incollection{noKey, author = {Poelmans, Jonas and Ignatov, DmitryI. and Viaene, Stijn and Dedene, Guido and Kuznetsov, SergeiO.}, title = {Text Mining Scientific Papers: A Survey on FCA-Based Information Retrieval Research}, booktitle = {Advances in Data Mining. Applications and Theoretical Aspects}, publisher = {Springer Berlin Heidelberg}, year = {2012}, volume = {7377}, pages = {273-287}, url = {http://dx.doi.org/10.1007/978-3-642-31488-9_22}, doi = {http://dx.doi.org/10.1007/978-3-642-31488-9_22} } |
|||||
Hotho, A., Staab, S. & Stumme, G. | Text Clustering Based on Background Knowledge | 2003 | Vol. 425 |
techreport | URL |
Abstract: Text document clustering plays an important role in providing intuitive
vigation and browsing mechanisms by organizing large amounts of information to a small number of meaningful clusters. Standard partitional or agglomerative ustering methods efficiently compute results to this end. wever, the bag of words representation used for these clustering methods is often satisfactory as it ignores relationships between important terms that do not -occur literally. Also, it is mostly left to the user to find out why a particular partitioning s been achieved, because it is only specified extensionally. In order to al with the two problems, we integrate background knowledge into the process of ustering text documents. rst, we preprocess the texts, enriching their representations by background knowledge ovided in a core ontology — in our application Wordnet. Then, we cluster e documents by a partitional algorithm. Our experimental evaluation on Reuters wsfeeds compares clustering results with pre-categorizations of news. In the experiments, provements of results by background knowledge compared to the baseline n be shown for many interesting tasks. cond, the clustering partitions the large number of documents to a relatively small mber of clusters, which may then be analyzed by conceptual clustering. In our approach, applied Formal Concept Analysis. Conceptual clustering techniques are own to be too slow for directly clustering several hundreds of documents, but they ve an intensional account of cluster results. They allow for a concise description commonalities and distinctions of different clusters. With background knowledge ey even find abstractions like “food” (vs. specializations like “beef” or “corn”). us, in our approach, partitional clustering reduces first the size of the problem ch that it becomes tractable for conceptual clustering, which then facilitates the derstanding of the results. |
|||||
BibTeX:
@techreport{hotho03textclustering, author = {Hotho, Andreas and Staab, Steffen and Stumme, Gerd}, title = {Text Clustering Based on Background Knowledge}, year = {2003}, volume = {425}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2003/hotho2003text.pdf} } |
|||||
Houtsma, M. & Swami, A. | Set-oriented mining for association rules in relational databases [BibTeX] |
1995 | Proceedings of the 11th International Conference on Data Engineering
(ICDE'95), pp. 25-33 |
inproceedings | |
BibTeX:
@inproceedings{Houtsma95, author = {Houtsma, M. and Swami, A.}, title = {Set-oriented mining for association rules in relational databases}, booktitle = {Proceedings of the 11th International Conference on Data Engineering |
|||||
Tane, J., Schmitz, C. & Stumme, G. | Semantic resource management for the web: an e-learning application [BibTeX] |
2004 | Proc. 13th International World Wide Web Conference (WWW 2004), pp. 1-10 | inproceedings | URL |
BibTeX:
@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} } |
|||||
Hereth, J. & Stumme, G. | Reverse Pivoting in Conceptual Information Systems. [BibTeX] |
2001 | Vol. 2120Conceptual Structures: Broadening the Base. , pp. 202-215 |
inproceedings | URL |
BibTeX:
@inproceedings{hereth01reverse, author = {Hereth, J. and Stumme, G.}, title = {Reverse Pivoting in Conceptual Information Systems.}, booktitle = {Conceptual Structures: Broadening the Base. }, publisher = {Springer}, year = {2001}, volume = {2120}, pages = {202-215}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2001/ICCS01.pdf} } |
|||||
Hereth, J. & Stumme, G. | Reverse Pivoting in Conceptual Information Systems [BibTeX] |
2001 | Vol. 2120Conceptual Structures: Broadening the Base, pp. 202-215 |
inproceedings | |
BibTeX:
@inproceedings{HerethStumme01Reverse, author = {Hereth, J. and Stumme, G.}, title = {Reverse Pivoting in Conceptual Information Systems}, booktitle = {Conceptual Structures: Broadening the Base}, publisher = {Springer}, year = {2001}, volume = {2120}, pages = {202-215} } |
|||||
Hereth, J. | Relational Scaling and Databases [BibTeX] |
2002 | Vol. 2393Conceptual Structures: Integration and Interfaces, 10th International Conference on Conceptual Structures, ICCS 2002, Borovets, Bulgaria, July 15-19, 2002, Proceedings, pp. 62-76 |
inproceedings | |
BibTeX:
@inproceedings{Hereth02Relational, author = {Hereth, J.}, title = {Relational Scaling and Databases}, booktitle = {Conceptual Structures: Integration and Interfaces, 10th International |
|||||
Doerfel, S., Jäschke, R. & Stumme, G. | Publication Analysis of the Formal Concept Analysis Community | 2012 | Vol. 7278ICFCA 2012, pp. 77-95 |
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} } |
|||||
Wille, R. | Plädoyer für eine philosophische Grundlegung der Begrifflichen Wissensverarbeitung [BibTeX] |
1994 | B. I. -WissenschaftsverlagBegriffliche Wissensverarbeitung -- Grundfragen und Aufgaben, pp. 11-25 | inproceedings | |
BibTeX:
@inproceedings{wille94plaedoyer, author = {Wille, Rudolf}, title = {Plädoyer für eine philosophische Grundlegung der Begrifflichen Wissensverarbeitung}, booktitle = {Begriffliche Wissensverarbeitung -- Grundfragen und Aufgaben}, journal = {B. I. -Wissenschaftsverlag}, publisher = {B. I. -Wissenschaftsverlag}, year = {1994}, pages = {11-25} } |
|||||
Brugger, W. | Philosophisches W�rterbuch [BibTeX] |
1976 | book | ||
BibTeX:
@book{brugger76philosophisches, author = {Brugger, W.}, title = {Philosophisches W�rterbuch}, publisher = {Herder}, year = {1976} } |
|||||
Stumme, G. | On-Line Analytical Processing with Conceptual Information Systems [BibTeX] |
1998 | Proc. 5th Intl. Conf. on Foundations of Data Organization (FODO'98), pp. 117-126 | inproceedings | URL |
BibTeX:
@inproceedings{stumme98online, author = {Stumme, Gerd}, title = {On-Line Analytical Processing with Conceptual Information Systems}, booktitle = {Proc. 5th Intl. Conf. on Foundations of Data Organization (FODO'98)}, year = {1998}, pages = {117-126}, note = {Short version of testumme00conceptual}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/1998/FODO98.pdf} } |
|||||
Goethals, B., Muhonen, J. & Toivonen, H. | Mining non-derivable association rules [BibTeX] |
2005 | Proc. SIAM International Conference on Data Mining | inproceedings | |
BibTeX:
@inproceedings{goethals05mining, author = {Goethals, Bart and Muhonen, Juhu and Toivonen, Hannu}, title = {Mining non-derivable association rules}, booktitle = {Proc. SIAM International Conference on Data Mining}, year = {2005} } |
|||||
Koperski, K., Han, J. & Adhikary, J. | Mining knowledge in geographical data [BibTeX] |
1998 | unpublished | ||
BibTeX:
@unpublished{Koperski98, author = {Koperski, K. and Han, J. and Adhikary, J.}, title = {Mining knowledge in geographical data}, year = {1998}, note = {Technical Report. ftp://ftp.fas.sfu.ca/pub/cs/han/ kdd/geosurvey98.ps} } |
|||||
Han, J., Pei, J. & Yin, Y. | Mining frequent patterns without candidate generation. [BibTeX] |
2000 | Proc. ACM SIGMOD Int'l Conf. on Management of Data, pp. 1-12 | inproceedings | |
BibTeX:
@inproceedings{Han00mining, author = {Han, J. and Pei, J. and Yin, Y.}, title = {Mining frequent patterns without candidate generation.}, booktitle = {Proc. ACM SIGMOD Int'l Conf. on Management of Data}, year = {2000}, pages = {1--12} } |
|||||
Schmitz, C., Hotho, A., Jäschke, R. & Stumme, G. | Mining Association Rules in Folksonomies | 2006 | Data Science and Classification. Proceedings of the 10th IFCS Conf., pp. 261-270 | inproceedings | URL |
Abstract: Social bookmark tools are rapidly emerging on the Web. In such
stems users are setting up lightweight conceptual structures lled folksonomies. These systems provide currently relatively few ructure. We discuss in this paper, how association rule mining n be adopted to analyze and structure folksonomies, and how the results can be used r ontology learning and supporting emergent semantics. We monstrate our approach on a large scale dataset stemming from an line system. |
|||||
BibTeX:
@inproceedings{schmitz2006mining, author = {Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd}, title = {Mining Association Rules in Folksonomies}, booktitle = {Data Science and Classification. Proceedings of the 10th IFCS Conf.}, publisher = {Springer}, year = {2006}, pages = {261--270}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/schmitz2006mining.pdf} } |
|||||
Calders, T. & Goethals, B. | Mining All Non-derivable Frequent Itemsets [BibTeX] |
2002 | PKDD '02: Proceedings of the 6th European Conference on Principles
of Data Mining and Knowledge Discovery, pp. 74-85 |
inproceedings | |
BibTeX:
@inproceedings{calders02mining, author = {Calders, Toon and Goethals, Bart}, title = {Mining All Non-derivable Frequent Itemsets}, booktitle = {PKDD '02: Proceedings of the 6th European Conference on Principles |
|||||
Kamber, M., Han, J. & Chiang, Y. | Metarule-guided mining of multi-dimensional association rules using
data cubes. [BibTeX] |
1997 | Proc. of the 3rd KDD Int'l Conf. | inproceedings | |
BibTeX:
@inproceedings{Kamber97metarule, author = {Kamber, M. and Han, J. and Chiang, Y.}, title = {Metarule-guided mining of multi-dimensional association rules using |
|||||
von Hentig, H. | Magier oder Magister? �ber die Einheit der Wissenschaft im Verst�ndigungsprozess [BibTeX] |
1974 | book | ||
BibTeX:
@book{hentig74magier, author = {von Hentig, Hartmut}, title = {Magier oder Magister? �ber die Einheit der Wissenschaft im Verst�ndigungsprozess}, publisher = {Suhrkamp}, year = {1974} } |
|||||
Burdick, D., Calimlim, M. & Gehrke, J. | MAFIA: A maximal frequent itemset algorithm for transactional databases [BibTeX] |
2001 | Proc. of the 17th Int. Conf. on Data Engineering | inproceedings | |
BibTeX:
@inproceedings{burdick01mafia, author = {Burdick, D. and Calimlim, M. and Gehrke, J.}, title = {MAFIA: A maximal frequent itemset algorithm for transactional databases}, booktitle = {Proc. of the 17th Int. Conf. on Data Engineering}, publisher = {IEEE Computer Society}, year = {2001} } |
|||||
Groh, B. & Wille, R. | Lattices of Triadic Concept Graphs [BibTeX] |
2000 | Vol. 1867Conceptual Structures: Logical, Linguistic, and Computational Issues, pp. 332-341 |
inproceedings | |
BibTeX:
@inproceedings{GrohWille00Lattices, author = {Groh, B. and Wille, R.}, title = {Lattices of Triadic Concept Graphs}, booktitle = {Conceptual Structures: Logical, Linguistic, and Computational Issues}, publisher = {Springer}, year = {2000}, volume = {1867}, pages = {332-341} } |
|||||
Lamport, L. | LaTeX: A Document Preparation System [BibTeX] |
1986 | book | ||
BibTeX:
@book{lamport86latex, author = {Lamport, Leslie}, title = {LaTeX: A Document Preparation System}, publisher = {Addison-Wesley}, year = {1986} } |
|||||
Feldman, R. & Dagan, I. | Knowledge discovery in textual databases [BibTeX] |
1995 | Proceedings of the 1st international conference on Knowledge Discovery
and Data mining (KDD'95), pp. 112-117 |
inproceedings | |
BibTeX:
@inproceedings{Feldman95, author = {Feldman, R. and Dagan, I.}, title = {Knowledge discovery in textual databases}, booktitle = {Proceedings of the 1st international conference on Knowledge Discovery |
|||||
Han, J., Cai, Y. & Cercone, N. | Knowledge discovery in databases : An attribute oriented approach [BibTeX] |
1992 | Proceedings of the 18th international conference on Very Large Data
Bases (VLDB'92), pp. 547-559 |
inproceedings | |
BibTeX:
@inproceedings{Han92, author = {Han, J. and Cai, Y. and Cercone, N.}, title = {Knowledge discovery in databases : An attribute oriented approach}, booktitle = {Proceedings of the 18th international conference on Very Large Data |
|||||
H�t�nen, K., Klemettinen, M., Mannila, H., Ronkainen, P. & Toivonen, H. | Knowledge discovery from telecommunication network alarm databases [BibTeX] |
1996 | Proceedings of the 12th International Conference on Data Engineering
(ICDE'96), pp. 115-122 |
inproceedings | |
BibTeX:
@inproceedings{Haetoenen96, author = {H�t�nen, K. and Klemettinen, M. and Mannila, H. and Ronkainen, P. and Toivonen, H.}, title = {Knowledge discovery from telecommunication network alarm databases}, booktitle = {Proceedings of the 12th International Conference on Data Engineering |
|||||
Fayyad, U.M., Piatetsky-Shapiro, G. & Smyth, P. | Knowledge discovery and data mining : Towards a unifying framework [BibTeX] |
1996 | Proceedings of the 2nd international conference on Knowledge Discovery
and Data mining (KDD'96), pp. 82-88 |
inproceedings | |
BibTeX:
@inproceedings{Fayyad96b, author = {Fayyad, U. M. and Piatetsky-Shapiro, G. and Smyth, P.}, title = {Knowledge discovery and data mining : Towards a unifying framework}, booktitle = {Proceedings of the 2nd international conference on Knowledge Discovery |
|||||
Fisher, D.H. | Knowledge acquisition via incremental conceptual clustering [BibTeX] |
1987 | Machine Learning Vol. 2(2), pp. 139-172 |
article | |
BibTeX:
@article{Fisher87, author = {Fisher, D. H.}, title = {Knowledge acquisition via incremental conceptual clustering}, journal = {Machine Learning}, publisher = {Kluwer Academic Publishers}, year = {1987}, volume = {2}, number = {2}, pages = {139--172} } |
|||||
German Federal Office for Information Security | IT Baseline Protection Manual [BibTeX] |
2003 | http://www.bsi.de/gshb/ | misc | |
BibTeX:
@misc{BSI03ITBaseline, author = {German Federal Office for Information Security}, title = {IT Baseline Protection Manual}, year = {2003} } |
|||||
Hotho, A., Jäschke, R., Schmitz, C. & Stumme, G. | Information Retrieval in Folksonomies: Search and Ranking [BibTeX] |
2006 | Proceedings of the 3rd European Semantic Web Conference, pp. 411-426 | inproceedings | |
BibTeX:
@inproceedings{hotho2006information, author = {Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd}, title = {Information Retrieval in Folksonomies: Search and Ranking}, booktitle = {Proceedings of the 3rd European Semantic Web Conference}, publisher = {Springer}, year = {2006}, pages = {411-426} } |
|||||
Godin, R., Missaoui, R. & Alaoui, H. | Incremental concept formation algorithms based on Galois
(concept) lattices [BibTeX] |
1995 | Computational Intelligence Vol. 11(2), pp. 246-267 |
article | |
BibTeX:
@article{Godin95, author = {Godin, R. and Missaoui, R. and Alaoui, H.}, title = {Incremental concept formation algorithms based on Galois |
|||||
Harinarayan, V., Rajaraman, A. & Ullman, J.D. | Implementing data cubes efficiently [BibTeX] |
1996 | Proceedings of the 1996 ACM SIGMOD international conference on Management
of Data (SIGMOD'96), pp. 205-216 |
inproceedings | |
BibTeX:
@inproceedings{Harinarayan96, author = {Harinarayan, V. and Rajaraman, A. and Ullman, J. D.}, title = {Implementing data cubes efficiently}, booktitle = {Proceedings of the 1996 ACM SIGMOD international conference on Management |
|||||
Stumme, G. | Iceberg Query Lattices for Datalog [BibTeX] |
2004 | Vol. 3127Conceptual Structures at Work: 12th International Conference on Conceptual Structures (ICCS 2004), pp. 109-125 |
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} } |
|||||
Han, J., Koperski, K. & Stefanovic, N. | GeoMiner : A system prototype for spatial data mining [BibTeX] |
1997 | Proceedings of the 1997 ACM SIGMOD international conference on Management
of Data (SIGMOD'97), pp. 553-556 |
inproceedings | |
BibTeX:
@inproceedings{Han97, author = {Han, J. and Koperski, K. and Stefanovic, N.}, title = {GeoMiner : A system prototype for spatial data mining}, booktitle = {Proceedings of the 1997 ACM SIGMOD international conference on Management |
|||||
Fayyad, U.M., Piatetsky-Shapiro, G. & Smyth, P. | From data mining to knowledge discovery : An overview [BibTeX] |
1996 | Advances in Knowledge Discovery and Data Mining, pp. 1-30 | incollection | |
BibTeX:
@incollection{Fayyad96c, author = {Fayyad, U. M. and Piatetsky-Shapiro, G. and Smyth, P.}, title = {From data mining to knowledge discovery : An overview}, booktitle = {Advances in Knowledge Discovery and Data Mining}, publisher = {AAAI Press}, year = {1996}, pages = {1--30} } |
|||||
Ganter, B. & Wille, R. | Formal Concept Analysis: Mathematical foundations [BibTeX] |
1999 | book | ||
BibTeX:
@book{Ganter99, author = {Ganter, B. and Wille, R.}, title = {Formal Concept Analysis: Mathematical foundations}, publisher = {Springer}, year = {1999} } |
|||||
Ganter, B. & Wille, R. | Formal Concept Analysis: Mathematical Foundations [BibTeX] |
1999 | book | ||
BibTeX:
@book{ganter99formal, author = {Ganter, B. and Wille, R.}, title = {Formal Concept Analysis: Mathematical Foundations}, publisher = {Springer}, year = {1999}, note = {Translation of: itFormale Begriffsanalyse: Mathematische |
|||||
Formal Concept Analysis: Foundations and Applications [BibTeX] |
2005 | Vol. 3626 |
proceedings | URL | |
BibTeX:
@proceedings{ganter05formal,, title = {Formal Concept Analysis: Foundations and Applications}, publisher = {Springer}, year = {2005}, volume = {3626}, note = {http://www.informatik.uni-trier.de/~ley/db/conf/fca/fca2005.html}, url = {http://www.springerlink.com/content/978-3-540-27891-7/} } |
|||||
Burmeister, P. | Formal concept analysis with ConImp : Introduction to the
basic features [BibTeX] |
1998 | techreport | ||
BibTeX:
@techreport{Burmeister98, author = {Burmeister, P.}, title = {Formal concept analysis with ConImp : Introduction to the |
|||||
Stumme, G. | Formal Concept Analysis on its Way from Mathematics to Computer Science [BibTeX] |
2002 | Vol. 2393Conceptual Structures: Integration and Interfaces , pp. 2-19 |
inproceedings | URL |
BibTeX:
@inproceedings{stumme02formalconcept, author = {Stumme, G.}, title = {Formal Concept Analysis on its Way from Mathematics to Computer Science}, booktitle = {Conceptual Structures: Integration and Interfaces }, publisher = {Springer}, year = {2002}, volume = {2393}, pages = {2-19}, note = {Invited Talk, summary of testumme03offtonew}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2002/ICCS02.pdf} } |
|||||
Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H. & Verkamo, A.I. | Finding interesting rules from large sets of discovered association
rules [BibTeX] |
1994 | Proceedings of the 3rd international Conference on Information and
Knowledge Management (CIKM'94), pp. 401-407 |
inproceedings | |
BibTeX:
@inproceedings{Klemettinen94, author = {Klemettinen, M. and Mannila, H. and Ronkainen, P. and Toivonen, H. and Verkamo, A. I.}, title = {Finding interesting rules from large sets of discovered association |
|||||
Ganter, B. & Reuter, K. | Finding all closed sets : A general approach [BibTeX] |
1991 | Order Vol. 8, pp. 283-290 |
article | |
BibTeX:
@article{Ganter91, author = {Ganter, B. and Reuter, K.}, title = {Finding all closed sets : A general approach}, journal = {Order}, publisher = {Kluwer Academic Publishers}, year = {1991}, volume = {8}, pages = {283-290} } |
|||||
Lin, D. | Fast algorithms for discovering the maximum frequent sets [BibTeX] |
1998 | School: University of New York | phdthesis | |
BibTeX:
@phdthesis{Lin98b, author = {Lin, D.}, title = {Fast algorithms for discovering the maximum frequent sets}, school = {University of New York}, year = {1998} } |
|||||
Han, J. & Fu, Y. | Exploration of the power of attribute oriented induction in data
mining [BibTeX] |
1996 | Advances in Knowledge Discovery and Data Mining, pp. 399-421 | incollection | |
BibTeX:
@incollection{Han96a, author = {Han, J. and Fu, Y.}, title = {Exploration of the power of attribute oriented induction in data |
|||||
John, G.H. | Enhancements to the data mining process [BibTeX] |
1997 | School: University of Stanford | phdthesis | |
BibTeX:
@phdthesis{John97, author = {John, G. H.}, title = {Enhancements to the data mining process}, school = {University of Stanford}, year = {1997} } |
|||||
Fayet, A., Giacometti, A., Laurent, D. & Spyratos, N. | Découverte de r�gles pertinentes dans les bases de donn�es [BibTeX] |
1998 | Actes des 14�mes journ�es Bases de Donn�es Avanc�es (BDA'98), pp. 197-211 | inproceedings | |
BibTeX:
@inproceedings{Fayet98, author = {Fayet, A. and Giacometti, A. and Laurent, D. and Spyratos, N.}, title = {Découverte de r�gles pertinentes dans les bases de donn�es}, booktitle = {Actes des 14�mes journ�es Bases de Donn�es Avanc�es (BDA'98)}, year = {1998}, pages = {197--211} } |
|||||
Brin, S., Motwani, R., Ullman, J.D. & Tsur, S. | Dynamic itemset counting and implication rules for market basket
data [BibTeX] |
1997 | Proceedings of the 1997 ACM SIGMOD international conference on Management
of Data (SIGMOD'97), pp. 255-264 |
inproceedings | |
BibTeX:
@inproceedings{Brin97a, author = {Brin, S. and Motwani, R. and Ullman, J. D. and Tsur, S.}, title = {Dynamic itemset counting and implication rules for market basket |
|||||
Cole, R.J., Eklund, P.W. & Stumme, G. | Document Retrieval for Email Search and Discovery using Formal Concept Analysis | 2003 | Journal of Applied Artificial Intelligence (AAI) Vol. 17(3), pp. 257-280 |
article | URL |
Abstract: This paper discusses an document discovery tool based on
nceptual clustering by formal concept analysis. The program lows users to navigate email using a visual lattice metaphor ther than a tree. It implements a virtual file structure over ail where files and entire directories can appear in multiple sitions. The content and shape of the lattice formed by the nceptual ontology can assist in email discovery. The system scribed provides more flexibility in retrieving stored emails an what is normally available in email clients. The paper scusses how conceptual ontologies can leverage traditional cument retrieval systems and aid knowledge discovery in document llections. |
|||||
BibTeX:
@article{cole03document, author = {Cole, Richard J. and Eklund, Peter W. and Stumme, Gerd}, title = {Document Retrieval for Email Search and Discovery using Formal Concept Analysis}, journal = {Journal of Applied Artificial Intelligence (AAI)}, year = {2003}, volume = {17}, number = {3}, pages = {257-280}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2003/AAI03_emails.pdf} } |
|||||
Koperski, K. & Han, J. | Discovery of spatial association rules in geographic information
databases [BibTeX] |
1995 | Proceedings of the 4th international Symposium on advances in Spatial
Databases (SSD'95), pp. 47-66 |
inproceedings | |
BibTeX:
@inproceedings{Koperski95, author = {Koperski, K. and Han, J.}, title = {Discovery of spatial association rules in geographic information |
|||||
Han, J. & Fu, Y. | Discovery of multiple-level association rules from large databases [BibTeX] |
1995 | Proceedings of the 21st international conference on Very Large Data
Bases (VLDB'95), pp. 420-431 |
inproceedings | |
BibTeX:
@inproceedings{Han95, author = {Han, J. and Fu, Y.}, title = {Discovery of multiple-level association rules from large databases}, booktitle = {Proceedings of the 21st international conference on Very Large Data |
|||||
Lent, B., Agrawal, R. & Srikant, R. | Discovering trends in text databases [BibTeX] |
1997 | Proceedings of the 3rd international conference on Knowledge Discovery
and Data mining (KDD'97), pp. 227-230 |
inproceedings | |
BibTeX:
@inproceedings{Lent97, author = {Lent, B. and Agrawal, R. and Srikant, R.}, title = {Discovering trends in text databases}, booktitle = {Proceedings of the 3rd international conference on Knowledge Discovery |
|||||
Jäschke, R., Hotho, A., Schmitz, C., Ganter, B. & Stumme, G. | Discovering Shared Conceptualizations in Folksonomies [BibTeX] |
2008 | Journal of Web Semantics Vol. 6(1), pp. 38-53 |
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} } |
|||||
Gunopulos, D., Mannila, H. & Saluja, S. | Discovering all most specific sentences by randomized algorithms [BibTeX] |
1997 | Proceedings of the 6th biennial International Conference on Database
Theory (ICDT'97), pp. 215-229 |
inproceedings | |
BibTeX:
@inproceedings{Gunopulos97b, author = {Gunopulos, D. and Mannila, H. and Saluja, S.}, title = {Discovering all most specific sentences by randomized algorithms}, booktitle = {Proceedings of the 6th biennial International Conference on Database |
|||||
Godin, R., Mili, H., Mineau, G., Missaoui, R., Arfi, A. & Chau, T. | Design of class hierarchies based on concept (Galois) lattices. [BibTeX] |
1998 | TAPOS Vol. 4(2), pp. 117-134 |
article | |
BibTeX:
@article{Godin98design, author = {Godin, R. and Mili, H. and Mineau, G. and Missaoui, R. and Arfi, A. and Chau, T.}, title = {Design of class hierarchies based on concept (Galois) lattices.}, journal = {TAPOS}, year = {1998}, volume = {4}, number = {2}, pages = {117--134} } |
|||||
Han, J., Fu, Y., Wang, W., Chiang, J., Gong, W., Koperski, K., Li, D., Lu, Y., Rajan, A., Stefanovic, N., Xia, B. & Zaïane, O.R. | DBMiner : A system for mining knowledge in large relational
databases [BibTeX] |
1996 | Proceedings of the 2nd international conference on Knowledge Discovery
and Data mining (KDD'96), pp. 250-255 |
inproceedings | |
BibTeX:
@inproceedings{Han96b, author = {Han, J. and Fu, Y. and Wang, W. and Chiang, J. and Gong, W. and Koperski, K. and Li, D. and Lu, Y. and Rajan, A. and Stefanovic, N. and Xia, B. and Zaïane, O. R.}, title = {DBMiner : A system for mining knowledge in large relational |
|||||
Han, J., Chiang, J., Chee, S., Chen, J., Chen, Q., Cheng, S., Gong, W., Kamber, M., Liu, K.K.G., Lu, Y., Stefanovic, N., Winstone, L., Xia, B., Zaïane, O.R., Zhang, S. & Zhu, H. | DBMiner : A system for data mining in relational databases
and data warehouses [BibTeX] |
1997 | Proceedings of the 1997 GASCON metting of minds (GASCON'97), pp. 249-260 | inproceedings | |
BibTeX:
@inproceedings{Han97b, author = {Han, J. and Chiang, J. and Chee, S. and Chen, J. and Chen, Q. and Cheng, S. and Gong, W. and Kamber, M. and Liu, K. Koperski G. and Lu, Y. and and N. Stefanovic and Winstone, L. and Xia, B. and Zaïane, O. R. and Zhang, S. and Zhu, H.}, title = {DBMiner : A system for data mining in relational databases |
|||||
Han, J. & Kamber, M. | Data: Mining: Concepts and Techniques [BibTeX] |
2002 | book | ||
BibTeX:
@book{Han02data, author = {Han, J. and Kamber, M.}, title = {Data: Mining: Concepts and Techniques}, publisher = {Morgan Kaufmann}, year = {2002} } |
|||||
Han, J., Cai, Y. & Cercone, N. | Data-driven discovery of quantitative rules in relational databases [BibTeX] |
1993 | IEEE Transansaction on Knowledge and Data Engineering Vol. 5(1), pp. 29-40 |
article | |
BibTeX:
@article{Han93, author = {Han, J. and Cai, Y. and Cercone, N.}, title = {Data-driven discovery of quantitative rules in relational databases}, journal = {IEEE Transansaction on Knowledge and Data Engineering}, publisher = {IEEE Computer Society Press}, year = {1993}, volume = {5}, number = {1}, pages = {29--40} } |
|||||
Han, J. & Kamber, M. | Data Mining: Concepts and Techniques [BibTeX] |
2000 | book | ||
BibTeX:
@book{Han:book00, author = {Han, J. and Kamber, M.}, title = {Data Mining: Concepts and Techniques}, publisher = {Morgan Kaufmann}, year = {2000} } |
|||||
Bastide, Y. | Data Mining: algorithmes par niveau, techniques d'implementation
et applications [BibTeX] |
2000 | School: Université de Clermont-Ferrand II | phdthesis | |
BibTeX:
@phdthesis{Bastide00, author = {Bastide, Y.}, title = {Data Mining: algorithmes par niveau, techniques d'implementation |
|||||
Gunopulos, D., Khardon, R., Mannila, H. & Toivonen, H. | Data mining, hypergraph transversals, and machine learning [BibTeX] |
1997 | Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART symposium on Principles
of Database Systems (PODS'97), pp. 209-216 |
inproceedings | |
BibTeX:
@inproceedings{Gunopulos97a, author = {Gunopulos, D. and Khardon, R. and Mannila, H. and Toivonen, H.}, title = {Data mining, hypergraph transversals, and machine learning}, booktitle = {Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART symposium on Principles |
|||||
Ganter, B. & Stumme, G. | Creation and Merging of Ontology Top-Levels | 2003 | Vol. 2746Conceptual Structures for Knowledge Creation and Communication., pp. 131-145 |
inproceedings | URL |
Abstract: We provide a new method for systematically structuring the top-down level of ontologies.
is based on an interactive, top--down knowledge acquisition ocess, which assures that the knowledge engineer nsiders all possible cases while avoiding redundant acquisition. e method is suited especially for creating/merging the top rt(s) of the ontologies, where high accuracy is required, and for supporting the merging of two (or more) ontologies on that level. |
|||||
BibTeX:
@inproceedings{ganter03creation, author = {Ganter, Bernhard and Stumme, Gerd}, title = {Creation and Merging of Ontology Top-Levels}, booktitle = {Conceptual Structures for Knowledge Creation and Communication.}, publisher = {Springer}, year = {2003}, volume = {2746}, pages = {131-145}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2003/ganter2003creation.pdf} } |
|||||
Kent, R.E. & Neuss, C. | Creating a Web Analysis and Visualization Environment [BibTeX] |
1995 | Computer Networks and ISDN Systems Vol. 28(1\&2), pp. 109-117 |
article | URL |
BibTeX:
@article{kent95creating, author = {Kent, Robert E. and Neuss, Christian}, title = {Creating a Web Analysis and Visualization Environment}, journal = {Computer Networks and ISDN Systems}, year = {1995}, volume = {28}, number = {1&}, pages = {109-117}, url = {http://dblp.uni-trier.de/db/journals/cn/cn28.html#KentN95} } |
|||||
Contributions to ICCS 2005 [BibTeX] |
2005 | Contributions to ICCS 2005 | proceedings | URL | |
BibTeX:
@proceedings{dau05contributions,, title = {Contributions to ICCS 2005}, booktitle = {Contributions to ICCS 2005}, publisher = {kassel university press}, year = {2005}, url = {http://www.kde.cs.uni-kassel.de/conf/iccs05} } |
|||||
Kryszkiewicz, M. | Concise Representation of Frequent Patterns Based on Disjunction-Free
Generators [BibTeX] |
2001 | ICDM '01: Proceedings of the 2001 IEEE International Conference on
Data Mining, pp. 305-312 |
inproceedings | |
BibTeX:
@inproceedings{kryszkiewicz01concise, author = {Kryszkiewicz, Marzena}, title = {Concise Representation of Frequent Patterns Based on Disjunction-Free |
|||||
Conceptual Structures: Common Semantics for Sharing Knowledge, 13th International Conference on Conceptual Structures, ICCS 2005, Kassel, Germany, July 17-22, 2005, Proceedings [BibTeX] |
2005 | Vol. 3596ICCS |
proceedings | URL | |
BibTeX:
@proceedings{conf/iccs/2005,, title = {Conceptual Structures: Common Semantics for Sharing Knowledge, 13th International Conference on Conceptual Structures, ICCS 2005, Kassel, Germany, July 17-22, 2005, Proceedings}, booktitle = {ICCS}, publisher = {Springer}, year = {2005}, volume = {3596}, url = {http://www.kde.cs.uni-kassel.de/conf/iccs05} } |
|||||
Conceptual Structures -- Broadening the Base. Proc. 9th International Conference on Conceptual Structures [BibTeX] |
2001 | Vol. 2120 |
proceedings | ||
BibTeX:
@proceedings{delugach01conceptual,, title = {Conceptual Structures -- Broadening the Base. Proc. 9th International Conference on Conceptual Structures}, publisher = {Springer}, year = {2001}, volume = {2120} } |
|||||
Cimiano, P., Hotho, A., Stumme, G. & Tane, J. | Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies | 2004 | Vol. 2961Concept Lattices, pp. 189-207 |
inproceedings | URL |
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. |
|||||
BibTeX:
@inproceedings{cimiano2004concept, 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://www.kde.cs.uni-kassel.de/stumme/papers/2004/cimiano2004concept.pdf} } |
|||||
Cimiano, P., Hotho, A., Stumme, G. & Tane, J. | Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies [BibTeX] |
2004 | Vol. 2961Concept Lattices, pp. 189-207 |
incollection | URL |
BibTeX:
@incollection{cimiano2004conceptual, author = {Cimiano, Philipp and Hotho, Andreas and Stumme, Gerd and Tane, Julien}, title = {Conceptual Knowledge Processing with Formal Concept |
|||||
Hereth, J., Stumme, G., Wille, R. & Wille, U. | Conceptual Knowledge Discovery - a Human-Centered Approach | 2003 | Journal of Applied Artificial Intelligence (AAI) Vol. 17(3), pp. 281-301 |
article | URL |
Abstract: In this paper we discuss Conceptual Knowledge Discovery in Databases (CKDD) as it is developing in the field of Conceptual Knowledge
rocessing. Conceptual Knowledge rocessing is based on the mathematical theory of Formal Concept nalysis which has become a successful theory for data analysis during he last two decades. CKDD aims to support a human-centered process discovering knowledge from data by visualizing and analyzing e conceptual structure of the data. We dicuss how the nagement system TOSCANA for conceptual information systems pports CKDD, and illustrate it by two applications in database rketing and flight movement analysis. Finally, we present a w tool for conceptual deviation discovery, Chianti. |
|||||
BibTeX:
@article{hereth03conceptual, author = {Hereth, Joachim and Stumme, Gerd and Wille, Rudolf and Wille, Uta}, title = {Conceptual Knowledge Discovery - a Human-Centered Approach}, journal = {Journal of Applied Artificial Intelligence (AAI)}, year = {2003}, volume = {17}, number = {3}, pages = {281-301}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2003/hereth2003conceptual.pdf} } |
|||||
Becker, K., Stumme, G., Wille, R., Wille, U. & Zickwolff, M. | Conceptual Information Systems Discussed Through an IT-Security Tool [BibTeX] |
2000 | Vol. 1937Knowledge Engineering and Knowledge Management. Methods, Models, and Tools., pp. 352-365 |
inproceedings | URL |
BibTeX:
@inproceedings{becker00conceptual, author = {Becker, K. and Stumme, G. and Wille, R. and Wille, U. and Zickwolff, M.}, title = {Conceptual Information Systems Discussed Through an IT-Security Tool}, booktitle = {Knowledge Engineering and Knowledge Management. Methods, Models, and Tools.}, publisher = {Springer}, year = {2000}, volume = {1937}, pages = {352-365}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/EKAW00.pdf} } |
|||||
Stumme, G., Taouil, R., Bastide, Y., Pasquier, N. & Lakhal, L. | Computing iceberg concept lattices with TITANIC | 2002 | Data & Knowledge Engineering Vol. 42(2), pp. 189-222 |
article | DOI URL |
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} } |
|||||
Kuznetsov, S. & Obiedkov, S. | Comparing performance of algorithms for generating concept lattices [BibTeX] |
2002 | Journal of Experimental and Theoretical Artificial Intelligence Vol. 14, pp. 189-216 |
article | URL |
BibTeX:
@article{kuznetsov02comparing, author = {Kuznetsov, S. and Obiedkov, S.}, title = {Comparing performance of algorithms for generating concept lattices}, journal = {Journal of Experimental and Theoretical Artificial Intelligence}, year = {2002}, volume = {14}, pages = {189-216}, url = {/brokenurl#citeseer.ist.psu.edu/666686.html} } |
|||||
Lambiotte, R. & Ausloos, M. | Collaborative tagging as a tripartite network | 2005 | misc | URL | |
Abstract: 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. |
|||||
BibTeX:
@misc{citeulike:484851, author = {Lambiotte, R. and Ausloos, M.}, title = {Collaborative tagging as a tripartite network}, year = {2005}, note = {ttarXiv:cs.DS/0512090}, url = {http://arxiv.org/abs/cs.DS/0512090} } |
|||||
Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. | Classification and regression trees [BibTeX] |
1984 | book | ||
BibTeX:
@book{Breiman84, author = {Breiman, L. and Friedman, J. H. and Olshen, R. A. and Stone, C. J.}, title = {Classification and regression trees}, publisher = {Wadsworth Publishing Company}, year = {1984} } |
|||||
Gardarin, G., Pucheral, P. & Wu, F. | Bitmap based algorithms for mining association rules [BibTeX] |
1998 | Actes des 14�mes journ�es Bases de Donn�es Avanc�es (BDA'98), pp. 157-175 | inproceedings | |
BibTeX:
@inproceedings{Gardarin98, author = {Gardarin, G. and Pucheral, P. and Wu, F.}, title = {Bitmap based algorithms for mining association rules}, booktitle = {Actes des 14�mes journ�es Bases de Donn�es Avanc�es (BDA'98)}, year = {1998}, pages = {157--175} } |
|||||
Hotho, A., Jäschke, R., Schmitz, C. & Stumme, G. | BibSonomy: A Social Bookmark and Publication Sharing System [BibTeX] |
2006 | Proc. of the ICCS 2006 Conceptual Structures Tool Interoperability
Workshop |
inproceedings | |
BibTeX:
@inproceedings{hjss06bibsonomy, author = {Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd}, title = {BibSonomy: A Social Bookmark and Publication Sharing System}, booktitle = {Proc. of the ICCS 2006 Conceptual Structures Tool Interoperability |
|||||
Hotho, A., Jäschke, R., Schmitz, C. & Stumme, G. | BibSonomy: A Social Bookmark and Publication Sharing System | 2006 | Proceedings of the First Conceptual Structures Tool Interoperability Workshop at the 14th International Conference on Conceptual Structures, pp. 87-102 | inproceedings | URL |
Abstract: Social bookmark tools are rapidly emerging on the Web. In such
stems users are setting up lightweight conceptual structures lled folksonomies. The reason for their immediate success is the ct that no specific skills are needed for participating. In this per we specify a formal model for folksonomies and briefly describe r own system BibSonomy, which allows for sharing both bookmarks d publication references in a kind of personal library. |
|||||
BibTeX:
@inproceedings{hotho2006bibsonomy, author = {Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd}, title = {BibSonomy: A Social Bookmark and Publication Sharing System}, booktitle = {Proceedings of the First Conceptual Structures Tool Interoperability Workshop at the 14th International Conference on Conceptual Structures}, publisher = {Aalborg Universitetsforlag}, year = {2006}, pages = {87-102}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/hotho2006bibsonomy.pdf} } |
|||||
Brin, S., Motwani, R. & Silverstein, C. | Beyond market baskets: Generalizing association rules to correlation [BibTeX] |
1997 | Proceedings of the 1997 ACM SIGMOD international conference on Management
of Data (SIGMOD'97), pp. 265-276 |
inproceedings | |
BibTeX:
@inproceedings{Brin97b, author = {Brin, S. and Motwani, R. and Silverstein, C.}, title = {Beyond market baskets: Generalizing association rules to correlation}, booktitle = {Proceedings of the 1997 ACM SIGMOD international conference on Management |
|||||
Heckerman, D. | Bayesian networks for knowledge discovery [BibTeX] |
1996 | Advances in Knowledge Discovery and Data Mining, pp. 273-305 | incollection | |
BibTeX:
@incollection{Heckerman96, author = {Heckerman, D.}, title = {Bayesian networks for knowledge discovery}, booktitle = {Advances in Knowledge Discovery and Data Mining}, publisher = {AAAI Press}, year = {1996}, pages = {273--305} } |
|||||
Jäschke, R. & Rudolph, S. | Attribute Exploration on the Web | 2013 | Contributions to the 11th International Conference on Formal Concept Analysis, pp. 19-34 | inproceedings | URL |
Abstract: 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. | |||||
BibTeX:
@inproceedings{jaschke2013attribute, author = {Jäschke, Robert and Rudolph, Sebastian}, title = {Attribute Exploration on the Web}, booktitle = {Contributions to the 11th International Conference on Formal Concept Analysis}, year = {2013}, pages = {19--34}, url = {http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-113133} } |
|||||
Boulicaut, J.-F., Bykowski, A. & Rigotti, C. | Approximation of Frequency Queries by Means of Free-Sets [BibTeX] |
2000 | PKDD '00: Proceedings of the 4th European Conference on Principles
of Data Mining and Knowledge Discovery, pp. 75-85 |
inproceedings | |
BibTeX:
@inproceedings{boulicaut00approximation, author = {Boulicaut, Jean-Francois and Bykowski, Artur and Rigotti, Christophe}, title = {Approximation of Frequency Queries by Means of Free-Sets}, booktitle = {PKDD '00: Proceedings of the 4th European Conference on Principles |
|||||
Godin, R. & Missaoui, R. | An incremental concept formation approach for learning from databases [BibTeX] |
1994 | Theoretical Computer Science : Special issue on formal methods in
databases and software engineering Vol. 133(2), pp. 387-419 |
article | |
BibTeX:
@article{Godin94, author = {Godin, R. and Missaoui, R.}, title = {An incremental concept formation approach for learning from databases}, journal = {Theoretical Computer Science : Special issue on formal methods in |
|||||
Gupta, A., Harinarayan, V. & Quass, D. | Aggregate-query processing in data warehousing environments [BibTeX] |
1995 | Proceedings of the 21st international conference on Very Large Data
Bases (VLDB'95), pp. 358-369 |
inproceedings | |
BibTeX:
@inproceedings{Gupta95, author = {Gupta, A. and Harinarayan, V. and Quass, D.}, title = {Aggregate-query processing in data warehousing environments}, booktitle = {Proceedings of the 21st international conference on Very Large Data |
|||||
Advances in Formal Concept Analysis for Knowledge Discovery in Databases. Proc. Workshop FCAKDD of the 15th European
Conference on Artificial Intelligence (ECAI 2002) [BibTeX] |
2002 | proceedings | URL | ||
BibTeX:
@proceedings{duquenne02advanced,, title = {Advances in Formal Concept Analysis for Knowledge Discovery in Databases. Proc. Workshop FCAKDD of the 15th European |
|||||
Ferr�, S. & Ridoux, O. | A Logical Generalization of Formal Concept Analysis | 2000 | Int. Conf. Conceptual Structures, pp. 371-384 | inproceedings | |
Abstract: 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. |
|||||
BibTeX:
@inproceedings{ferre00logical, author = {Ferr�, S. and Ridoux, O.}, title = {A Logical Generalization of Formal Concept Analysis}, booktitle = {Int. Conf. Conceptual Structures}, publisher = {Springer}, year = {2000}, pages = {371--384} } |
|||||
Carpineto, C. & Romano, G. | A lattice conceptual clustering system and its application to browsing retrieval | 1996 | Machine Learning Vol. 24(2), pp. 95-122 |
article | URL |
Abstract: 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.
- |
|||||
BibTeX:
@article{keyhere, author = {Carpineto, Claudio and Romano, Giovanni}, title = {A lattice conceptual clustering system and its application to browsing retrieval}, journal = {Machine Learning}, year = {1996}, volume = {24}, number = {2}, pages = {95--122}, url = {http://dx.doi.org/10.1007/BF00058654} } |
|||||
Stumme, G. | A Finite State Model for On-Line Analytical Processing in
Triadic Contexts [BibTeX] |
2005 | Vol. 3403Proc. 3rd Intl. Conf. on Formal Concept Analysis, pp. 315-328 |
inproceedings | URL |
BibTeX:
@inproceedings{stumme05finite, author = {Stumme, Gerd}, title = {A Finite State Model for On-Line Analytical Processing in |
|||||
Klemettinen, M., Mannila, H. & Toivonen, H. | A data-mining methodology and its application to semi-automatic knowledge
acquisition [BibTeX] |
1997 | Proceedings of the 8th international conference on Database and Expert
systems Applications (DEXA'97), pp. 670-677 |
inproceedings | |
BibTeX:
@inproceedings{Klemettinen97, author = {Klemettinen, M. and Mannila, H. and Toivonen, H.}, title = {A data-mining methodology and its application to semi-automatic knowledge |
|||||
Bykowski, A. & Rigotti, C. | A condensed representation to find frequent patterns. [BibTeX] |
2001 | PODS | inproceedings | URL |
BibTeX:
@inproceedings{Bykowski01condensed, author = {Bykowski, Artur and Rigotti, Christophe}, title = {A condensed representation to find frequent patterns.}, booktitle = {PODS}, year = {2001}, url = {http://dblp.uni-trier.de/db/conf/pods/pods2001.html#BykowskiR01} } |
Created by JabRef on 20/04/2024.