Using Subgroup Discovery Metrics to Mine Interesting Subgraphs
نویسندگان
چکیده
While extensive work has been done in both graph mining and subgroup discovery, the potential benefits of combining the two fields have not been well studied. We propose, implement, and evaluate an adaption of an existing subgroup discovery algorithm to mine graph data. Our experiments use two different metrics from the subgroup discovery literature to demonstrate value in using such metrics to guide subgraph discovery and to build a foundation to support further studies combining subgroup discovery and graph mining.
منابع مشابه
Interactive and Iterative Discovery of Entity Network Subgraphs
Graph mining to extract interesting components has been studied in various guises, e.g., communities, dense subgraphs, cliques. However, most existing works are based on notions of frequency and connectivity and do not capture subjective interestingness from a user’s viewpoint. Furthermore, existing approaches to mine graphs are not interactive and cannot incorporate user feedbacks in any natur...
متن کاملFast Description-Oriented Community Detection using Subgroup Discovery
Communities can intuitively be defined as subsets of nodes of a graph with a dense structure. However, for mining such communities usually only structural aspects are taken into account. Typically, no concise and easily interpretable community description is provided. For tackling this issue, we focus on fast description-oriented community detection using subgroup discovery, cf. [1, 2]. In orde...
متن کاملRelational Pattern and Subgroup Discovery in CAD documents
In our recent work [1], we have dealt with frequent pattern discovery in CAD designs using a novel approach to integration of hierarchical background knowledge to relational data mining. This paper extends the previous work by applying the methodology of subgroup discovery which first seeks frequent structural patterns in CAD designs and then discovers interesting (large and class-biased) desig...
متن کاملA multiobjective evolutionary programming framework for graph-based data mining
Subgrap h mining is the process of identifying concep ts describing interesting and repetitive subgraphs within graph-based data. The exponential number of possible subgraphs makes the problem very challenging. Existing methods apply a single-objective subgraph search with the view that interesting subgraphs are those capable of not merely compressing the data, but also enhancing the interpreta...
متن کاملEfficient Mining of Large Maximal Bicliques
Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicliques are not very efficient in practice. In this paper, we propose an efficient algorithm to mine large maximal biclique subgraphs from undirected graphs. Our algorithm uses a divide-and-conquer approach. It effectively uses t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015