Information Parallax

2011 ◽  
pp. 182-215
Author(s):  
Franc Grootjen ◽  
Theo van der Weide
Keyword(s):  
Search Engine ◽  
Fuzzy Set ◽  
Human Activities ◽  
Formal Concept Analysis ◽  
Special Kind ◽  
Latent Semantic Indexing ◽  
Concept Analysis ◽  
Vector Model ◽  
Formal Concept ◽  
Definition Of

To effectively use and exchange information among AI systems, a formal specification of the representation of their shared domain of discourse—called an ontology—is indispensable. In this chapter we introduce a special kind of knowledge representation based on a dual view on the universe of discourse and show how it can be used in human activities such as searching, in-depth exploration and browsing. After a formal definition of dualistic ontologies we exemplify this definition with three different (well known) kinds of ontologies, based on the vector model, on formal concept analysis and on fuzzy logic respectively. The vector model leads to concepts derived by latent semantic indexing using the singular value decomposition. Both the set model and the fuzzy-set model lead to formal concept analysis, in which the fuzzy-set model is equipped with a parameter that controls the fine-graining of the resulting concepts. We discuss the relation between the resulting systems of concepts. Finally, we demonstrate the use of this theory by introducing the dual search engine. We show how this search engine can be employed to support the human activities addressed above.

scholarly journals Construction Search Engine Based on Formal Concept Analysis and Association Rule Mining

2012 ◽  
Vol 6-7 ◽  
pp. 625-630 ◽  
Author(s):  
Hong Sheng Xu
Keyword(s):  
Search Engine ◽  
Association Rule ◽  
Formal Concept Analysis ◽  
Association Rule Mining ◽  
High Efficiency ◽  
Concept Lattice ◽  
Concept Analysis ◽  
Frequent Itemsets ◽  
Formal Concept ◽  
Rule Mining

In the form of background in the form of concept partial relation to the corresponding concept lattice, concept lattice is the core data structure of formal concept analysis. Association rule mining process includes two phases: first find all the frequent itemsets in data collection, Second it is by these frequent itemsets to generate association rules. This paper analyzes the association rule mining algorithms, such as Apriori and FP-Growth. The paper presents the construction search engine based on formal concept analysis and association rule mining. Experimental results show that the proposed algorithm has high efficiency.

scholarly journals Analysis of a Vector Space Model, Latent Semantic Indexing and Formal Concept Analysis for Information Retrieval

2012 ◽  
Vol 12 (1) ◽  
pp. 34-48 ◽  
Author(s):  
Ch. Aswani Kumar ◽  
M. Radvansky ◽  
J. Annapurna
Keyword(s):  
Information Retrieval ◽  
Vector Space ◽  
Formal Concept Analysis ◽  
Vector Space Model ◽  
Latent Semantic Indexing ◽  
Concept Analysis ◽  
Formal Concept ◽  
Semantic Indexing ◽  
Space Model ◽  
Classical Vector

Abstract Latent Semantic Indexing (LSI), a variant of classical Vector Space Model (VSM), is an Information Retrieval (IR) model that attempts to capture the latent semantic relationship between the data items. Mathematical lattices, under the framework of Formal Concept Analysis (FCA), represent conceptual hierarchies in data and retrieve the information. However, both LSI and FCA use the data represented in the form of matrices. The objective of this paper is to systematically analyze VSM, LSI and FCA for the task of IR using standard and real life datasets.

scholarly journals Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis

2005 ◽  
Vol 24 ◽  
pp. 305-339 ◽  
Author(s):  
P. Cimiano ◽  
A. Hotho ◽  
S. Staab
Keyword(s):  
Formal Concept Analysis ◽  
Clustering Algorithm ◽  
Special Kind ◽  
Concept Analysis ◽  
Formal Concept ◽  
Agglomerative Clustering ◽  
Text Corpus ◽  
Text Corpora ◽  
The Impact ◽  
Concept Hierarchies

We present a novel approach to the automatic acquisition of taxonomies or concept hierarchies from a text corpus. The approach is based on Formal Concept Analysis (FCA), a method mainly used for the analysis of data, i.e. for investigating and processing explicitly given information. We follow Harris' distributional hypothesis and model the context of a certain term as a vector representing syntactic dependencies which are automatically acquired from the text corpus with a linguistic parser. On the basis of this context information, FCA produces a lattice that we convert into a special kind of partial order constituting a concept hierarchy. The approach is evaluated by comparing the resulting concept hierarchies with hand-crafted taxonomies for two domains: tourism and finance. We also directly compare our approach with hierarchical agglomerative clustering as well as with Bi-Section-KMeans as an instance of a divisive clustering algorithm. Furthermore, we investigate the impact of using different measures weighting the contribution of each attribute as well as of applying a particular smoothing technique to cope with data sparseness.

scholarly journals Continuous Domains in Formal Concept Analysis*

2021 ◽  
Vol 179 (3) ◽  
pp. 295-319
Author(s):  
Longchun Wang ◽  
Lankun Guo ◽  
Qingguo Li
Keyword(s):  
Formal Concept Analysis ◽  
Concept Analysis ◽  
Continuous Functions ◽  
Formal Context ◽  
Formal Concept ◽  
Contractive Mappings ◽  
Continuous Domains ◽  
Algebraic Domains ◽  
Scott Continuous ◽  
Continuous Domain

Formal Concept Analysis (FCA) has been proven to be an effective method of restructuring complete lattices and various algebraic domains. In this paper, the notion of contractive mappings over formal contexts is proposed, which can be viewed as a generalization of interior operators on sets into the framework of FCA. Then, by considering subset-selections consistent with contractive mappings, the notions of attribute continuous formal contexts and continuous concepts are introduced. It is shown that the set of continuous concepts of an attribute continuous formal context forms a continuous domain, and every continuous domain can be restructured in this way. Moreover, the notion of F-morphisms is identified to produce a category equivalent to that of continuous domains with Scott continuous functions. The paper also investigates the representations of various subclasses of continuous domains including algebraic domains and stably continuous semilattices.

Sign in / Sign up

Export Citation Format

Share Document