z-logo
open-access-imgOpen Access
Best Approximate of Vector Space Model by Using SVD
Author(s) -
Raghad Mohammed Hadi
Publication year - 2018
Publication title -
al-mustansiriyah journal of science
Language(s) - English
Resource type - Journals
eISSN - 2521-3520
pISSN - 1814-635X
DOI - 10.23851/mjs.v28i2.509
Subject(s) - vector space model , computer science , cluster analysis , document clustering , data mining , rank (graph theory) , space (punctuation) , singular value decomposition , information retrieval , representation (politics) , task (project management) , vector space , text processing , the internet , artificial intelligence , mathematics , world wide web , engineering , geometry , systems engineering , combinatorics , politics , political science , law , operating system
A quick growth of internet technology makes it easy to assemble a huge volume of data as text document; e. g., journals, blogs, network pages, articles, email letters. In text mining application, increasing text space of datasets represent excessive task which makes it hard to pre-processing documents in efficient way to prepare it for text mining application like document clustering. The proposed system focuses on pre-processing document and reduction document space technique to prepare it for clustering technique. The mutual method for text mining problematic is vector space model (VSM), each term represent a features. Thus the proposed system create vector-space mod-el by using pre-processing method to reduce of trivial data from dataset. While the hug dimen-sionality of VSM is resolved by using low-rank SVD. Experiment results show that the proposed system give better document representation results about 10% from previous approach to prepare it for document clustering

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom