ACM Home Page
Please provide us with feedback. Feedback
Orthogonal nonnegative matrix t-factorizations for clustering
Full text PdfPdf (743 KB)
Source International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Philadelphia, PA, USA
SESSION: Research track papers table of contents
Pages: 126 - 135  
Year of Publication: 2006
ISBN:1-59593-339-5
Authors
Chris Ding  Lawrence Berkeley National Laboratory, Berkeley, CA
Tao Li  Florida International University, Miami, FL
Wei Peng  Florida International University, Miami, FL
Haesun Park  Georgia Institute of Technology, Atlanta, GA
Sponsors
ACM: Association for Computing Machinery
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 29,   Downloads (12 Months): 187,   Citation Count: 24
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1150402.1150420
What is a DOI?

ABSTRACT

Currently, most research on nonnegative matrix factorization (NMF)focus on 2-factor $X=FG^T$ factorization. We provide a systematicanalysis of 3-factor $X=FSG^T$ NMF. While it unconstrained 3-factor NMF is equivalent to it unconstrained 2-factor NMF, itconstrained 3-factor NMF brings new features to it constrained 2-factor NMF. We study the orthogonality constraint because it leadsto rigorous clustering interpretation. We provide new rules for updating $F,S, G$ and prove the convergenceof these algorithms. Experiments on 5 datasets and a real world casestudy are performed to show the capability of bi-orthogonal 3-factorNMF on simultaneously clustering rows and columns of the input datamatrix. We provide a new approach of evaluating the quality ofclustering on words using class aggregate distribution andmulti-peak distribution. We also provide an overview of various NMF extensions andexamine their relationships.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
J.-P. Brunet, P. Tamayo, T. R. Golub, and J. P. Mesirov. Metagenes and molecular pattern discovery using matrix factorization. Proc. Nat'l Academy of Sciences USA, 102(12):4164--4169, 2004.
 
4
M. Chessell. Specification: Common base event, 2003. http://www-128.ibm.com/developerworks/webservices/library/ws-cbe/.
 
5
M. Cooper and J. Foote. Summarizing video using non-negative similarity matrix factorization. In Proc. IEEE Workshop on Multimedia Signal Processing, pages 25--28, 2002.
 
6
7
8
 
9
C. Ding, X. He, and H. D. Simon. On the equivalence of nonnegative matrix factorization and spectral clustering. Proc. SIAM Data Mining Conf, 2005.
 
10
 
11
C. Ding, T. Li, and M. Jordan. Convex and semi-nonnegative matrix factorizations for clustering and low-dimension representation. Technical Report LBNL-60428, Lawrence Berkeley National Laboratory, University of California, Berkeley, 2006.
 
12
C. Ding, T. Li, and W. Peng. Nonnegative matrix factorization and probabilistic latent semantic indexing: Equivalence, chi-square statistic, and a hybrid method. In AAAI, 2006.
13
 
14
T. Hofmann. Probabilistic latent semantic analysis. In UAI, pages 289--296, 1999.
 
15
 
16
17
 
18
D. D. Lee and H. S. Seung. Learning the parts of objects by non-negative matrix factorization. Nature, 401:788--791, 1999.
 
19
D. D. Lee and H. S. Seung. Algorithms for non-negatvie matrix factorization. In NIPS 13, 2001.
 
20
S. Z. Li, X. Hou, H. Zhang, and Q. Cheng. Learning spatially localized, parts-based representation. In Proceedings of IEEE Computer Vision and Pattern Recognition, pages 207--212, 2001.
21
22
23
24
 
25
A. K. McCallum. Bow: A toolkit for statistical language modeling, text retrieval, classification and clustering. http://www.cs.cmu.edu/ mccallum/bow, 1996.
 
26
G. W. Milligan and M. C. Cooper. A study of the comparability of external criteria for hierarchical cluster analysis. Multivar Behav Res, 21:846--850, 1986.
 
27
P. Paatero and U. Tapper. Positive matrix factorization: A non-negative factor model with optimal utilization of error estimates of data values. Environmetrics, 5:111--126, 1994.
 
28
H. Park and P. Howland. Generalizing discriminant analysis using the generalized singular value decomposition. IEEE. Trans. on Pattern Analysis and Machine Intelligence, 26:995--1006, 2004.
 
29
W. M. Rand. Objective criteria for the evaluation of clustering methods. J Am Stat Assoc, 66:846--850, 1971.
 
30
F. Sha, L. K. Saul, and D. D. Lee. Multiplicative updates for nonnegative quadratic programming in support vector machines. In NIPS 15, pages 1041--1048. 2003.
 
31
32
 
33
D. Zeimpekis and E. Gallopoulos. Clsi: A flexible approximation scheme from clustered term-document matrices. Proc. SIAM Data Mining Conf, pages 631--635, 2005.
 
34
H. Zha, C. Ding, M. Gu, X. He, and H. D. Simon. Spectral relaxation for K-means clustering. NIPS 14, pages 1057--1064, 2002.
35
 
36

CITED BY  25

Collaborative Colleagues:
Chris Ding: colleagues
Tao Li: colleagues
Wei Peng: colleagues
Haesun Park: colleagues