Name
Abstract | ||
|---|---|---|
Clustering, classification, and regression, are three major research topics in machine learning. So far, much work has been conducted in solving multiple instance classification and multiple instance regression problems, where supervised training patterns are given as bags and each bag consists of some instances. But the research on unsupervised multiple instance clustering is still limited. This paper formulates a novel Maximum Margin Multiple Instance Clustering (M3IC) problem for the multiple instance clustering task. To avoid solving a nonconvex optimization problem directly, M3IC is further relaxed, which enables an efficient optimization solution with a combination of Constrained Concave-Convex Procedure (CCCP) and the Cutting Plane method. Furthermore, this paper analyzes some important properties of the proposed method and the relationship between the proposed method and some other related ones. An extensive set of empirical results demonstrate the advantages of the proposed method against existing research for both effectiveness and efficiency. |
Year | Venue | Keywords |
|---|---|---|
2009 | IJCAI | maximum margin,multiple instance regression problem,nonconvex optimization problem,major research topic,unsupervised multiple instance clustering,Plane method,multiple instance classification,multiple instance,Multiple Instance Clustering,efficient optimization solution,proposed method |
DocType | Citations | PageRank |
Conference | 5 | 0.42 |
References | Authors | |
6 | 4 | |