skip to main content
10.1145/1013367.1013519acmconferencesArticle/Chapter ViewAbstractPublication PageswwwConference Proceedingsconference-collections
Article

On the temporal dimension of search

Authors Info & Claims
Published:19 May 2004Publication History

ABSTRACT

Web search is probably the single most important application on the Internet. The most famous search techniques are perhaps the PageRank and HITS algorithms. These algorithms are motivated by the observation that a hyperlink from a page to another is an implicit conveyance of authority to the target page. They exploit this social phenomenon to identify quality pages, e.g., "authority" pages and "hub" pages. In this paper we argue that these algorithms miss an important dimension of the Web, the temporal dimension. The Web is not a static environment. It changes constantly. Quality pages in the past may not be quality pages now or in the future. These techniques favor older pages because these pages have many in-links accumulated over time. New pages, which may be of high quality, have few or no in-links and are left behind. Bringing new and quality pages to users is important because most users want the latest information. Research publication search has exactly the same problem. This paper studies the temporal dimension of search in the context of research publication search. We propose a number of methods deal with the problem. Our experimental results show that these methods are highly effective.

References

  1. A. Arasu, J. Cho, H. Garcia-Molina, A. Paepcke, and S. Raghavan. Searching the Web. ACM Transactions on Internet Technology, 1(1), 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. S. Brin, L. Page. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 30, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. A. Borodin, J. S. Rosenthal, G. O. Roberts, and P. Tsaparas, Finding authorities and hubs from link structures on the world wide web. WWW-2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. S. Chakrabarti, B. Dom, D. Gibson, J. Kleinberg, P. Raghavan, and S. Rajagopalan. Automatic resource compilation by analyzing hyperlink structure and associated text. WWW-1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. T. Haveliwala. Topic-sensitive PageRank. WWW-2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Kleinberg. Authoritative sources in a hyperlinked environment. ACM-SIAM Symposium on Discrete Algorithms, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. J. Kleinberg, S. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. The Web as a graph: measurements, models, and methods. International Conference on Combinatorics and Computing, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. S. Lawrence, K. Bollacker, and C. L. Giles. Indexing and retrieval of scientific literature. CIKM-99. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. On the temporal dimension of search

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          WWW Alt. '04: Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
          May 2004
          532 pages
          ISBN:1581139128
          DOI:10.1145/1013367

          Copyright © 2004 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 19 May 2004

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          Overall Acceptance Rate1,899of8,196submissions,23%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader