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

Fabian Gieseke, Tapio Pahikkala, Tom Heskes

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationAdvances in Intelligent Data Analysis XIV : 14th International Symposium, IDA 2015, Saint Etienne. France, October 22 -24, 2015. Proceedings
EditorsElisa Fromont, Tijl De Bie, Matthijs van Leeuwen
Number of pages13
PublisherSpringer
Publication date2015
Pages95-107
ISBN (Print)978-3-319-24464-8
ISBN (Electronic)978-3-319-24465-5
DOIs
Publication statusPublished - 2015
Externally publishedYes
Event14th International Symposium on Advances in Intelligent Data Analysis - Saint Etienne, France
Duration: 22 Oct 201524 Oct 2015
Conference number: 14

Conference

Conference14th International Symposium on Advances in Intelligent Data Analysis
Number14
Country/TerritoryFrance
CitySaint Etienne
Period22/10/201524/10/2015
SeriesLecture notes in computer science
Volume9385
ISSN0302-9743

Fingerprint

Dive into the research topics of 'Batch steepest-descent-mildest-ascent for interactive maximum margin clustering'. Together they form a unique fingerprint.

Cite this