Focused Crawling for Information Gathering Using Hidden Markov Model
碩士 === 國立中央大學 === 資訊工程研究所 === 96 === 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...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2007
|
Online Access: | http://ndltd.ncl.edu.tw/handle/tzc723 |
id |
ndltd-TW-096NCU05392012 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-096NCU053920122019-05-15T19:18:53Z http://ndltd.ncl.edu.tw/handle/tzc723 Focused Crawling for Information Gathering Using Hidden Markov Model 使用隱藏式馬可夫模型之特定網頁資訊抓取蒐集 Tsung-Kun Shih 施宗昆 碩士 國立中央大學 資訊工程研究所 96 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. Chia-Hui Chang 張嘉惠 2007 學位論文 ; thesis 41 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立中央大學 === 資訊工程研究所 === 96 === 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.
|
author2 |
Chia-Hui Chang |
author_facet |
Chia-Hui Chang Tsung-Kun Shih 施宗昆 |
author |
Tsung-Kun Shih 施宗昆 |
spellingShingle |
Tsung-Kun Shih 施宗昆 Focused Crawling for Information Gathering Using Hidden Markov Model |
author_sort |
Tsung-Kun Shih |
title |
Focused Crawling for Information Gathering Using Hidden Markov Model |
title_short |
Focused Crawling for Information Gathering Using Hidden Markov Model |
title_full |
Focused Crawling for Information Gathering Using Hidden Markov Model |
title_fullStr |
Focused Crawling for Information Gathering Using Hidden Markov Model |
title_full_unstemmed |
Focused Crawling for Information Gathering Using Hidden Markov Model |
title_sort |
focused crawling for information gathering using hidden markov model |
publishDate |
2007 |
url |
http://ndltd.ncl.edu.tw/handle/tzc723 |
work_keys_str_mv |
AT tsungkunshih focusedcrawlingforinformationgatheringusinghiddenmarkovmodel AT shīzōngkūn focusedcrawlingforinformationgatheringusinghiddenmarkovmodel AT tsungkunshih shǐyòngyǐncángshìmǎkěfūmóxíngzhītèdìngwǎngyèzīxùnzhuāqǔsōují AT shīzōngkūn shǐyòngyǐncángshìmǎkěfūmóxíngzhītèdìngwǎngyèzīxùnzhuāqǔsōují |
_version_ |
1719087549870243840 |