• DocumentCode
    2456398
  • Title

    Constrained Nonnegative Tensor Factorization for Clustering

  • Author

    Peng, Wei

  • Author_Institution
    Xerox Innovation Group, Xerox Corp., Webster, NY, USA
  • fYear
    2010
  • fDate
    12-14 Dec. 2010
  • Firstpage
    954
  • Lastpage
    957
  • Abstract
    Constrained clustering through matrix factorization has been shown to largely improve clustering accuracy by incorporating prior knowledge into the factorization process. Although it has been well studied, none of them deal with constrained multi-way data factorization. Multi-way data or Tensors are encoded as high-order data structures. They can be seen as the generalization of matrices. One typical tensor is multiple two-way data/matrices in different time periods. To the best of our knowledge, this paper is the first work developing two general formulation of constrained nonnegative tensor factorization. An extensive experiment conducts a comparative study on the proposed constrained nonnegative tensor factorization and other state-of-the-art algorithms.
  • Keywords
    data mining; data structures; matrix algebra; pattern clustering; constrained clustering; constrained nonnegative tensor factorization; data structures; factorization process; matrix factorization; multiway data factorization; state-of-the-art algorithms; Accuracy; Clustering algorithms; Clustering methods; Data analysis; Data mining; Matrix decomposition; Tensile stress; clustering; constraint; factorization; multi-way; nonnegative; tensor;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Machine Learning and Applications (ICMLA), 2010 Ninth International Conference on
  • Conference_Location
    Washington, DC
  • Print_ISBN
    978-1-4244-9211-4
  • Type

    conf

  • DOI
    10.1109/ICMLA.2010.152
  • Filename
    5708975