• DocumentCode
    3264772
  • Title

    A New Semi-Supervised Subspace Clustering Algorithm on Fitting Mixture Models

  • Author

    Kim, Young Bun ; Gao, Jean

  • Author_Institution
    Department of Computer Science and Engineering The University of Texas Arlington, TX 76019, USA, Email: kim@cse.uta.edu
  • fYear
    2005
  • fDate
    14-15 Nov. 2005
  • Firstpage
    1
  • Lastpage
    8
  • Abstract
    We propose a new subspace clustering algorithm (EPSCMIX), which is based on the feature saliency measure that is obtained by using both the Emerging Patterns algorithm and the EM algorithm, for the analysis of microarray data. For the model selection, it employs a novel agglomerative step together with MDL criterion. And, we present the result of comparative experiments between AIC, MDL and minimum message length (MML) used to determine a criterion for our algorithm. The robustness of using emerging patterns based on mixture models, as well as using the Gaussian mixture model for subspace clustering, was demonstrated on both synthetic and real data sets. In experiments, it also certified that a new agglomerative method that merges mostly correlated components with MDL consistently worked better than the one that removes weak weight components.
  • Keywords
    Algorithm design and analysis; Bayesian methods; Clustering algorithms; Computer science; Convergence; Data analysis; Data engineering; Maximum likelihood estimation; Pattern analysis; Robustness;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Intelligence in Bioinformatics and Computational Biology, 2005. CIBCB '05. Proceedings of the 2005 IEEE Symposium on
  • Print_ISBN
    0-7803-9387-2
  • Type

    conf

  • DOI
    10.1109/CIBCB.2005.1594919
  • Filename
    1594919