A4 Refereed article in a conference publication

Batch Steepest-Descent-Mildest-Ascent for Interactive Maximum Margin Clustering




AuthorsFabian Gieseke, Tapio Pahikkala, Tom Heskes

EditorsElisa Fromont, Tijl De Bie, Matthijs van Leeuwen

Conference nameInternational Symposium on Intelligent Data Analysis

Publication year2015

Book title Advances in Intelligent Data Analysis XIV

Series titleLecture Notes in Computer Science

Number in series9385

Volume9385

First page 95

Last page107

Number of pages13

ISBN978-3-319-24464-8

ISSN0302-9743

DOIhttps://doi.org/10.1007/978-3-319-24465-5_9


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.



Last updated on 2024-26-11 at 14:11