Weak-Linked Document in Search Engine

Wei Yanjun () and Zheng Qingbi
Additional contact information
Wei Yanjun: Computer Department Shangqiu Vocational and Technical College Shangqiu
Zheng Qingbi: Computer Department Shangqiu Vocational and Technical College Shangqiu

A chapter in 2012 International Conference on Information Technology and Management Science(ICITMS 2012) Proceedings, 2013, pp 527-533 from Springer

Abstract: Abstract The current search engine cannot rank well weak-linked documents such as PowerPoint files and AJAX applications. Current search engines return therefore either completely irrelevant results or poorly ranked documents when searching for these files. Roc, a novel framework is proposed for correctly retrieving and ranking weak-linked documents based on Clustering. The experiments show that our approach considerably improves the result quality of current search engines and that of latent semantic indexing.

Keywords: Search engine; Clustering technology; Weak-linked document (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-34910-2_62

Ordering information: This item can be ordered from
http://www.springer.com/9783642349102

DOI: 10.1007/978-3-642-34910-2_62

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().