Machine Learning · 2008 · 137 citations · 37 references
ComputingComputer ScienceMathematicsAlgorithmsData MiningMachine LearningFrequent Pattern MiningGraph AlgorithmsGraph AnalyticsGraph MiningGraph-based LearningPattern RecognitionBoostingGraph ClassificationGraph RegressionMathematical Programming ModelsPredictionSearch Space PruningSubgraph FeaturesSubgraph Mining
Graph mining methods enumerate frequently appearing subgraph patterns, which can be used as features for subsequent classification or regression. However, frequent patterns are not necessarily informative for the given learning problem. We propose a mathematical programming boosting method (gBoost) that progressively collects informative patterns. Compared to AdaBoost, gBoost can build the prediction rule with fewer iterations. To apply the boosting method to graph data, a branch-and-bound pattern search algorithm is developed based on the DFS code tree. The constructed search space is reused in later iterations to minimize the computation time. Our method can learn more efficiently than the simpler method based on frequent substructure mining, because the output labels are used as an extra information source for pruning the search space. Furthermore, by engineering the mathematical program, a wide range of machine learning problems can be solved without modifying the pattern search algorithm.
37
Proceedings of the 24th international conference on Machine learning
2007 · 11.7K citations
Wrappers for feature subset selection
Ron Kohavi, George H. John · Artificial Intelligence · 1997 · 8.9K citations