Enhanced subspace clustering
Subspace clustering overcomes the curse of dimensionality that traditional clustering suffered, by finding groups of objects that are homogeneous in subspaces of the data, instead of the full space. Research on basic subspace clustering over the past decade primary focuses on finding groups of objec...
Saved in:
主要作者: | |
---|---|
其他作者: | |
格式: | Theses and Dissertations |
語言: | English |
出版: |
2012
|
主題: | |
在線閱讀: | http://hdl.handle.net/10356/48647 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |