• DocumentCode
    3726564
  • Title

    Maximum Clusterability Divisive Clustering

  • Author

    David Hofmeyr;Nicos Pavlidis

  • Author_Institution
    Dept. of Math. &
  • fYear
    2015
  • Firstpage
    780
  • Lastpage
    786
  • Abstract
    The notion of cluster ability is often used to determine how strong the cluster structure within a set of data is, as well as to assess the quality of a clustering model. In multivariate applications, however, the cluster ability of a data set can be obscured by irrelevant or noisy features. We study the problem of finding low dimensional projections which maximise the cluster ability of a data set. In particular, we seek low dimensional representations of the data which maximise the quality of a binary partition. We use this bi-partitioning recursively to generate high quality clustering models. We illustrate the improvement over standard dimension reduction and clustering techniques, and evaluate our method in experiments on real and simulated data sets.
  • Keywords
    "Context","Data models","Clustering algorithms","Approximation algorithms","Context modeling","Partitioning algorithms","Optimization"
  • Publisher
    ieee
  • Conference_Titel
    Computational Intelligence, 2015 IEEE Symposium Series on
  • Print_ISBN
    978-1-4799-7560-0
  • Type

    conf

  • DOI
    10.1109/SSCI.2015.116
  • Filename
    7376691