MoSS: a program for molecular substructure mining

Authors:
Christian Borgelt;Thorsten Meinl;Michael Berthold
Affiliations:
University of Magdeburg, Magdeburg, Germany;University of Erlangen-Nuremberg, Erlangen, Germany;University of Konstanz, Konstanz, Germany
Venue:
Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations
Year:
2005

Citing 12
Cited 5

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Pharmacophore Discovery Using the Inductive Logic Programming System PROGOL

Machine Learning - Special issue on applications of machine learning and the knowledge discovery process
Molecular feature mining in HIV data

Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Graph-Based Data Mining

IEEE Intelligent Systems
Frequent Subgraph Discovery

ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Mining Molecular Fragments: Finding Relevant Substructures of Molecules

ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
gSpan: Graph-Based Substructure Pattern Mining

ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism

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
State of the art of graph-based data mining

ACM SIGKDD Explorations Newsletter
A quickstart in frequent structure mining can make a difference

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Large scale mining of molecular fragments with wildcards

Intelligent Data Analysis

Discovering Emerging Graph Patterns from Chemicals

ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Mining frequent closed graphs on evolving data streams

Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Extracting and summarizing the frequent emerging graph patterns from a dataset of graphs

Journal of Intelligent Information Systems
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
Efficient calculation of compound similarity based on maximum common subgraphs and its application to prediction of gene transcript levels

International Journal of Bioinformatics Research and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Molecular substructure mining is currently an intensively studied research area. In this paper we present an implementation of an algorithm for finding frequent substructures in a set of molecules, which may also be used to find substructures that discriminate well between a focus and a complement group. In addition to the basic algorithm, we discuss advanced pruning techniques, demonstrating their effectiveness with experiments on two publicly available molecular data sets, and briefly mention some other extensions.