Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
CloseGraph: mining closed frequent graph patterns
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Frequent free tree discovery in graph data
Proceedings of the 2004 ACM symposium on Applied computing
Mining protein family specific residue packing patterns from protein structure graphs
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
Parallel algorithms for mining frequent structural motifs in scientific data
Proceedings of the 18th annual international conference on Supercomputing
Graph indexing: a frequent structure-based approach
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Diagonally Subgraphs Pattern Mining
Proceedings of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery
Cyclic pattern kernels for predictive graph mining
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Scalable mining of large disk-based graph databases
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
SPIN: mining maximal frequent subgraphs from graph databases
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
An Efficient Algorithm for Discovering Frequent Subgraphs
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Frequent Substructure-Based Approaches for Classifying Chemical Compounds
IEEE Transactions on Knowledge and Data Engineering
Finding Patterns on Protein Surfaces: Algorithms and Applications to Protein Classification
IEEE Transactions on Knowledge and Data Engineering
Mining closed relational graphs with connectivity constraints
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Finding Frequent Patterns in a Large Sparse Graph*
Data Mining and Knowledge Discovery
Graph indexing based on discriminative frequent structure analysis
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
MoSS: a program for molecular substructure mining
Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations
Dynamic Load Balancing for the Distributed Mining of Molecular Structures
IEEE Transactions on Parallel and Distributed Systems
Optimization study with ligand-design interval rules
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Proceedings of the 2006 workshop on Memory system performance and correctness
Decentralized load balancing for highly irregular search problems
Microprocessors & Microsystems
Out-of-core coherent closed quasi-clique mining from large dense graph databases
ACM Transactions on Database Systems (TODS)
A customizable multi-agent system for distributed data mining
Proceedings of the 2007 ACM symposium on Applied computing
Graph-Based Procedural Abstraction
Proceedings of the International Symposium on Code Generation and Optimization
Mining complex power networks for blackout prevention
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Discovering frequent geometric subgraphs
Information Systems
Large scale mining of molecular fragments with wildcards
Intelligent Data Analysis
Efficient mining of frequent XML query patterns with repeating-siblings
Information and Software Technology
Classifying Chemical Compounds Using Contrast and Common Patterns
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
Classification of Web Documents Using a Graph-Based Model and Structural Patterns
PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
Mining Edge-Weighted Call Graphs to Localise Software Bugs
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
Mining Frequent Connected Subgraphs Reducing the Number of Candidates
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
On effective presentation of graph patterns: a structural representative approach
Proceedings of the 17th ACM conference on Information and knowledge management
A novel approach for efficient supergraph query processing on graph databases
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Identifying bug signatures using discriminative graph mining
Proceedings of the eighteenth international symposium on Software testing and analysis
Visually Guiding and Controlling the Search While Mining Chemical Structures
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
Discovering Emerging Graph Patterns from Chemicals
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II
Independent informative subgraph mining for graph information retrieval
Proceedings of the 18th ACM conference on Information and knowledge management
Graph classification based on pattern co-occurrence
Proceedings of the 18th ACM conference on Information and knowledge management
Comparing stars: on approximating graph edit distance
Proceedings of the VLDB Endowment
gPrune: a constraint pushing framework for graph pattern mining
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
Discovery of frequent graph patterns that consist of the vertices with the complex structures
MCD'07 Proceedings of the 3rd ECML/PKDD international conference on Mining complex data
Mining correlated subgraphs in graph databases
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Duplicate candidate elimination and fast support calculation for frequent subgraph mining
IDEAL'09 Proceedings of the 10th international conference on Intelligent data engineering and automated learning
High confidence fragment-based classification rule mining for imbalanced HIV data
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
JPMiner: mining frequent jump patterns from graph databases
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 5
Towards proximity pattern mining in large graphs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
ECDL'09 Proceedings of the 13th European conference on Research and advanced technology for digital libraries
IEEE Computational Intelligence Magazine
Frequent subgraph mining on a single large graph using sampling techniques
Proceedings of the Eighth Workshop on Mining and Learning with Graphs
Semi-supervised feature selection for graph classification
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
MARGIN: Maximal frequent subgraph mining
ACM Transactions on Knowledge Discovery from Data (TKDD)
A new algorithm for mining frequent connected subgraphs based on adjacency matrices
Intelligent Data Analysis
Full duplicate candidate pruning for frequent connected subgraph mining
Integrated Computer-Aided Engineering
Frequent subgraph mining in outerplanar graphs
Data Mining and Knowledge Discovery
Frequent tree pattern mining: A survey
Intelligent Data Analysis
An efficient distributed subgraph mining algorithm in extreme large graphs
AICI'10 Proceedings of the 2010 international conference on Artificial intelligence and computational intelligence: Part I
Efficient algorithms for supergraph query processing on graph databases
Journal of Combinatorial Optimization
Mining frequent closed graphs on evolving data streams
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Dual active feature and sample selection for graph classification
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Interactive discriminative mining of chemical fragments
ILP'10 Proceedings of the 20th international conference on Inductive logic programming
Computing graph-based lattices from smallest projections
KONT'07/KPP'07 Proceedings of the First international conference on Knowledge processing and data analysis
From connected frequent graphs to unconnected frequent graphs
ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
Extracting and summarizing the frequent emerging graph patterns from a dataset of graphs
Journal of Intelligent Information Systems
Generalization rules for binarized descriptors
ISBMDA'06 Proceedings of the 7th international conference on Biological and Medical Data Analysis
A quantitative comparison of the subgraph miners mofa, gspan, FFSM, and gaston
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
High performance subgraph mining in molecular compounds
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Frequent approximate subgraphs as features for graph-based image classification
Knowledge-Based Systems
Molecular fragment mining for drug discovery
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Cl-GBI: a novel approach for extracting typical patterns from graph-structured data
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Learning closed sets of labeled graphs for chemical applications
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
EGDIM: evolving graph database indexing method
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
Indexing and mining topological patterns for drug discovery
Proceedings of the 15th International Conference on Extending Database Technology
An iterative MapReduce approach to frequent subgraph mining in biological datasets
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Nearly exact mining of frequent trees in large networks
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I
Mining frequent subgraphs over uncertain graph databases under probabilistic semantics
The VLDB Journal — The International Journal on Very Large Data Bases
NODAR: mining globally distributed substructures from a single labeled graph
Journal of Intelligent Information Systems
A direct mining approach to efficient constrained graph pattern discovery
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
A multiobjective evolutionary programming framework for graph-based data mining
Information Sciences: an International Journal
Discovery of extreme events-related communities in contrasting groups of physical system networks
Data Mining and Knowledge Discovery
Frequent subgraph summarization with error control
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
A new proposal for graph classification using frequent geometric subgraphs
Data & Knowledge Engineering
Weighted path as a condensed pattern in a single attributed DAG
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
G-Tries: a data structure for storing and finding subgraphs
Data Mining and Knowledge Discovery
| Hi-index | 0.00 |
We present an algorithm to find fragments in a setof molecules that help to discriminate between differentclasses of, for instance, activity in a drug discovery context.Instead of carrying out a brute-force search, our methodgenerates fragments by embedding them in all appropriatemolecules in parallel and prunes the search tree based ona local order of the atoms and bonds, which results in substantiallyfaster search by eliminating the need for frequent,computationally expensive reembeddings and by suppressingredundant search. We prove the usefulness of our algorithmby demonstrating the discovery of activity-relatedgroups of chemical compounds in the well-known NationalCancer Institute's HIV-screening dataset.