<学術雑誌論文>
A Robust K-Means for Document Clustering

作成者
本文言語
出版者
発行日
収録物名
開始ページ
終了ページ
出版タイプ
アクセス権
関連DOI
概要 We propose a robust K-means clustering algorithm for document clustering, where we suppose that a document-term matrix is given as an input dataset, and the documents in the dataset are clustered on t...he basis of the frequency of terms that occur in each document. We introduce a robust loss function to K-means clustering to obtain its robust version, and also propose a feature transform method for improving the performance of document clustering. Experimental results show that the proposed method improves the robustness of K-means to outliers and the performance of document clustering demonstrated on one of the BBC datasets originating from the BBC News.続きを見る

本文情報を非表示

211-1439-2-PB pdf 2.94 MB 211  

詳細

PISSN
EISSN
レコードID
主題
助成情報
登録日 2018.05.07
更新日 2018.08.01

この資料を見た人はこんな資料も見ています