A multi-instance ensemble learning model based on concept lattice

This paper introduces concept lattice and ensemble learning technique into multi-instance learning, and proposes the multi-instance ensemble learning model based on concept lattice which can be applied to content-based image retrieval, etc. In this model, a ⃟-concept lattice is built based on training set firstly. Because bags rather than instances in bags will serve as objects of formal context in the process of building ⃟-concept lattice, the corresponding time complexity and space complexity can be effectively descend to a certain extent; Secondly, the multi-instance learning problem is divided into multiple local multi-instance learning problems based on ⃟-concept lattice, and local target feature sets are found further in each local multi-instance learning problem. Finally, the whole training set can be classified almost correctly by ensemble of multiple local target feature sets. Through precise theorization and extensive experimentation, it proves that the method is effective. Conclusions of this paper not only help to understand multi-instance learning better from the prospective of concept lattice, but also provide a new theoretical basis for data analysis and processing.

[1]  Masashi Aono,et al.  Interface of global and local semantics in a self-navigating system based on the concept lattice☆ , 2002 .

[2]  Ivan Bratko,et al.  Learning by Discovering Concept Hierarchies , 1999, Artif. Intell..

[3]  Xia Wang,et al.  Relations of attribute reduction between object and property oriented concept lattices , 2008, Knowl. Based Syst..

[4]  Yann Chevaleyre,et al.  Solving Multiple-Instance and Multiple-Part Learning Problems with Decision Trees and Rule Sets. Application to the Mutagenesis Problem , 2001, Canadian Conference on AI.

[5]  Yoav Freund,et al.  A decision-theoretic generalization of on-line learning and an application to boosting , 1997, EuroCOLT.

[6]  Leo Breiman,et al.  Bagging Predictors , 1996, Machine Learning.

[7]  Zhi-Hua Zhou,et al.  Ensembles of Multi-instance Learners , 2003, ECML.

[8]  Sally A. Goldman,et al.  Multiple-Instance Learning of Real-Valued Geometric Patterns , 2003, Annals of Mathematics and Artificial Intelligence.

[9]  Rokia Missaoui,et al.  Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory , 2002, J. Exp. Theor. Artif. Intell..

[10]  David D. Jensen,et al.  Identifying Predictive Structures in Relational Data Using Multiple Instance Learning , 2003, ICML.

[11]  Geoffrey I. Webb,et al.  MultiBoosting: A Technique for Combining Boosting and Wagging , 2000, Machine Learning.

[12]  Radim Belohlávek,et al.  A note on variable threshold concept lattices: Threshold-based operators are reducible to classical concept-forming operators , 2007, Inf. Sci..

[13]  Ashwin Srinivasan,et al.  Multi-instance tree learning , 2005, ICML.

[14]  Thomas Hofmann,et al.  Support Vector Machines for Multiple-Instance Learning , 2002, NIPS.

[15]  Sally A. Goldman,et al.  Multiple-Instance Learning of Real-Valued Data , 2001, J. Mach. Learn. Res..

[16]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[17]  Wen-Xiu Zhang,et al.  Variable threshold concept lattices , 2007, Inf. Sci..

[18]  Rudolf Wille,et al.  Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts , 2009, ICFCA.

[19]  Derek G. Bridge,et al.  Collaborative Recommending using Formal Concept Analysis , 2006, Knowl. Based Syst..

[20]  N. V. Vinodchandran,et al.  An extended kernel for generalized multiple-instance learning , 2004, 16th IEEE International Conference on Tools with Artificial Intelligence.

[21]  Qiang Wu,et al.  Real formal concept analysis based on grey-rough set theory , 2009, Knowl. Based Syst..

[22]  Thomas G. Dietterich,et al.  Solving the Multiple Instance Problem with Axis-Parallel Rectangles , 1997, Artif. Intell..