Efficient mining for structurally diverse subgraph patterns in large molecular databases
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum frequency and significance constraints, using classes of fragments to reduce feature set size and running times. The classes are defined in terms of fragments sharing a common backbone. The method is able to optimize structural inter-feature entropy as opposed to purely occurrence-based criteria, which is characteristic for open or closed fragment mining. We first give an intuitive explanation why backbone refinement class features lead to a set of relevant features that are suitable for classification, in particular in the area of structure-activity relationships (SARs). We then show that backbone refinement classes yield a high compression in the search space of rooted perfect binary trees. We conduct several experiments to evaluate our theoretical insights in practice: A visualization suggests low co-occurrence and high entropy of backbone refinement class features. By comparison to a class of patterns sampled from the maximal patterns previously introduced by Al Hasan et al., we find a favorable tradeoff between the structural similarity and the resources needed to compute the descriptors. Cross-validation shows that classification accuracy is similar to the complete set of trees but significantly better than that of open trees, while feature set size is reduced by >90% and >30% compared to complete tree mining and open tree mining, respectively. Furthermore, compared to open or closed pattern mining, a large part of the search space can be pruned due to an improved statistical constraint (dynamic upper bound adjustment). This is confirmed experimentally by running times reduced by more than 60% compared to ordinary (static) upper bound pruning. The application of our method to the largest datasets that have been used in correlated graph mining so far indicates robustness against the minimum frequency parameter, and a cross-validation run on this data confirms that the novel descriptors render large training sets feasible, which previously might have been intractable.
A C++ implementation of the mining algorithm is available at http://www.maunz.de/libfminer-doc. Animated figures, links to datasets, and further resources are available at http://www.maunz.de/mlj-res.
KeywordsCorrelated graph mining Backbone Dynamic upper bound pruning Structural diversity
- Bringmann, B., Zimmermann, A., Raedt, L. D., & Nijssen, S. (2006). Don’t be afraid of simpler patterns. In Proceedings 10th PKDD (pp. 55–66). Berlin: Springer. Google Scholar
- Chi, Y., Muntz, R. R., Nijssen, S., & Kok, J. N. (2001). Frequent subtree mining—an overview. Google Scholar
- Helma, C. (2006). Lazy structure-activity relationships (Lazar) for the prediction of rodent carcinogenicity and salmonella mutagenicity. In Molecular diversity (pp. 147–158). Google Scholar
- Jahn, K., & Kramer, S. (2005). Optimizing gSpan for molecular datasets. In: Proceedings of the third international workshop on mining graphs, trees and sequences (MGTS-2005). Google Scholar
- Morishita, S., & Sese, J. (2000). Traversing itemset lattice with statistical metric pruning. In Proceedings of the 19th ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems (pp. 226–236). New York: ACM. Google Scholar
- Nijssen, S., & Kok, J. N. (2006). Frequent subgraph miners: runtime don’t say everything. In Proceedings of the international workshop on mining and learning with graphs (MLG 2006) (pp. 173–180). Berlin, Germany. Google Scholar
- OpenTox: A predictive toxicology framework. http://www.opentox.org. See also: Hardy, B., Douglas, N., Helma, C., et al.: Collaborative development of predictive toxicology applications fifth international symposium on computational methods in toxicology and pharmacology integrating internet resources (CMTPI 2009) (to appear). London: Taylor & Francis.
- Rückert, U., & Kramer, S. (2007). Optimizing feature sets for structured data. In Proceedings of the 18th European conference on machine learning (ECML07) (pp. 716–723). Berlin: Springer-Verlag. Google Scholar
- Schulz, H., Kersting, C., & Karwath, A. ILP, the blind, and the elephant: Euclidean embedding of co-proven queries. In 19th international conference on inductive logic programming (ILP 2009). http://www.cs.kuleuven.be/dtai/ilp-mlg-srl/dokuwiki/doku.php?id=paper:ilp:33.
- Wörlein, M., Meinl, T., Fischer, I., & Philippsen, M. (2005). A quantitative comparison of the subgraph miners MoFa, gSpan, ffsm, and Gaston. In Proceedings of PKDD (pp. 392–403). Berlin: Springer-Verlag. Google Scholar
- Yan, X., & Han, J. (2002). gSpan: graph-based substructure pattern mining. In ICDM ’02: proceedings of the 2002 IEEE international conference on data mining (ICDM’02) (p. 721). Washington: IEEE Computer Society. Google Scholar