arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1402.7200cs.IR
收藏

语义外观的数学模型--一个高效的上下文驱动的搜索引擎

Mathematical Model of Semantic Look - An Efficient Context Driven Search Engine

Leena Giri G, Srikanth P L, S H Manjula, K R Venugopal, L M Patnaik

摘要:

万维网(WWW)是一个巨大的网页温室。搜索引擎是为用户查询获取网页的关键应用。在当前一代Web架构中,搜索引擎将用户提供的关键字视为孤立的关键字,而不考虑用户查询的上下文。这会导致向用户显示许多不相关的页面或链接。语义Web是在现有Web的基础上,通过修改框架,以更精确的结果集作为对用户查询的响应。当前的网页需要通过寻找相关的Meta数据添加到它们中的每一个被注释,使它们成为有用的语义Web搜索引擎。Semantic Look通过处理记录在网页中的语义信息来探索用户查询的上下文。它与现有的算法称为OntoLook相比,它表明,语义查找是一个更好的优化搜索引擎的速度是OntoLook的两倍以上。

英文摘要:

The WorldWideWeb (WWW) is a huge conservatory of web pages. Search Engines are key applications that fetch web pages for the user query. In the current generation web architecture, search engines treat keywords provided by the user as isolated keywords without considering the context of the user query. This results in a lot of unrelated pages or links being displayed to the user. Semantic Web is based on the current web with a revised framework to display a more precise result set as response to a user query. The current web pages need to be annotated by finding relevant meta data to be added to each of them, so that they become useful to Semantic Web search engines. Semantic Look explores the context of user query by processing the Semantic information recorded in the web pages. It is compared with an existing algorithm called OntoLook and it is shown that Semantic Look is a better optimized search engine by being more than twice as fast as OntoLook.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑