A clustering scheme for large high-dimensional document datasets
碩士 === 國立中山大學 === 電機工程學系研究所 === 95 === Peoples pay more and more attention on document clustering methods. Because of the high dimension and the large number of data, clustering methods usually need a lot of time to calculate. We propose a scheme to make the clustering algorithm much faster then ori...
Main Authors: | Jing-wen Chen, 陳經文 |
---|---|
Other Authors: | Shie-jue Lee |
Format: | Others |
Language: | zh-TW |
Published: |
2007
|
Online Access: | http://ndltd.ncl.edu.tw/handle/bsr4gq |
Similar Items
-
Visualization of Clustering Solutions for Large Multi-dimensional Sequential Datasets
by: Dornala, Maninder
Published: (2018) -
High-Dimensional Clustering for Incomplete Mixed Dataset Using Artificial Intelligence
by: Meishan Li, et al.
Published: (2020-01-01) -
FINDING INTERESTING SUBSPACE CLUSTERS FROM HIGH DIMENSIONAL DATASETS
by: BIAN, HAIYUN
Published: (2006) -
A highly efficient multi-core algorithm for clustering extremely large datasets
by: Kraus Johann M, et al.
Published: (2010-04-01) -
Pattern Recognition in Large Dimensional and Structured Datasets
by: Kurra, Goutham
Published: (2002)