Andreas Maunz
ABSTRACT
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 occurrences, which is characteristic for open or closed fragment mining. In the experiments, the proposed method reduces feature set sizes by >90 % and >30 % compared to complete tree mining and open tree mining, respectively. Evaluation using crossvalidation runs shows that their classification accuracy is similar to the complete set of trees but significantly better than that of open trees. Compared to open or closed fragment mining, a large part of the search space can be pruned due to an improved statistical constraint (dynamic upper bound adjustment), which is also confirmed in the experiments in lower running times compared to ordinary (static) upper bound pruning. Further analysis using large-scale datasets yields insight into important properties of the proposed descriptors, such as the dataset coverage and the class size represented by each descriptor. A final cross-validation run confirms that the novel descriptors render large training sets feasible which previously might have been intractable.
Supplemental Material
- M. Al Hasan, V. Chaoji, S. Salem, J. Besson, and M. Zaki. Origami: Mining Representative Orthogonal Graph Patterns. ICDM 2007. Seventh IEEE International Conference on Data Mining, pages 153--162, Oct. 2007. Google Scholar
Digital Library
- B. Bringmann, A. Zimmermann, L. de Raedt, and S. Nijssen. Don't Be Afraid of Simpler Patterns. In Proceedings 10th PKDD, pages 55--66. Springer-Verlag, 2006. Google ScholarDigital Library
- C. Helma. Lazy Structure-Activity Relationships (lazar) for the Prediction of Rodent Carcinogenicity and Salmonella Mutagenicity. Molecular Diversity, pages 147--158, 2006.Google Scholar
- T. Horvath, J. Ramon, and S. Wrobel. Frequent Subgraph Mining in Outerplanar Graphs. In KDD '06: Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 197--206, 2006. Google ScholarDigital Library
- K. Jahn and S. Kramer. Optimizing gSpan for Molecular Datasets. In Proceedings of the Third International Workshop on Mining Graphs, Trees and Sequences (MGTS-2005), 2005.Google Scholar
- S. Kramer, L. De Raedt, and C. Helma. Molecular feature mining in HIV data. In KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, pages 136--143, New York, NY, USA, 2001. ACM. Google ScholarDigital Library
- S. Morishita and J. Sese. Traversing Itemset Lattices with Statistical Metric Pruning. In Symposium on Principles of Database Systems, pages 226--236, 2000. Google ScholarDigital Library
- S. Nijssen and J. N. Kok. A Quickstart in Frequent Structure Mining can make a Difference. In KDD '04: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 647--652, New York, NY, USA, 2004. ACM. Google ScholarDigital Library
- S. Nijssen and J. N. Kok. Frequent Subgraph Miners: Runtimes Don't Say Everything. In Proceedings of the International Workshop on Mining and Learning with Graphs (MLG 2006, pages 173--180, 2006.Google Scholar
- U. Ruckert and S. Kramer. Optimizing Feature Sets for Structured Data. In Stan Matwin and Dunja Mladenic, editors, 18th ECML. Springer, 2007. Google ScholarDigital Library
- F. Wilcoxon. Individual comparisons by ranking methods. Biometrics Bulletin, 1(6):80--83, 1945.Google ScholarCross Ref
- M. Worlein, T. Meinl, I. Fischer, and M. Philippsen. A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston. In Proceedings of PKDD, pages 392--403, 2005.Google ScholarCross Ref
- X. Yan and J. Han. gSpan: Graph-Based Substructure Pattern Mining. In ICDM '02: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM'02), page 721, Washington, DC, USA, 2002. IEEE Computer Society. Google ScholarDigital Library
- X. Yan and J. Han. CloseGraph: Mining Closed Frequent Graph Patterns. In KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 286--295, New York, NY, USA, 2003. ACM. Google ScholarDigital Library
Index Terms
- Large-scale graph mining using backbone refinement classes
Recommendations
Pushing Convertible Constraints in Frequent Itemset Mining
Recent work has highlighted the importance of the constraint-based mining paradigm in the context of frequent itemsets, associations, correlations, sequential patterns, and many other interesting patterns in large databases. Constraint pushing ...
A Model of Mining Noise-Tolerant Frequent Itemset in Transactional Databases
INCOS '15: Proceedings of the 2015 International Conference on Intelligent Networking and Collaborative SystemsNowadays, mining approximate frequent itemsets from noisy data has attracted much attention in real applications. However, there is not widely accepted algorithm at present to solve the problem under noisy databases, which dues to two key issues. ...
Diversity Based Improved Bagging Algorithm
ICEMIS '15: Proceedings of the The International Conference on Engineering & MIS 2015Bagging is a well known method for designing classifier ensembles. It builds an ensemble of classifier trained on different bootstrap replicates of the training data set. In this paper an improvement to bagging algorithm called DivBagging is presented ...
Comments