WEKO3
アイテム
Mining coverages for query refinement
http://hdl.handle.net/2241/6329
http://hdl.handle.net/2241/63294df07d94-8a8c-400a-8ac3-f8300e12a9e4
| Item type | Thesis or Dissertation(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 2007-07-25 | |||||
| タイトル | ||||||
| タイトル | Mining coverages for query refinement | |||||
| 言語 | en | |||||
| 言語 | ||||||
| 言語 | jpn | |||||
| 資源タイプ | ||||||
| 資源 | http://purl.org/coar/resource_type/c_db06 | |||||
| タイプ | doctoral thesis | |||||
| アクセス権 | ||||||
| アクセス権 | open access | |||||
| アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||
| 著者 |
劉, 野
× 劉, 野 |
|||||
| 抄録 | ||||||
| 内容記述タイプ | Abstract | |||||
| 内容記述 | In this thesis, a data mining approach for query refinement is proposed using Association Rules (ARs) among keywords being extracted from a document database. When a query is underspecified or contains ambiguous kyewords, a set of association rules will be displayed to assist the user to choose additional keywords in order to refine his/her original query. To the best of our knowledge, no reported study has disdussed on how to screen the number of documents being retrieved using ARs. The issues concerned in this thesis are as follows. First, an AR, X[?]Y, with high confidence will intend to show that the number of documents that contain both sets of keywords X and Y is large. Therefore, the effectiveness of using minimum support and minimum confidence to screen documents can be little. To address this issue, maximum confidence is used. Second, a large number of rules will be stored in a rule base, and will be displayed at run time in respose to a user query. In order to reduce the number of rules, this thesis introduces two co-related concepts: "stem rule" and "coverage". The stem rules are the rules by which other rules can be derived. A set of keywords is said to be a coverage of a set of documents if these documents can be retrived using the same set of keywords. A minimum coverage can reduce the number of keywords to cover a certain number of documents, and therefore can assist to reduce the number of rules to be managed. In order to demonstrate the applicability of the proposed method, a prototype system has been built, and a medium-sized document database is maintained. The effectiveness of using ARs to screen will be addressed in this thesis as well. | |||||
| 言語 | en | |||||
| 内容記述 | ||||||
| 内容記述 | Bibliography: p. 74-79 | |||||
| 書誌情報 |
発行日 1999 |
|||||
| 取得学位 | ||||||
| 学位名 | 博士（工学） | |||||
| 取得学位 | ||||||
| 学位名 | Doctor of Philosophy in Engineering | |||||
| 学位授与大学 | ||||||
| 学位授与機関識別子Scheme | kakenhi | |||||
| 学位授与機関識別子 | 12102 | |||||
| 言語 | ja | |||||
| 学位授与機関名 | 筑波大学 | |||||
| 言語 | en | |||||
| 学位授与機関名 | University of Tsukuba | |||||
| 学位授与年度 | ||||||
| 内容記述タイプ | Other | |||||
| 内容記述 | 1999 | |||||
| 学位授与年月日 | ||||||
| 学位授与年月日 | 1999-07-23 | |||||
| 報告番号 | ||||||
| 学位授与番号 | 乙第1548号 | |||||
