A Study on Implementation for Search Engine Based on Hyperlink and Keyword Frequency Analysis

碩士 === 國立屏東科技大學 === 資訊管理系 === 90 === In this epoch, the growth of information technology has exploded. How to mine the information of people’s interest in a short time has become an important issue. In general, people need to record addresses of every search engine before they begin information retr...

Full description

Bibliographic Details
Main Authors: Chih-Ho Chen, 陳麴合
Other Authors: Yuh-Jiuan Tasy
Format: Others
Language:zh-TW
Published: 2002
Online Access:http://ndltd.ncl.edu.tw/handle/37625626064092162978
Description
Summary:碩士 === 國立屏東科技大學 === 資訊管理系 === 90 === In this epoch, the growth of information technology has exploded. How to mine the information of people’s interest in a short time has become an important issue. In general, people need to record addresses of every search engine before they begin information retrieval and adapt to different interfaces that every search engine provides. After getting each retrieve results, people need to filter the information that has filled with high repetition from independent search engines which set keywords or query conditions. This study develops an effective search mechanism to help people to find out the required information. It also aims to implement a Hyperlink and Keyword Frequency Analysis (HKFA) search engine. The HKFA search engine consists of five modules. There are (1)Query Module; (2)Information Retrieval Module─includes Dispatcher Algorithm; (3)Information Extraction Module─includes Feature Extraction Algorithm and Hyperlink Normal Form Algorithm; (4)Information Filtering Module─includes Occurrence Hit Algorithm、Filter Hyperlink Algorithm、Keyword Frequency and Position Algorithm; (5) Information Integration Module. The search engine mechanism designed in this study is to provide high precision and high recall information. Furthermore, this mechanism can not only effectively save people’s time spent on retrieving and filtering information but also reduce user’s information overhead.