2008 SimultaneousTensorSubspaceSelec

• (Huang et al., 2008) ⇒ Heng Huang, Chris Ding, Dijun Luo, and Tao Li. (2008). “Simultaneous Tensor Subspace Selection and Clustering: The Equivalence of High Order Svd and K-means Clustering.” In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2008). doi:10.1145/1401890.1401933

Subject Headings:

Cited By

• http://scholar.google.com/scholar?q=%22Simultaneous+tensor+subspace+selection+and+clustering%3A+the+equivalence+of+high+order+svd+and+k-means+clustering%22+2008
• http://portal.acm.org/citation.cfm?doid=1401890.1401933&preflayout=flat#citedby

Quotes

Abstract

Singular Value Decomposition (SVD)/Principal Component Analysis (PCA) have played a vital role in finding patterns from many datasets. Recently tensor factorization has been used for data mining and pattern recognition in high index/order data. High Order SVD (HOSVD) is a commonly used tensor factorization method and has recently been used in numerous applications like graphs, videos, social networks, etc.

In this paper we prove that HOSVD does simultaneous subspace selection (data compression) and K-means clustering widely used for unsupervised learning tasks. We show how to utilize this new feature of HOSVD for clustering. We demonstrate these new results using three real and large datasets, two on face images datasets and one on hand-written digits dataset. Using this new HOSVD clustering feature we provide a dataset quality assessment on many frequently used experimental datasets with expected noise levels.

References

,

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2008 SimultaneousTensorSubspaceSelec	Chris Ding Tao Li Heng Huang Dijun Luo			Simultaneous Tensor Subspace Selection and Clustering: The Equivalence of High Order Svd and K-means Clustering				10.1145/1401890.1401933