Knowledge Representation Analysis of Graph Mining
Many problems, especially those with a composite structure, can naturally be expressed in higher order logic. From a KR perspective modeling these problems in an intuitive way is a challenging task. In this paper we study the graph mining problem as an example of a higher order problem. In short, this problem asks us to find a graph that frequently occurs as a subgraph among a set of example graphs. We start from the problem's mathematical definition to solve it in three state-of-the-art specification systems. For IDP and ASP, which have no native support for higher order logic, we propose the use of encoding techniques such as the disjoint union technique and the saturation technique. ProB benefits from the higher order support for sets. We compare the performance of the three approaches to get an idea of the overhead of the higher order support. We propose higher-order language extensions for IDP-like specification languages and discuss what kind of solver support is needed. Native higher order shifts the burden of rewriting specifications using encoding techniques from the user to the solver itself.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph MiningSimilar Papers 제목 키워드 기반
Knowledge Map: Toward a New Approach Supporting the Knowledge Management in Distributed Data Mining
Distributed data mining (DDM) deals with the problem of finding patterns or models, called knowledge, in an environment with distributed data and computations. Today, a massive amounts of data which are often geographica…
ManagementData Exploration and Validation on dense knowledge graphs for biomedical research
Here we present a holistic approach for data exploration on dense knowledge graphs as a novel approach with a proof-of-concept in biomedical research. Knowledge graphs are increasingly becoming a vital factor in knowledg…
Knowledge GraphsTime SeriesTime Series AnalysisKnowledge extraction, modeling and formalization: EEG case study
Formal Concept Analysis (FCA) is a well-established method for data analysis which finds many applications in data mining. Its extension on complex data representation formats brought a wave of new applications to the pr…
ClusteringEEGElectroencephalogram (EEG)Iteratively Learning Representations for Unseen Entities with Inter-Rule Correlations
Recent work on knowledge graph completion (KGC) focused on learning embeddings of entities and relations in knowledge graphs. These embedding methods require that all test entities are observed at training time, resultin…
Knowledge Graph CompletionKnowledge GraphsLink PredictionTriple ClassificationcgSpan: Pattern Mining in Conceptual Graphs
Conceptual Graphs (CGs) are a graph-based knowledge representation formalism. In this paper we propose cgSpan a CG frequent pattern mining algorithm. It extends the DMGM-GSM algorithm that takes taxonomy-based labeled gr…