Keyword extraction for very high dimensional datasets using random projection as key input representation scheme
Keywords are increasingly useful as users are faced with the challenge of keeping up with voluminous information that they need to process every day. The most straightforward way for extracting keywords is to compute for the term frequencies for each document. But when dealing with corpora containin...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
2011
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_masteral/6649 https://animorepository.dlsu.edu.ph/context/etd_masteral/article/12928/viewcontent/CDTG004899_P.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| Summary: | Keywords are increasingly useful as users are faced with the challenge of keeping up with voluminous information that they need to process every day. The most straightforward way for extracting keywords is to compute for the term frequencies for each document. But when dealing with corpora containing hundreds of thousands of unique terms, the huge amount of space needed and the enormous amount of computing time required to eventually extract the most relevant terms as keywords would severely limit the practical implementation of current keyword extraction techniques. As such, the frequency counts of extracted terms need to be subjected to a data compression scheme. In this research, the random projection method is used to compress the extracted data and the method allows for various clustering and keyword extraction algorithms to be done directly on the compressed data. Several experiments are conducted to assess the effect of the random projection method on the quality and time-space efficiency of the k-means clustering and term extraction. |
|---|