PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
2006 | 16 | 4 | 537-549
Tytuł artykułu

Guided Local Search for query reformulation using weight propagation

Autorzy
Treść / Zawartość
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
A new technique for query reformulation that assesses the relevance of retrieved documents using weight propagation is proposed. The technique uses a Guided Local Search (GLS) in conjunction with the latent semantic indexing model (to semantically cluster documents together) and Lexical Matching (LM). The GLS algorithm is used to construct a minimum spanning tree that is later employed in the reformulation process. The computations done for Singular Value Decomposition (SVD), LM and the minimum spanning tree are necessary overheads that occur only initially and all subsequent work is based on them. Our experimental results reveal the effectiveness of the new technique.
Rocznik
Tom
16
Numer
4
Strony
537-549
Opis fizyczny
Daty
wydano
2006
otrzymano
2005-10-21
poprawiono
2006-08-01
Twórcy
  • Computer Science Department, Faculty of Science, Beirut Arab University, P.O. Box 11-5020, Beirut, Lebanon
Bibliografia
  • Baeza-Yates R. and Ribeiro-Neto B. (1999): Modern Information Retrieval. - New York: Prentice Hall.
  • Daniels J. and Rissland, E. (1995): EXPRESS: A case based approach to intelligent information retrieval. - Proc. SIGIR'95 Conf., Seattle, WA, USA 1995, pp. 31-43.
  • Dunlop M.D. (1997): The effect of accessing non-matching documents on relevance feedback. - ACM Trans. Inf. Syst., Vol. 15, No. 2, pp. 137-153.
  • Epp S.S. (1990): Discrete Mathematics with Applications. - London: Wadsworth Publishing Company.
  • Letsche T.A. and Berry M.W. (1997): Large-scale information retrieval with latent semantic indexing. - Inf. Sci., Vol. 9, No. 2, pp. 111-121.
  • Lopez-Pujalte C., Guerrero-Bote V.P., de Moya-Anegon F. (2002): A test of genetic algorithms in relevance feedback. - Inf. Process. Manag., Vol. 38, No. 7, pp. 793-805.
  • Ruthven I., Tombros A. and Jose J. (2001): A study on the use of summaries and summary-based query expansion for a question-answering task. - Proc. 23rd BCS European Annual Colloquium on s Information Retrieval Research, Berlin, Germany, pp. 48-54.
  • Ruthven I., White R. and Jose J.M. (2001): Web document summarization: A task-oriented evaluation. -Proc. Int. Workshop s Digital Libraries, Proc. 12-th Int. Conf. s Database and Expert Systems Applications, (DEXA 2001), Munich, Germany, pp. 52-61.
  • Van R. (1979): Information Retrieval, 2nd Ed., London: McGraw Hill.
  • Voudouris C. and Tsang E. (1994): Tunneling algorithm for partial CSPs and combinatorial optimization problems. - Tech. Rep. No. CSM-213, Dept. of Computer Science, University of Essex, Colchester, UK.
  • Voudouris C. (1997): Guided Local Search for Combinatorial Optimisation Problems. - Ph.D. thesis, Dept. Computer Science, University of Essex, Colchester, UK.
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.bwnjournal-article-amcv16i4p537bwm
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.