title: Maximum margin multiple instance clustering with applications to image and text clustering.
abstract: In multiple instance learning problems, patterns are often given as bags and each bag consists of some instances. Most of existing research in the area focuses on multiple instance classification and multiple instance regression, while very limited work has been conducted for multiple instance clustering (MIC). This paper formulates a novel framework, maximum margin multiple instance clustering (M(3)IC), for MIC. However, it is impractical to directly solve the optimization problem of M(3)IC. Therefore, M(3)IC is relaxed in this paper to enable an efficient optimization solution with a combination of the constrained concave-convex procedure and the cutting plane method. Furthermore, this paper presents some important properties of the proposed method and discusses the relationship between the proposed method and some other related ones. An extensive set of empirical results are shown to demonstrate the advantages of the proposed method against existing research for both effectiveness and efficiency.
authors: Department of Computer Science, Purdue University, West Lafayette, IN 47906, USA. danzhang2008@gmail.com
authors: Dan
authors: D
authors: Zhang
authors: Fei
authors: F
authors: Wang
authors: Luo
authors: L
authors: Si
authors: Tao
authors: T
authors: Li
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D007091:Image Processing, Computer-Assisted / Q000379:methods / Q000592:standards; D055641:Mathematical Concepts; D016571:Neural Networks, Computer; D010363:Pattern Recognition, Automated / Q000592:standards*; D012985:Software Design