中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/51801
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 81570/81570 (100%)
造访人次 : 47014000      在线人数 : 177
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/51801


    题名: Automatic keyword prediction using Google similarity distance
    作者: Chen,PI;Lin,SJ
    贡献者: 資訊管理學系
    关键词: WEB SEARCH;RETRIEVAL;CONTEXT;LENGTH
    日期: 2010
    上传时间: 2012-03-27 19:06:29 (UTC+8)
    出版者: 國立中央大學
    摘要: In this paper, we present a new approach to help users using search engines without entering any keywords. What we want to do is to predict what word the users may want to search before they think about it. Most of the studies done in this field focus on how to help users enter keywords or how to re-rank the search results in order to make them more precise. Both of those methods need to establish a user behavior model and a repository in which to save the logs. In our proposed method, we use the Google similarity distance to measure keywords in the Webpage to find the potential keywords for the users. Thus, we do not need any repository. All the executions are on-line and real-time. Then, we extract all the important keywords as the potential search keywords. In this way, we can use these professional keywords to achieve precise search results. We believe that this can be useful in many areas such as e-learning and can also be used in mobile devices. (C) 2009 Elsevier Ltd. All rights reserved.
    關聯: EXPERT SYSTEMS WITH APPLICATIONS
    显示于类别:[資訊管理學系] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML451检视/开启


    在NCUIR中所有的数据项都受到原著作权保护.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明