Spectral active clustering via purification of the K-Nearest neighbor graph

Caiming Xiong, David Johnson, Jason Corso

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

20 Scopus citations

Abstract

Spectral clustering is widely used in data mining, machine learning and pattern recognition. There have been some recent developments in adding pairwise constraints as side information to enforce top-down structure into the clustering results. However, most of these algorithms are "passive" in the sense that the side information is provided beforehand. In this paper, we present a spectral active clustering method that actively selects pairwise constraints based on a novel no tion of node uncertainty rather than pair uncertainty. In our approach, the constraints are used to drive a purification process on the k-nearest neighbor graph - edges are rem oved from the graph ba sed on the constraints - that ultimately leads to an improved, constraint-satisfied clustering. We have evaluated our framework on three datasets (UCI, gene and image sets) in the context of baseline and state of the art methods and find the proposed algorithm to be superiorly effective.

Original languageEnglish
Title of host publicationProceedings of the IADIS International Conference Intelligent Systems and Agents 2012, ISA 2012, IADIS European Conference on Data Mining 2012, ECDM 2012
Pages133-141
Number of pages9
StatePublished - 2012
EventIADIS International Conference Intelligent Systems and Agents 2012, ISA 2012, IADIS European Conference on Data Mining 2012, ECDM 2012, Part of the IADIS Multi Conference on Computer Science and Information Systems 2012, MCCSIS 2012 - Lisbon, Portugal
Duration: 21 Jul 201223 Jul 2012

Publication series

NameProceedings of the IADIS International Conference Intelligent Systems and Agents 2012, ISA 2012, IADIS European Conference on Data Mining 2012, ECDM 2012

Conference

ConferenceIADIS International Conference Intelligent Systems and Agents 2012, ISA 2012, IADIS European Conference on Data Mining 2012, ECDM 2012, Part of the IADIS Multi Conference on Computer Science and Information Systems 2012, MCCSIS 2012
Country/TerritoryPortugal
CityLisbon
Period21/07/1223/07/12

Keywords

  • Active clustering
  • KNN Graph
  • Purification
  • Spectral clustering

Fingerprint

Dive into the research topics of 'Spectral active clustering via purification of the K-Nearest neighbor graph'. Together they form a unique fingerprint.

Cite this