Corpus ID: 9101289

Mining in the Proximity of Subgraphs

  title={Mining in the Proximity of Subgraphs},
  author={Nikhil S. Ketkar and Lawrence B. Holder and Diane Joyce Cook},
Graphs are a natural way to represent multi-relational data and are extensively used to model a variety of application domains in diverse fields ranging from bioinformatics to homeland security. Often, in such graphs, certain subgraphs are known to possess some distinct properties and graph patterns in the proximity of these subgraphs can be an indicator of these properties. In this work we focus on the task of mining in the proximity of subgraphs, known to possess certain distinct properties… Expand

Figures from this paper

A new proposal for graph-based image classification using frequent approximate subgraphs
This paper proposes a new framework for image classification, which uses frequent approximate subgraph patterns as features and proposes to compute automatically the substitution matrices needed in the process, instead of using expert knowledge. Expand
Frequent approximate subgraphs as features for graph-based image classification
A new algorithm for mining frequent connected subgraphs over undirected and labeled graph collections VEAM (Vertex and Edge Approximate graph Miner) is presented and a framework for graph-based image classification is introduced. Expand
Scalable SVM-Based Classification in Dynamic Graphs
  • Y. Yao, L. Holder
  • Computer Science
  • 2014 IEEE International Conference on Data Mining
  • 2014
This paper designs an entropy-based sub graph extraction strategy to select informative neighbor nodes and discard those with less discriminative power, to facilitate an effective classification process in large-scale and incrementally changing graphs. Expand
Incremental SVM-based classification in dynamic streaming networks
A framework combining an incremental support vector machine (SVM) with the Weisfeiler-Lehman (W-L) graph kernel is proposed, which design an entropy-based subgraph extraction strategy, that selects informative neighbor nodes and discards those with less discriminative power, to facilitate the classification of nodes in a dynamic network. Expand
A Review on Graph-based Image Classification
Graphs are increasingly important in modelling complicated structures, such as circuits, images, chemical compounds, protein structures, biological networks, social networks and the web. Graph-basedExpand
Scalable classification for large dynamic networks
  • Y. Yao, L. Holder
  • Computer Science
  • 2015 IEEE International Conference on Big Data (Big Data)
  • 2015
An online version of an existing graph kernel is introduced to incrementally compute the kernel matrix for a unbounded stream of extracted subgraphs and a kernel perceptron is adopted to learn a discriminative classifier and predict the class labels of the target nodes with their corresponding sub graphs. Expand
Granular Computing Techniques for Classification and Semantic Characterization of Structured Data
This paper proposes a system able to synthesize automatically a classification model and a set of interpretable decision rules defined over aSet of symbols, corresponding to frequent substructures of the input dataset, and compares it with two other state-of-the-art graph classifiers, evidencing both its main strengths and limits. Expand
Mission Programming for Deployable Wireless Sensor Networks
The fourth year of the PSI project saw a major thrust in the area of Wireless Sensor Networks, Computer and Network Security, Pervasive Computing, Machine Learning, and Databases. Through ourExpand
Finding, extracting and exploiting structure in text and hypertext
Data mining is a fast-developing field of study, using computations to either predict or describe large amounts of data to improve the quality of existing and new data sources. Expand


Efficient mining of frequent subgraphs in the presence of isomorphism
This work proposes a novel frequent subgraph mining algorithm: FFSM, which employs a vertical search scheme within an algebraic graph framework it has developed to reduce the number of redundant candidates proposed. Expand
An efficient algorithm for discovering frequent subgraphs
The results show that despite the underlying complexity associated with frequent subgraph discovery, FSG is effective in finding all frequently occurring subgraphs in data sets containing more than 200,000 graph transactions and scales linearly with respect to the size of the data set. Expand
Discovering frequent geometric subgraphs
This paper presents gFSG, a computationally efficient algorithm for finding frequent patterns corresponding to geometric subgraphs in a large collection of geometric graphs and evaluated its performance using a large database of over 20,000 chemical structures. Expand
CloseGraph: mining closed frequent graph patterns
A closed graph pattern mining algorithm, CloseGraph, is developed by exploring several interesting pruning methods and shows that it not only dramatically reduces unnecessary subgraphs to be generated but also substantially increases the efficiency of mining, especially in the presence of large graph patterns. Expand
Comparison of graph-based and logic-based multi-relational data mining
We perform an experimental comparison of the graph-based multi-relational data mining system, Subdue, and the inductive logic programming system, CProgol, on the Mutagenesis dataset and variousExpand
Discovery of frequent DATALOG patterns
WARMR is presented, a general purpose inductive logic programming algorithm that addresses frequent query discovery: a very general DATALOG formulation of the frequent pattern discovery problem. Expand
A quickstart in frequent structure mining can make a difference
The GrAph/Sequence/Tree extractiON (Gaston) algorithm is introduced that implements the "quickstart principle", which is based on the fact that these classes of structures are contained in each other, thus allowing for the development of structure mining algorithms that split the search into steps of increasing complexity. Expand
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
A novel approach named AGM to efficiently mine the association rules among the frequently appearing substructures in a given graph data set through the extended algorithm of the basket analysis is proposed. Expand
Link mining: a new data mining challenge
A key challenge for data mining is tackling the problem of mining richly structured datasets, where the objects are linked in some way. Links among the objects may demonstrate certain patterns, whichExpand
Learning Probabilistic Relational Models
This paper describes both parameter estimation and structure learning -- the automatic induction of the dependency structure in a model and shows how the learning procedure can exploit standard database retrieval techniques for efficient learning from large datasets. Expand