Suche
Anzeige der Dokumente 21-30 von 68
Preprint
Conceptual knowledge discovery with frequent concept lattices
(1999)
Knowledge discovery support environments include beside classical data analysis tools also data mining tools. For supporting both kinds of tools, a unified knowledge representation is needed. We show that concept lattices which are used as knowledge representation in Conceptual Information Systems can also be used for structuring the results of mining association rules. Vice versa, we use ideas of association rules for reducing the complexity of the visualization of Conceptual Information Systems.
Preprint
Intelligent structuring and reducing of association rules with formal concept analysis
(2001)
Association rules are used to investigate large databases. The analyst is usually confronted with large lists of such rules and has to find the most relevant ones for his purpose. Based on results about knowledge representation within the theoretical framework of Formal Concept Analysis, we present relatively small bases for association rules from which all rules can be deduced. We also provide algorithms for their calculation.
Aufsatz
Towards semantic web mining
(2002)
Semantic Web Mining aims at combining the two fast-developing research areas Semantic Web and Web Mining. The idea is to improve, on the one hand, the results of Web Mining by exploiting the new semantic structures in the Web; and to make use of Web Mining, on overview of where the two areas meet today, and sketches ways of how a closer integration could be profitable.
Dissertation
Supporting Researchers: Analyzing the Scholarly Publication Life Cycle and Social Bookmarking Systems
(2017-04-19)
Researchers must face the exponential growth of the body of available scholarly literature, which makes it ever harder to keep track with one’s own community, especially for newcomers. In this thesis, we explore different means of supporting researchers with that task. For this purpose, we follow two approaches: We provide analyses of research communities and of researchers’ interactions through data that can be obtained from the phases in the life cycle of scholarly publications (creation, dissemination, usage, and ...
Aufsatz
Fast computation of concept lattices using data mining techniques
(2000)
We present a new algorithm called TITANIC for computing concept lattices. It is based on data mining techniques for computing frequent itemsets. The algorithm is experimentally evaluated and compared with B. Ganter's Next-Closure algorithm.
Dissertation
Discovering Knowledge in Bipartite Graphs with Formal Concept Analysis
(2019)
Since the 1970s knowledge based approaches are a crucial part of artificial intelligence (AI) research. In this work we investigate data sets in the form of bipartite graphs, i.e., graphs where a bipartition of the vertex set respecting the edge set can be found, for knowledge. To this end we first relate those bipartite graphs to the structure formal context, as used in formal concept analysis (FCA). This link enables us to employ the whole tool-set of FCA to bipartite graphs and therefore, notably, to bipartite ...
Aufsatz
Hierarchies of conceptual scales
(1999)
Formal Concept Analysis allows to derive conceptual hierarchies from data tables. Formal Concept Analysis is applied in various domains, e.g., data analysis, information retrieval, and knowledge discovery in databases. In order to deal with increasing sizes of the data tables (and to allow more complex data structures than just binary attributes), conceputal scales habe been developed. They are considered as metadata which structure the data conceptually. But in large applications, the number of conceptual scales ...