Graph Theoretic Lattice Mining Based on Formal Concept Analysis (FCA) Theory for Text Mining

The growth of the semantic web has fueled the need to search for information based on the understanding of the intent of the searcher, coupled with the contextual meaning of the keywords supplied by the searcher. The common solution to enhance the searching process includes the deployment of formal concept analysis (FCA) theory to extract concepts from a set of text with the use of corresponding domain ontology. However, creating a domain ontology or cross-platform ontology is a tedious and time consuming process that requires validation from domain experts. Therefore, this study proposed an alternative solution called Lattice Mining (LM) that utilizes FCA theory and graph theory. This is because the process of matching a query to related documents is similar to the process of graph matching if both the query and the documents are represented using graphs. This study adopted the idea of FCA in the determination of the concepts based on texts and deployed the lattice diagrams obtained from an FCA tool for further analysis using graph theory. The LM technique employed in this study utilized the adjacency matrices obtained from the lattice outputs and performed a distance measure technique to calculate the similarity between two graphs. The process was realized successively via the implementation of three algorithms called the Relatedness Algorithm (RA), the Adjacency Matrix Algorithm (AMA) and the Concept-Based Lattice Mining (CBLM) Algorithm. A similarity measure between FCA output lattices yielded promising results based on the ranking of the trace values from the matrices. Recognizing the potential of this method, future work includes refinement in the steps of the CBLM algorithm for a more efficient implementation of the process

Visualizing and Interacting with Concept Hierarchies

Concept Hierarchies and Formal Concept Analysis are theoretically well grounded and largely experimented methods. They rely on line diagrams called Galois lattices for visualizing and analysing object-attribute sets. Galois lattices are visually seducing and conceptually rich for experts. However they present important drawbacks due to their concept oriented overall structure: analysing what they show is difficult for non experts, navigation is cumbersome, interaction is poor, and scalability is a deep bottleneck for visual interpretation even for experts. In this paper we introduce semantic probes as a means to overcome many of these problems and extend usability and application possibilities of traditional FCA visualization methods. Semantic probes are visual user centred objects which extract and organize reduced Galois sub-hierarchies. They are simpler, clearer, and they provide a better navigation support through a rich set of interaction possibilities. Since probe driven sub-hierarchies are limited to users focus, scalability is under control and interpretation is facilitated. After some successful experiments, several applications are being developed with the remaining problem of finding a compromise between simplicity and conceptual expressivity

LatticeNN -- Deep Learning and Formal Concept Analysis

International audienc

Dynamic Maximal Cliques Detection and Evolution Management in Social Internet of Things: A Formal Concept Analysis Approach

This is the author accepted manuscript. The final version is available from IEEE via the DOI in this recordThe booming of Social Internet of Things (SIoT) has witnessed the significance of graph mining and analysis for social network management. Online Social Networks (OSNs) can be efficiently managed by monitoring users behaviors within a cohesive social group represented by a maximal clique. They can further provide valued social intelligence for their users. Maximal Cliques Problem (MCP) as a fundamental problem in graph mining and analysis is to identify the maximal cliques in a graph. Existing studies on MCP mainly focus on static graphs. In this paper, we adopt the Formal Concept Analysis (FCA) theory to represent and analyze social networks. We then develop two novel formal concepts generation algorithms, termed Add-FCA and Dec-FCA, that can be applicable to OSNs for detecting the maximal cliques and characterizing the dynamic evolution process of maximal cliques in OSNs. Extensive experimental results are conducted to investigate and demonstrate the correctness and effectiveness of the proposed algorithms. The results reveal that our algorithms can efficiently capture and manage the evolutionary patterns of maximal cliques in OSNs, and a quantitative relation among them is presented. In addition, an illustrative example is presented to verify the usefulness of the proposed approach.National Natural Science Foundation of ChinaEuropean Union Horizon 2020Fundamental Research Funds for the Central Universitie

Learning Concept Interestingness for Identifying Key Structures from Social Networks

This is the author accepted manuscript. The final version is available from IEEE via the DOI in this recordIdentifying key structures from social networks that aims to discover hidden patterns and extract valuable information is an essential task in the network analysis realm. These different structure detection tasks can be integrated naturally owing to the topological nature of key structures. However, identifying key network structures in most studies has been performed independently, leading to huge computational overheads. To address this challenge, this paper proposes a novel approach for handling key structures identification tasks simultaneously under the unified Formal Concept Analysis (FCA) framework. Specifically, we first implement the FCA-based representation of a social network and then generate the fine-grained knowledge representation, namely concept. Then, an efficient concept interestingness calculation algorithm suitable for social network scenarios is proposed. Next, we then leverage concept interestingness to quantify the hidden relations between concepts and network structures. Finally, an efficient algorithm for jointly key structures detection is developed based on constructed mapping relations. Extensive experiments conducted on real-world networks demonstrate that the efficiency and effectiveness of our proposed approach.Fundamental Research Funds for the Central Universitie

The Minimum Description Length Principle for Pattern Mining: A Survey

This is about the Minimum Description Length (MDL) principle applied to pattern mining. The length of this description is kept to the minimum. Mining patterns is a core task in data analysis and, beyond issues of efficient enumeration, the selection of patterns constitutes a major challenge. The MDL principle, a model selection method grounded in information theory, has been applied to pattern mining with the aim to obtain compact high-quality sets of patterns. After giving an outline of relevant concepts from information theory and coding, as well as of work on the theory behind the MDL and similar principles, we review MDL-based methods for mining various types of data and patterns. Finally, we open a discussion on some issues regarding these methods, and highlight currently active related data analysis problems