## Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 69-89 |

Number of pages | 21 |

Journal | Machine Learning |

Volume | 75 |

Issue number | 1 |

DOIs | |

Publication status | Published - Apr 2009 |

Externally published | Yes |

## All Science Journal Classification (ASJC) codes

- Software
- Artificial Intelligence