English  |  正體中文  |  简体中文  |  Items with full text/Total items : 70588/70588 (100%)
Visitors : 23063955      Online Users : 906
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/9411

    Title: 使用隱藏式馬可夫模型之特定網頁資訊抓取蒐集;Focused Crawling for Information Gathering Using Hidden Markov Model
    Authors: 施宗昆;Tsung-Kun Shih
    Contributors: 資訊工程研究所
    Keywords: 馬可夫鏈;資訊蒐集;HMM;Information Gathering
    Date: 2007-10-10
    Issue Date: 2009-09-22 11:47:12 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 現今在網路上最主要的活動就是資訊的搜尋,雖然目前的搜尋引擎已經相當的好用了,但是它們仍然有些缺點需要去改進。很多人們的資訊需求是很難用關鍵字為基礎的查詢,就能得到正確的回傳結果,所以在本篇論文裡,我們建立一個名為隱藏式的馬可夫模型,來預測最有可能的網頁路徑,進而達到蒐集特定資訊的目的,而在實驗結果方面也顯示了我們的系統改善了一些搜尋引擎所面臨的一些缺點。 Information search is the key activity for many users on the Web. Although search engines are very useful and powerful nowadays, there are also many drawbacks faced by them. Moreover, many information needs are hard to express using keyword-based queries. In this paper, we apply a method to solve composite information needs by building a Hidden Markov Model (HMM) for predicting the most likely path to the target information. We want to use the concept of the focused crawling to trace down a Web site for specific information. The experiment shows that the results is good for the admission information and the accepted papers.
    Appears in Collections:[資訊工程研究所] 博碩士論文

    Files in This Item:

    File SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 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 ©   - Feedback  - 隱私權政策聲明