• DocumentCode
    1728779
  • Title

    Uncertainty Sampling for Constrained Cluster Ensemble

  • Author

    Okabe, Masayuki ; Yamada, Shigeru

  • Author_Institution
    Inf. & Media Center, Toyohashi Univ. of Technol., Toyohashi, Japan
  • fYear
    2013
  • Firstpage
    257
  • Lastpage
    262
  • Abstract
    Constrained Clustering is a framework of improving clustering performance by using a set of constraints about data pairs. Since performance of constrained clustering depends on a set of constraints to use, we need a method to select good constraints that are expected to promote clustering performance. In this paper, we propose such a method, which actively selects data pairs to be constrained by using variance of clustering iteration. This method consists of a boosting based cluster ensemble algorithm that integrates a set of clusters produced by a constrained k-means with controlled data assignment order. Experimental results show that our method outperforms clustering with random sampling method.
  • Keywords
    iterative methods; pattern clustering; sampling methods; boosting based cluster ensemble algorithm; clustering iteration; clustering performance; constrained cluster ensemble; constrained k-means; controlled data assignment order; data pairs; random sampling method; uncertainty sampling; Boosting; Clustering algorithms; Kernel; Measurement uncertainty; Training data; Uncertainty; active learning; cluster ensemble; constrained clustering; uncertainty sampling;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Technologies and Applications of Artificial Intelligence (TAAI), 2013 Conference on
  • Conference_Location
    Taipei
  • Print_ISBN
    978-1-4799-2528-5
  • Type

    conf

  • DOI
    10.1109/TAAI.2013.58
  • Filename
    6783877