Identifying Semantic in High-Dimensional Web Data Using Latent Semantic Manifold

• 作者: Ajit Kumar I-Jen Chiang Sanjeev Maskara
• 来源期刊: 数据分析和信息处理(英文)
• 学科: 工学
• 关键词: LATENT SEMANTIC MANIFOLD CONDITIONAL Random Field Hidden Markov Model Graph-Based Tree-Width Decomposition
• 年，卷（期）: 2015,（4）
• 页码范围: 136-152
• 页数: 17页
• 分类号: TP39

摘要

Latent Semantic Analysis involves natural language processing techniques for analyzing relationships between a set of documents and the terms they contain, by producing a set of concepts (related to the documents and terms) called semantic topics. These semantic topics assist search engine users by providing leads to the more relevant document. We develope a novel algorithm called Latent Semantic Manifold (LSM) that can identify the semantic topics in the high-dimensional web data. The LSM algorithm is established upon the concepts of topology and probability. Asearch tool is also developed using the LSM algorithm. This search tool is deployed for two years at two sites in Taiwan: 1) Taipei Medical University Library, Taipei, and 2) Biomedical Engineering Laboratory, Institute of Biomedical Engineering, National Taiwan University, Taipei. We evaluate the effectiveness and efficiency of the LSM algorithm by comparing with other contemporary algorithms. The results show that the LSM algorithm outperforms compared with others. This algorithm can be used to enhance the functionality of currently available search engines.