The search functionality is under construction.
The search functionality is under construction.

Fast Algorithms for k-Word Proximity Search

Kunihiko SADAKANE, Hiroshi IMAI

  • Full Text Views

    0

  • Cite this

Summary :

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.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E84-A No.9 pp.2311-2318
Publication Date
2001/09/01
Publicized
Online ISSN
DOI
Type of Manuscript
PAPER
Category
Algorithms and Data Structures

Authors

Keyword