Authors
Makoto P Kato, Hiroaki Ohshima, Satoshi Oyama, Katsumi Tanaka
Publication date
2009/11/2
Book
Proceedings of the 18th ACM conference on Information and knowledge management
Pages
27-36
Description
We describe methods to search with a query by example in a known domain for information in an unknown domain by exploiting Web search engines. Relational search is an effective way to obtain information in an unknown field for users. For example, if an Apple user searches for Microsoft products, similar Apple products are important clues for the search. Even if the user does not know keywords to search for specific Microsoft products, the relational search returns a product name by querying simply an example of Apple products. More specifically, given a tuple containing three terms, such as (Apple, iPod, Microsoft), the term Zune can be extracted from the Web search results, where Apple is to iPod what Microsoft is to Zune. As a previously proposed relational search requires a huge text corpus to be downloaded from the Web, the results are not up-to-date and the corpus has a high construction cost. We …
Total citations
2010201120122013201420152016201720182019202020212022202381092212324121
Scholar articles
MP Kato, H Ohshima, S Oyama, K Tanaka - Proceedings of the 18th ACM conference on …, 2009