Skip to main navigation Skip to search Skip to main content

Kernel Clustering: Density Biases and Solutions

  • Western University

Research output: Contribution to journal › Journal Article › peer-review

48 Citations (Scopus)

Abstract

Kernel methods are popular in clustering due to their generality and discriminating power. However, we show that many kernel clustering criteria have density biases theoretically explaining some practically significant artifacts empirically observed in the past. For example, we provide conditions and formally prove the density mode isolation bias in kernel K-means for a common class of kernels. We call it Breiman's bias due to its similarity to the histogram mode isolation previously discovered by Breiman in decision tree learning with Gini impurity. We also extend our analysis to other popular kernel clustering methods, e.g., average/normalized cut or dominant sets, where density biases can take different forms. For example, splitting isolated points by cut-based criteria is essentially the sparsest subset bias, which is the opposite of the density mode bias. Our findings suggest that a principled solution for density biases in kernel clustering should directly address data inhomogeneity. We show that density equalization can be implicitly achieved using either locally adaptive weights or locally adaptive kernels. Moreover, density equalization makes many popular kernel clustering objectives equivalent. Our synthetic and real data experiments illustrate density biases and proposed solutions. We anticipate that theoretical understanding of kernel clustering limitations and their principled solutions will be important for a broad spectrum of data analysis applications across the disciplines.

Original languageEnglish
Article number8166757
Pages (from-to)136-147
Number of pages12
JournalIEEE Transactions on Pattern Analysis and Machine Intelligence
Volume41
Issue number1
DOIs
Publication statusPublished - 1 Jan 2019

Keywords

  • Kernel methods
  • average association
  • average cut
  • dominant set
  • kernel clustering
  • kernel k-means
  • normalized cut

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition
  • Computational Theory and Mathematics
  • Artificial Intelligence
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Kernel Clustering: Density Biases and Solutions'. These topics are generated from the title and abstract of the publication. Together, they form a unique fingerprint.

Cite this