An adaptive search system using heterogeneous document vector spaces

Kosuke Takano, Shuichi Kurabayashi, Xing Chen, Yasushi Kiyoki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Conventional database selection algorithms are very helpful in improving search results and reducing network overhead and computation time by cutting off databases that are irrelevant to the queries. However, they have not been designed to adapt to the changing interest and intentions of users in the document retrieval process. In this paper, we propose an adaptive search system using heterogeneous document vector spaces. Our system provides a dynamic construction function of search engine components based on a vector space model. In order to reflect the user's current working contexts in the components of the search engine, our system selects adaptively pre-defined sets of feature terms with different search domains depending on the user's currently-viewed documents. By exploiting such adaptive and heterogeneous document vector spaces with specific domains, our system allows users to retrieve proper documents that match their current working contexts. Also, our system implements a conventional database selection method to reduce the computation time of the similarity calculations in each document vector space. In this study, we confirm that our adaptive search system can improve the precision rates of search results as well as the scalability of computation times, by several experiments using the experimental retrieval system implemented in the desktop environment.

Original languageEnglish
Title of host publicationIEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings
Pages193-198
Number of pages6
DOIs
Publication statusPublished - 2009
EventPACRIM 2009 - 2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing - Victoria, BC, Canada
Duration: 2009 Aug 232009 Aug 26

Other

OtherPACRIM 2009 - 2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing
CountryCanada
CityVictoria, BC
Period09/8/2309/8/26

Fingerprint

Vector spaces
Search engines
Scalability
Experiments

ASJC Scopus subject areas

  • Signal Processing
  • Computer Networks and Communications

Cite this

Takano, K., Kurabayashi, S., Chen, X., & Kiyoki, Y. (2009). An adaptive search system using heterogeneous document vector spaces. In IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings (pp. 193-198). [5291375] https://doi.org/10.1109/PACRIM.2009.5291375

An adaptive search system using heterogeneous document vector spaces. / Takano, Kosuke; Kurabayashi, Shuichi; Chen, Xing; Kiyoki, Yasushi.

IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings. 2009. p. 193-198 5291375.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Takano, K, Kurabayashi, S, Chen, X & Kiyoki, Y 2009, An adaptive search system using heterogeneous document vector spaces. in IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings., 5291375, pp. 193-198, PACRIM 2009 - 2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, Victoria, BC, Canada, 09/8/23. https://doi.org/10.1109/PACRIM.2009.5291375
Takano K, Kurabayashi S, Chen X, Kiyoki Y. An adaptive search system using heterogeneous document vector spaces. In IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings. 2009. p. 193-198. 5291375 https://doi.org/10.1109/PACRIM.2009.5291375
Takano, Kosuke ; Kurabayashi, Shuichi ; Chen, Xing ; Kiyoki, Yasushi. / An adaptive search system using heterogeneous document vector spaces. IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings. 2009. pp. 193-198
@inproceedings{5564768bfecf49e7bd248091856becfd,
title = "An adaptive search system using heterogeneous document vector spaces",
abstract = "Conventional database selection algorithms are very helpful in improving search results and reducing network overhead and computation time by cutting off databases that are irrelevant to the queries. However, they have not been designed to adapt to the changing interest and intentions of users in the document retrieval process. In this paper, we propose an adaptive search system using heterogeneous document vector spaces. Our system provides a dynamic construction function of search engine components based on a vector space model. In order to reflect the user's current working contexts in the components of the search engine, our system selects adaptively pre-defined sets of feature terms with different search domains depending on the user's currently-viewed documents. By exploiting such adaptive and heterogeneous document vector spaces with specific domains, our system allows users to retrieve proper documents that match their current working contexts. Also, our system implements a conventional database selection method to reduce the computation time of the similarity calculations in each document vector space. In this study, we confirm that our adaptive search system can improve the precision rates of search results as well as the scalability of computation times, by several experiments using the experimental retrieval system implemented in the desktop environment.",
author = "Kosuke Takano and Shuichi Kurabayashi and Xing Chen and Yasushi Kiyoki",
year = "2009",
doi = "10.1109/PACRIM.2009.5291375",
language = "English",
isbn = "9781424445615",
pages = "193--198",
booktitle = "IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings",

}

TY - GEN

T1 - An adaptive search system using heterogeneous document vector spaces

AU - Takano, Kosuke

AU - Kurabayashi, Shuichi

AU - Chen, Xing

AU - Kiyoki, Yasushi

PY - 2009

Y1 - 2009

N2 - Conventional database selection algorithms are very helpful in improving search results and reducing network overhead and computation time by cutting off databases that are irrelevant to the queries. However, they have not been designed to adapt to the changing interest and intentions of users in the document retrieval process. In this paper, we propose an adaptive search system using heterogeneous document vector spaces. Our system provides a dynamic construction function of search engine components based on a vector space model. In order to reflect the user's current working contexts in the components of the search engine, our system selects adaptively pre-defined sets of feature terms with different search domains depending on the user's currently-viewed documents. By exploiting such adaptive and heterogeneous document vector spaces with specific domains, our system allows users to retrieve proper documents that match their current working contexts. Also, our system implements a conventional database selection method to reduce the computation time of the similarity calculations in each document vector space. In this study, we confirm that our adaptive search system can improve the precision rates of search results as well as the scalability of computation times, by several experiments using the experimental retrieval system implemented in the desktop environment.

AB - Conventional database selection algorithms are very helpful in improving search results and reducing network overhead and computation time by cutting off databases that are irrelevant to the queries. However, they have not been designed to adapt to the changing interest and intentions of users in the document retrieval process. In this paper, we propose an adaptive search system using heterogeneous document vector spaces. Our system provides a dynamic construction function of search engine components based on a vector space model. In order to reflect the user's current working contexts in the components of the search engine, our system selects adaptively pre-defined sets of feature terms with different search domains depending on the user's currently-viewed documents. By exploiting such adaptive and heterogeneous document vector spaces with specific domains, our system allows users to retrieve proper documents that match their current working contexts. Also, our system implements a conventional database selection method to reduce the computation time of the similarity calculations in each document vector space. In this study, we confirm that our adaptive search system can improve the precision rates of search results as well as the scalability of computation times, by several experiments using the experimental retrieval system implemented in the desktop environment.

UR - http://www.scopus.com/inward/record.url?scp=74049156359&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=74049156359&partnerID=8YFLogxK

U2 - 10.1109/PACRIM.2009.5291375

DO - 10.1109/PACRIM.2009.5291375

M3 - Conference contribution

AN - SCOPUS:74049156359

SN - 9781424445615

SP - 193

EP - 198

BT - IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings

ER -