| DC 欄位 |
值 |
語言 |
| DC.contributor | 資訊工程學系 | zh_TW |
| DC.creator | 施宗昆 | zh_TW |
| DC.creator | Tsung-Kun Shih | en_US |
| dc.date.accessioned | 2007-10-11T07:39:07Z | |
| dc.date.available | 2007-10-11T07:39:07Z | |
| dc.date.issued | 2007 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:444/thesis/view_etd.asp?URN=945202033 | |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 現今在網路上最主要的活動就是資訊的搜尋，雖然目前的搜尋引擎已經相當的好用了，但是它們仍然有些缺點需要去改進。很多人們的資訊需求是很難用關鍵字為基礎的查詢，就能得到正確的回傳結果，所以在本篇論文裡，我們建立一個名為隱藏式的馬可夫模型，來預測最有可能的網頁路徑，進而達到蒐集特定資訊的目的，而在實驗結果方面也顯示了我們的系統改善了一些搜尋引擎所面臨的一些缺點。 | zh_TW |
| dc.description.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. | en_US |
| DC.subject | 馬可夫鏈 | zh_TW |
| DC.subject | 資訊蒐集 | zh_TW |
| DC.subject | HMM | en_US |
| DC.subject | Information Gathering | en_US |
| DC.title | 使用隱藏式馬可夫模型之特定網頁資訊抓取蒐集 | zh_TW |
| dc.language.iso | zh-TW | zh-TW |
| DC.title | Focused Crawling for Information Gathering Using Hidden Markov Model | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |