Clustering and Latent Semantic Indexing Aspects of the Nonnegative Matrix Factorization

Computer Science – Learning

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

28 pages, 5 figures

Scientific paper

This paper provides a theoretical support for clustering aspect of the nonnegative matrix factorization (NMF). By utilizing the Karush-Kuhn-Tucker optimality conditions, we show that NMF objective is equivalent to graph clustering objective, so clustering aspect of the NMF has a solid justification. Different from previous approaches which usually discard the nonnegativity constraints, our approach guarantees the stationary point being used in deriving the equivalence is located on the feasible region in the nonnegative orthant. Additionally, since clustering capability of a matrix decomposition technique can sometimes imply its latent semantic indexing (LSI) aspect, we will also evaluate LSI aspect of the NMF by showing its capability in solving the synonymy and polysemy problems in synthetic datasets. And more extensive evaluation will be conducted by comparing LSI performances of the NMF and the singular value decomposition (SVD), the standard LSI method, using some standard datasets.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Clustering and Latent Semantic Indexing Aspects of the Nonnegative Matrix Factorization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Clustering and Latent Semantic Indexing Aspects of the Nonnegative Matrix Factorization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clustering and Latent Semantic Indexing Aspects of the Nonnegative Matrix Factorization will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-171263

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.