Text term weighting approach based on latent semantic indexing

2008 ◽  
Vol 28 (6) ◽  
pp. 1460-1462
Author(s):  
Yuan-yuan LI
Keyword(s):  
Latent Semantic Indexing ◽  
Semantic Indexing ◽  
Term Weighting

Perangkingan Dokumen Berbahasa Arab Menggunakan Latent Semantic Indexing

2015 ◽  
Vol 6 (2) ◽  
Author(s):  
Aminul Wahib ◽  
Pasnur Pasnur ◽  
Putu Praba Santika ◽  
Agus Zainal Arifin
Keyword(s):  
Vector Space ◽  
Latent Semantic Indexing ◽  
Cosine Similarity ◽  
Semantic Indexing ◽  
Term Weighting ◽  
F Measure

Berbagai metode perangkingan dokumen dalam aplikasi InformationRetrieval telah dikembangkan dan diimplementasikan. Salah satu metode yangsangat populer adalah perangkingan dokumen menggunakan vector space modelberbasis pada nilai term weighting TF.IDF. Metode tersebut hanya melakukanpembobotan term berdasarkan frekuensi kemunculannya pada dokumen tanpamemperhatikan hubungan semantik antar term. Dalam kenyataannya hubungansemantik antar term memiliki peranan penting untuk meningkatkan relevansi hasilpencarian dokumen. Penelitian ini mengembangkan metode TF.IDF.ICF.IBFdengan menambahkan Latent Semantic Indexing untuk menemukan hubungansemantik antar term pada kasus perangkingan dokumen berbahasa Arab. Datasetyang digunakan diambil dari kumpulan dokumen pada perangkat lunak MaktabahSyamilah. Hasil pengujian menunjukkan bahwa metode yang diusulkanmemberikan nilai evaluasi yang lebih baik dibandingkan dengan metodeTF.IDF.ICF.IBF. Secara berurut nilai f-measure metode TF.IDF.ICF.IBF.LSIpada ambang cosine similarity 0,3, 0,4, dan 0,5 adalah 45%, 51%, dan 60%. Namun metode yang disulkan memiliki waktu komputasi rata-rata lebih tinggidibandingkan dengan metode TF.IDF.ICF.IBF sebesar 2 menit 8 detik.

Optimising the Heuristics in Latent Semantic Indexing for Effective Information Retrieval

2006 ◽  
Vol 05 (02) ◽  
pp. 97-105 ◽  
Author(s):  
S. Srinivas ◽  
Ch. AswaniKumar
Keyword(s):  
Information Retrieval ◽  
Vector Space ◽  
Vector Space Model ◽  
Latent Semantic Indexing ◽  
Semantic Indexing ◽  
Retrieval Performance ◽  
Term Weighting ◽  
Space Model ◽  
Rank Approximation

Latent Semantic Indexing (LSI) is a famous Information Retrieval (IR) technique that tries to overcome the problems of lexical matching using conceptual indexing. LSI is a variant of vector space model and proved to be 30% more effective. Many studies have reported that good retrieval performance is related to the use of various retrieval heuristics. In this paper, we focus on optimising two LSI retrieval heuristics: term weighting and rank approximation. The results obtained demonstrate that the LSI performance improves significantly with the combination of optimised term weighting and rank approximation.

scholarly journals Source Code Classification using Latent Semantic Indexing with Structural and Frequency Term Weighting

2012 ◽  
Vol 7 (5) ◽  
pp. 266-271
Author(s):  
Yuhanis Yusof ◽  
Taha Alhersh ◽  
Massudi Mahmuddin ◽  
Aniza Mohamed Din
Keyword(s):  
Source Code ◽  
Latent Semantic Indexing ◽  
Semantic Indexing ◽  
Term Weighting ◽  
Frequency Term

Analyzing Large-Scale Proteomics Projects with Latent Semantic Indexing

2008 ◽  
Vol 7 (1) ◽  
pp. 182-191 ◽  
Author(s):  
Sebastian Klie ◽  
Lennart Martens ◽  
Juan Antonio Vizcaíno ◽  
Richard Côté ◽  
Phil Jones ◽  
...  
Keyword(s):  
Large Scale ◽  
Latent Semantic Indexing ◽  
Semantic Indexing

A Method Based on Support Vector Machine for Feature Selection of Latent Semantic Features

2011 ◽  
Vol 181-182 ◽  
pp. 830-835
Author(s):  
Min Song Li
Keyword(s):  
Support Vector Machine ◽  
Text Categorization ◽  
Latent Semantic Indexing ◽  
Classification Performance ◽  
Compact Representation ◽  
Support Vector ◽  
Semantic Features ◽  
Semantic Indexing ◽  
Feature Extraction Method ◽  
Feature Subspace

Latent Semantic Indexing(LSI) is an effective feature extraction method which can capture the underlying latent semantic structure between words in documents. However, it is probably not the most appropriate for text categorization to use the method to select feature subspace, since the method orders extracted features according to their variance,not the classification power. We proposed a method based on support vector machine to extract features and select a Latent Semantic Indexing that be suited for classification. Experimental results indicate that the method improves classification performance with more compact representation.

Biomedical Document Clustering Based on Accelerated Symbiotic Organisms Search Algorithm

2021 ◽  
Vol 12 (4) ◽  
pp. 169-185
Author(s):  
Saida Ishak Boushaki ◽  
Omar Bendjeghaba ◽  
Nadjet Kamel
Keyword(s):  
Clustering Algorithm ◽  
Search Algorithm ◽  
Clustering Algorithms ◽  
Document Clustering ◽  
Latent Semantic Indexing ◽  
Research Area ◽  
Semantic Indexing ◽  
Local Optima ◽  
Symbiotic Organisms Search ◽  
Symbiotic Organisms

Clustering is an important unsupervised analysis technique for big data mining. It finds its application in several domains including biomedical documents of the MEDLINE database. Document clustering algorithms based on metaheuristics is an active research area. However, these algorithms suffer from the problems of getting trapped in local optima, need many parameters to adjust, and the documents should be indexed by a high dimensionality matrix using the traditional vector space model. In order to overcome these limitations, in this paper a new documents clustering algorithm (ASOS-LSI) with no parameters is proposed. It is based on the recent symbiotic organisms search metaheuristic (SOS) and enhanced by an acceleration technique. Furthermore, the documents are represented by semantic indexing based on the famous latent semantic indexing (LSI). Conducted experiments on well-known biomedical documents datasets show the significant superiority of ASOS-LSI over five famous algorithms in terms of compactness, f-measure, purity, misclassified documents, entropy, and runtime.

Sign in / Sign up

Export Citation Format

Share Document