ACM Home Page
Please provide us with feedback. Feedback
Fast evolutionary maximum margin clustering
Full text PdfPdf (1.03 MB)
Source ACM International Conference Proceeding Series; Vol. 382 archive
Proceedings of the 26th Annual International Conference on Machine Learning table of contents
Montreal, Quebec, Canada
Pages 361-368  
Year of Publication: 2009
ISBN:978-1-60558-516-1
Authors
Fabian Gieseke  TU Dortmund, Germany
Tapio Pahikkala  University of Turku, Finland
Oliver Kramer  TU Dortmund, Germany
Sponsors
: MITACS
: NSF
Microsoft Research : Microsoft Research
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 42,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1553374.1553421
What is a DOI?

ABSTRACT

The maximum margin clustering approach is a recently proposed extension of the concept of support vector machines to the clustering problem. Briefly stated, it aims at finding an optimal partition of the data into two classes such that the margin induced by a subsequent application of a support vector machine is maximal. We propose a method based on stochastic search to address this hard optimization problem. While a direct implementation would be infeasible for large data sets, we present an efficient computational shortcut for assessing the "quality" of intermediate solutions. Experimental results show that our approach outperforms existing methods in terms of clustering accuracy.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Adankon, M. M., & Cheriet, M. (2007). Learning semi-supervised svm with genetic algorithm. Proc. International Joint Conference on Neural Networks (pp. 1825--1830).
 
2
Bach, F., & Harchaoui, Z. (2008). Diffrac: a discriminative and flexible framework for clustering. Adv. in Neural Information Proc. Systems 20 (pp. 49--56).
 
3
 
4
Chang, C.-C., & Lin, C.-J. (2001). LIBSVM: a library for support vector machines. Software available at http://www.csie.ntu.edu.tw/~cjlin/libsvm.
 
5
Golub, G. H., & Van Loan, C. (1989). Matrix computations. Baltimore and London: Johns Hopkins University Press. Second edition.
 
6
Hartigan, J. A., & Wong, M. A. (1979). A K-means clustering algorithm. Applied Statistics, 28, 100--108.
 
7
 
8
Rifkin, R., Yeo, G., & Poggio, T. (2003). Regularized least-squares classification. In Adv. in learning theory: Methods, models and applications. IOS Press.
 
9
 
10
 
11
 
12
 
13
 
14
Valizadegan, H., & Jin, R. (2007). Generalized maximum margin clustering and unsupervised kernel learning. Adv. in Neural Information Proc. Systems 19 (pp. 1417--1424).
 
15
Vapnik, V. (1998). Statistical learning theory. New York: Wiley.
 
16
Xu, L., Neufeld, J., Larson, B., & Schuurmans, D. (2005). Maximum margin clustering. Adv. in Neural Information Proc. Systems 17 (pp. 1537--1544).
 
17
Xu, L., & Schuurmans, D. (2005). Unsupervised and semi-supervised multi-class support vector machines. Proc. National Conference on Artificial Intelligence (pp. 904--910).
18
 
19
Zhao, B., Wang, F., & Zhang, C. (2008a). Efficient maximum margin clustering via cutting plane algorithm. Proc. SIAM International Conference on Data Mining (pp. 751--762).
20

Collaborative Colleagues:
Fabian Gieseke: colleagues
Tapio Pahikkala: colleagues
Oliver Kramer: colleagues