ABSTRACT
This paper describes a new software agent, the community search assistant, which recommends related searches to users of search engines. The community search assistant enables communities of users to search in a collaborative fashion. All queries submitted by the community are stored in the form of a graph. Links are made between queries that are found to be related. Users can peruse the network of related queries in an ordered way: following a path from a first cousin, to a second cousin to a third cousin, etc. to a set of search results. The first key idea behind the use of query graphs is that the determination of relatedness depends on the documents returned by the queries, not on the actual terms in the queries themselves. The second key idea is that the construction of the query graph transforms single user usage of information networks (e.g. search) into collaborative usage: all users can tap into the knowledge base of queries submitted by others.
- Adamic, L. 1999. Small World Web. In Proceedings ECDL'99, Paris, France.Google ScholarCross Ref
- Brauen, T. L. 1971. Document Vector Modification. In The Smart Retrieval System: Experiments in Automatic Document Processing, Gerald Salton, Ed., Englewood Cliffs, NJ.Google Scholar
- Delgaldo, J., Ishii, N. and Ura, T. 1998. Content-Based Collaborative Information Filtering: Actively Learning to Classify and Recommend Documents. In Cooperative Information Agents II. Learning, Mobility and Electronic Commerce for Information Discovery on the Internet. Eds. Google ScholarDigital Library
- M. Klusch, G. Wei~, Springer-Verlag, Lecture Notes in Artificial Intelligence Series No. 1435.Google Scholar
- Fitzpatrick, Larry and Dent, Mei 1997. Automatic Feedback Using Past Queries: Social Searching? In Proceedings of SIGIR'97, Philadelphia, PA. Google ScholarDigital Library
- Glance, N., Arregui, D. and Dardenne, D. 1999. Making recommender systems work for organizations. In Proceedings of PAAM'99, London, England.Google Scholar
- Glance, N., Grasso, A., Borghoff, U., Snowdon, D. and Willamowski, J. 1999. In Proceedings HCI'99, Munich, Germany.Google Scholar
- Kleinberg, J. M. 1998 Authorative Sources in a Hyperlinked Environment. In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, Ed. H. Karloff. Google ScholarDigital Library
- Lamping, J. and Rao, R. 1996. The Hyperbolic Browser: A Focus + Context Technique for Visualizing Large Hierarchies. Journal of Visual Languages and Computing, 7:33-55.Google ScholarCross Ref
- Markatos, E. 1999. On Caching Search Engine Results. ICS FORTH Technical Report 241.Google Scholar
- Nordlie, R. 1999. "User Revealment" - A Comparison of Initial Queries and Ensuing Question Development in Online Searching and in Human Reference Interaction. In Proceedings of SIGIR99, Berkeley, CA. Google ScholarDigital Library
- Page, L. 1997. PageRank - Bringing Order to the Web. Stanford Digital Libraries Working Paper 1997-0072.Google Scholar
- Raghavan, V.V. and Sever, H. 1995. On the Reuse of Past Optimal Queries. In Proceedings of SIGIR95, Seattle, WA. Google ScholarDigital Library
- Sullivan, D. 2000. Search Assistance Features: Related Searches. http://www.searchenginewatch.com/facts/assistance.html#relateGoogle Scholar
Index Terms
- Community search assistant
Recommendations
Sponsored Search: Is Money a Motivator for Providing Relevant Results?
Analysis of data from a major metasearch engine reveals that sponsored-link click-through rates appear lower than previously reported. Combining sponsored and nonsponsored links in a single listing, while providing some benefits to users, does not ...
Focused ranking in a vertical search engine
SIGIR '07: Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrievalSince the debut of PageRank and HITS, hyperlink-induced Web document ranking has come a long way. The Web has become increasingly vast and topically diverse. Such vastness has led many into the area of topic-sensitive ranking and its variants. We ...
Personalization of Content Ranking in the Context of Local Search
WI-IAT '09: Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01Ranking search results using a single ranking function for all search engine visitors is inherently bounded in the performance the ranking algorithm can achieve when considering the variety of requirements of Web searchers and the proliferation of ...
Comments