Batch steepest-descent-mildest-ascent for interactive maximum margin clustering

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The maximum margin clustering principle extends support vector machines to unsupervised scenarios. We present a variant of this clustering scheme that can be used in the context of interactive clustering scenarios. In particular, our approach permits the class ratios to be manually defined by the user during the fitting process. Our framework can be used at early stages of the data mining process when no or very little information is given about the true clusters and class ratios. One of the key contributions is an adapted steepest-descent-mildest-ascent optimization scheme that can be used to fine-tune maximum margin clustering solutions in an interactive manner. We demonstrate the applicability of our approach in the context of remote sensing and astronomy with training sets consisting of hundreds of thousands of patterns.

Cite

CITATION STYLE

APA

Gieseke, F., Pahikkala, T., & Heskes, T. (2015). Batch steepest-descent-mildest-ascent for interactive maximum margin clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9385, pp. 95–107). Springer Verlag. https://doi.org/10.1007/978-3-319-24465-5_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free