WEKO3
アイテム
Fast Algorithms for k-Word Proximity Search
http://hdl.handle.net/2261/00074082
http://hdl.handle.net/2261/00074082390d402a-cdca-4b36-aeae-188fcf49279b
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
Fast Algorithms for k-Word Proximity Search 2001.pdf (268.8 kB)
|
|
| Item type | 学術雑誌論文 / Journal Article(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 2017-12-14 | |||||
| タイトル | ||||||
| タイトル | Fast Algorithms for k-Word Proximity Search | |||||
| 言語 | ||||||
| 言語 | eng | |||||
| 資源タイプ | ||||||
| 資源 | http://purl.org/coar/resource_type/c_6501 | |||||
| タイプ | journal article | |||||
| 著者 |
SADAKANE, Kunihiko
× SADAKANE, Kunihiko× IMAI, Hiroshi |
|||||
| 著者所属 | ||||||
| 著者所属 | Graduate School of Information Sciences, Tohoku University | |||||
| 著者所属 | ||||||
| 著者所属 | Department of Information Science, University of Tokyo | |||||
| 抄録 | ||||||
| 内容記述タイプ | Abstract | |||||
| 内容記述 | When we search from a huge amount of documents, we often specify several keywords and use conjunctive queries to narrow the result of the search. Though the searched documents contain all keywords, positions of the keywords are usually not considered. As a result, the search result contains some meaningless documents. It is therefore effective to rank documents according to proximity of keywords in the documents. This ranking is regarded as a kind of text data mining. In this paper, we propose two algorithms for finding documents in which all given keywords appear in neighboring places. One is based on plane-sweep algorithm and the other is based on divide-and-conquer approach. Both algorithms run in O(n log n) time where n is the number of occurrences of given keywords. We run the algorithms on a large collection of html files and verify its effectiveness. | |||||
| 内容記述 | ||||||
| 内容記述タイプ | Other | |||||
| 内容記述 | PAPER | |||||
| 書誌情報 |
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences 巻 E84-A, 号 9, p. 2311-2318, 発行日 2001-09-01 |
|||||
| 権利 | ||||||
| 権利情報 | copyright©2001 IEICE | |||||
| 著者版フラグ | ||||||
| 値 | publisher | |||||
| 出版者 | ||||||
| 出版者 | Institute of Electronics, Information and Communication Engineers | |||||
| 関係URI | ||||||
| 識別子タイプ | URI | |||||
| 関連識別子 | https://search.ieice.org/ | |||||
