Abstract. In this paper, we use non-negative matrix factorization (NMF) to refine the document clustering results. NMF is a dimensional reduction method and effective for document clustering, because a term-document matrix is high-dimensional and sparse. The initial matrix of the NMF algorithm is regarded as a clustering result, therefore we can use NMF as a refinement method. First we perform min-max cut (Mcut), which is a powerful spectral clustering method, and then refine the result via NMF. Finally we should obtain an accurate clustering result. However, NMF often fails to improve the given clustering result. To overcome this problem, we use the Mcut object function to stop the iteration of NMF
International audienceNon-negative Matrix Factorization (NMF) and its variants have been successfull...
There are many search engines in the web and when asked, they return a long list of search results, ...
Nonnegative Matrix Factorization (NMF) has found a wide variety of applications in machine learning ...
PACLIC 21 / Seoul National University, Seoul, Korea / November 1-3, 2007conference pape
When document corpus is very large, we often need to reduce the number of features. But it is not po...
This dissertation shows that nonnegative matrix factorization (NMF) can be extended to a general and...
Document clustering without any prior knowledge or background information is a challenging problem. ...
In this paper, we propose a new ensemble document clustering method. The novelty of our method is th...
ABSTRAKSI: Seringkali, bila diberikan suatu koleksi dokumen, akan muncul kebutuhan untuk mengelompok...
Abstract—Nonnegative Matrix Factorization (NMF) is one of the most promising techniques to reduce th...
Clustering is a fundamental problem in unsupervised and semi-supervised machine learning. Besides cl...
Non-negative matrix factorization is a multivariate analysis method which is proven to be useful in ...
Conference: IEEE International Symposium on INnovations in Intelligent SysTems and Applications (INI...
Combining graph regularization with nonnegative matrix (tri-)factorization (NMF) has shown great per...
Non-negative Matrix Factorization (NMF) and Probabilistic Latent Semantic Indexing (PLSI) have been ...
International audienceNon-negative Matrix Factorization (NMF) and its variants have been successfull...
There are many search engines in the web and when asked, they return a long list of search results, ...
Nonnegative Matrix Factorization (NMF) has found a wide variety of applications in machine learning ...
PACLIC 21 / Seoul National University, Seoul, Korea / November 1-3, 2007conference pape
When document corpus is very large, we often need to reduce the number of features. But it is not po...
This dissertation shows that nonnegative matrix factorization (NMF) can be extended to a general and...
Document clustering without any prior knowledge or background information is a challenging problem. ...
In this paper, we propose a new ensemble document clustering method. The novelty of our method is th...
ABSTRAKSI: Seringkali, bila diberikan suatu koleksi dokumen, akan muncul kebutuhan untuk mengelompok...
Abstract—Nonnegative Matrix Factorization (NMF) is one of the most promising techniques to reduce th...
Clustering is a fundamental problem in unsupervised and semi-supervised machine learning. Besides cl...
Non-negative matrix factorization is a multivariate analysis method which is proven to be useful in ...
Conference: IEEE International Symposium on INnovations in Intelligent SysTems and Applications (INI...
Combining graph regularization with nonnegative matrix (tri-)factorization (NMF) has shown great per...
Non-negative Matrix Factorization (NMF) and Probabilistic Latent Semantic Indexing (PLSI) have been ...
International audienceNon-negative Matrix Factorization (NMF) and its variants have been successfull...
There are many search engines in the web and when asked, they return a long list of search results, ...
Nonnegative Matrix Factorization (NMF) has found a wide variety of applications in machine learning ...