• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Intelligent computer mathematics >Escaping the Trap of Too Precise Topic Queries
【24h】

Escaping the Trap of Too Precise Topic Queries

机译：逃脱过于精确的主题查询的陷阱

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

At the very center of digital mathematics libraries lie controlled vocabularies which qualify the topic of the documents. These topics are used when submitting a document to a digital mathematics library and to perform searches in a library. The latter are refined by the use of these topics as they allow a precise classification of the mathematics area this document addresses. However, there is a major risk that users employ too precise topics to specify their queries: they may be employing a topic that is only "close-by" but missing to match the right resource. We call this the topic trap. Indeed, since 2009, this issue has appeared frequently on the i2geo.net platform. Other mathematics portals experience the same phenomenon. An approach to solve this issue is to introduce tolerance in the way queries are understood by the user. In particular, the approach of including fuzzy matches but this introduces noise which may prevent the user of understanding the function of the search engine. In this paper, we propose a way to escape the topic trap by employing the navigation between related topics and the count of search results for each topic. This supports the user in that search for close-by topics is a click away from a previous search. This approach was realized with the i2geo search engine and is described in detail where the relation of being related is computed by employing textual analysis of the definitions of the concepts fetched from the Wikipedia encyclopedia.
机译：在数字数学库的最中心是可控制词汇表，这些词汇表限制了文档的主题。在将文档提交到数字数学图书馆并在图书馆中进行搜索时，将使用这些主题。可以通过使用这些主题来完善后者，因为它们可以对本文档所涉及的数学领域进行精确分类。但是，存在很大的风险，即用户使用过于精确的主题来指定他们的查询：他们可能使用的主题只是“近距离”，但却缺少匹配正确资源的主题。我们将此称为主题陷阱。实际上，自2009年以来，此问题就经常出现在i2geo.net平台上。其他数学门户网站也遇到相同的现象。解决此问题的一种方法是在用户理解查询的方式中引入容忍度。特别地，包括模糊匹配的方法，但这会引入噪声，这可能会使用户无法理解搜索引擎的功能。在本文中，我们提出了一种通过利用相关主题之间的导航以及每个主题的搜索结果计数来逃避主题陷阱的方法。这为用户提供了支持，因为只需单击一下即可搜索最近的主题。这种方法是通过i2geo搜索引擎实现的，并在其中详细描述了相关关系，方法是通过对从Wikipedia百科全书中获取的概念的定义进行文本分析来计算相关关系。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号