M3IC: Maximum margin multiple instance clustering

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2009, Pages 1339-1344

  Zhang, Dan ^a   Wang, Fei ^b   Si, Luo ^a   Li, Tao ^b  

^a Purdue University   (United States)

^b FLORIDA INTERNATIONAL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

CONSTRAINED CONCAVE-CONVEX PROCEDURES; CUTTING PLANE METHODS; EFFECTIVENESS AND EFFICIENCIES; MULTIPLE INSTANCES; NONCONVEX OPTIMIZATION PROBLEM; OPTIMIZATION SOLUTION; REGRESSION PROBLEM; SUPERVISED TRAININGS;

CONSTRAINED OPTIMIZATION;

EID: 78751693866     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. S. Andrews, I. Tsochantaridis, and T. Hofmann. Support vector machines for multiple-instance learning. In Advances in Neural Information Processing Systems, pages 561-568, Cambridge, MA: MIT Press., 2003.
2. T. G. Dietterich, R. H. Lathrop, and T. Lozano-Perez. Solving the multiple instance problem with axis-parallel rectangles. In Artificial Inteligence, pages 1-8, 1998.
3. Jiawei Han and Micheline Kamber. Data Mining. Morgan Kaufmann Publishers, 2001.
4. Anil K. Jain and Richard C. Dubes. Algorithms for clustering data. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1988.
5. T. Joachims. Training linear SVMs in linear time. In Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 217-226. ACM New York, NY, USA, 2006.
6. JE Kelley. The cutting plane method for solving convex programs. Journal of the SIAM, 8(4):703-712, 1960.
7. R. Rahmani and S. A. Goldman. Missl: Multiple-instance semi-supervised learning. In International Conference on Machine Learning, volume 10, pages 705-712, Pittsburgh, PA., 2006.
8. A.J. Smola, SVN Vishwanathan, and T. Hofmann. Kernel methods for missing variables. In Proceedings of the Tenth International Workshop on Artificial Intelligence and Statistics, 2005.
9. H. Valizadegan and R. Jin. Generalized Maximum Margin Clustering and Unsupervised Kernel Learning. Advances in Neural Information Processing Systems, 2006.
10. J. Wang and J.D. Zucker. Solving the Multiple-Instance Problem: A Lazy Learning Approach. In International Conference on Machine Learning, 2000.
11. L. Xu, J. Neufeld, B. Larson, and D. Schuurmans. Maximum margin clustering. Advances in Neural Information Processing Systems, 17:1537-1544, 2005.
12. M.-L. Zhang and Z.-H. Zhou. Multi-instance clustering with applications to multiinstance prediction. Applied Intelligence, in press.
13. B. Zhao, F. Wang, and C. Zhang. Cuts3vm: a fast semi-supervised svm algorithm. 2008.
14. B. Zhao, F. Wang, and C. Zhang. Efficient maximum margin clustering via cutting plane algorithm. In The 8th SIAM International Conference on Data Mining, pages 751-762, 2008.
15. B. Zhao, F. Wang, and C. Zhang. Efficient multiclass maximum margin clustering. The 25th International Conference on Machine Learning, pages 751-762, 2008.