Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/1321440.1321598acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
poster

Link analysis using time series of web graphs

Published: 06 November 2007 Publication History

Abstract

Link analysis is a key technology in contemporary web search engines. Most of the previous work on link analysis only used information from one snapshot of web graph. Since commercial search engines crawl the Web periodically, they will naturally obtain time series data of web graphs. The historical information contained in the series of web graphs can be used to improve the performance of link analysis. In this paper, we argue that page importance should be a dynamic quantity, and propose defining page importance as a function of both PageRank of the current web graph and accumulated historical page importance from previous web graphs. Specifically, a novel algorithm named TemporalRank is designed to compute the proposed page importance. We try to use a kinetic model to interpret this page importance and show that it can be regarded as the solution to an ordinary differential equation. Experiments on link analysis using web graph data in five snapshots show that the proposed algorithm can outperform PageRank in many measures, and can effectively filter out newly appeared link spam websites.

References

[1]
Berberich, K., Vazirgiannis, M., and Weikum, G. T-Rank: Time-aware Authority Ranking. In Algorithms and Models for the Web-Graph: Third International Workshop, WAW 2004, pages: 131--141, Springer-Verlag, 2004.
[2]
Boldi, P., Santini, M., and Vigna, S. PageRank as a function of the damping factor. In Proceedings of the 14th International World Wide Web Conference, 2005.
[3]
Brin, S., and Page, L. The anatomy of a large-scale hypertextual web search engine. In Proceedings of the Seventh International Wide Web Conference, Australia, 1998.
[4]
Gyongyi, Z., and Garcia-Molina, H. Link spam alliances. Technical Report, Stanford University, 2005.
[5]
Gyongyi, Z., and Garcia-Molina, H. Web spam Taxonomy. In the First International Workshop on Adversarial Information Retrieval on the Web, 2005.
[6]
Haveliwala, T. Topic-sensitive PageRank. In Proceedings of the International World Wide Web Conference, 2002.
[7]
Haveliwala, T., Kamvar, S., and Jeh, G. An analytical comparison of approaches to personalizing PageRank. Technical Report, Stanford University, 2003.
[8]
Kleinberg, J. Authoritative sources in a hyperlinked environment. In Journal of the ACM, 46(5):604--632, 1999.
[9]
Langville, A., and Meyer, C. Deeper inside PageRank. Internet Mathematics 1(3):335--380, 2004.
[10]
McSherry, F. A uniform approach to accelerated PageRank computation. In Proceedings of the 14th International World Wide Web Conference, 2005.
[11]
Page, L., Brin, S., Motwani, R., and Winograd, T. The PageRank citation ranking: Bringing order to the web. Technical Report, Stanford University, Stanford, CA, 1998.
[12]
Richardson, M., Prakash, A., and Brill, E. Beyond PageRank: Machine Learning for Static Ranking. In Proceedings of the Fifteenth International World Wide Web Conference, pages: 707--715, 2006.
[13]
Yu, P.S., Li, X., and Liu, B. Adding the Temporal Dimension to Search - A Case Study in Publication Search. In Proceedings of the 2005 IEEE/WIC/ACM International Conference on Web Intelligence, 2005.

Cited By

View all
  • (2022)Postmortem Computation of Pagerank on Temporal GraphsProceedings of the 51st International Conference on Parallel Processing10.1145/3545008.3545055(1-11)Online publication date: 29-Aug-2022
  • (2022)EGraph: Efficient Concurrent GPU-based Dynamic Graph ProcessingIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2022.3171588(1-1)Online publication date: 2022
  • (2022)Enabling Time-Centric Computation for Efficient Temporal Graph Traversals From Multiple SourcesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2020.300567234:4(1751-1762)Online publication date: 1-Apr-2022
  • Show More Cited By

Index Terms

  1. Link analysis using time series of web graphs

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    CIKM '07: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
    November 2007
    1048 pages
    ISBN:9781595938039
    DOI:10.1145/1321440
    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]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 06 November 2007

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. link analysis
    2. page importance
    3. pagerank
    4. search engine
    5. temporal information

    Qualifiers

    • Poster

    Conference

    CIKM07

    Acceptance Rates

    Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

    Upcoming Conference

    CIKM '25

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)5
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 14 Nov 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2022)Postmortem Computation of Pagerank on Temporal GraphsProceedings of the 51st International Conference on Parallel Processing10.1145/3545008.3545055(1-11)Online publication date: 29-Aug-2022
    • (2022)EGraph: Efficient Concurrent GPU-based Dynamic Graph ProcessingIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2022.3171588(1-1)Online publication date: 2022
    • (2022)Enabling Time-Centric Computation for Efficient Temporal Graph Traversals From Multiple SourcesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2020.300567234:4(1751-1762)Online publication date: 1-Apr-2022
    • (2022)Temporal Regular Path Queries2022 IEEE 38th International Conference on Data Engineering (ICDE)10.1109/ICDE53745.2022.00226(2412-2425)Online publication date: May-2022
    • (2021)Sequence Contained Heterogeneous Graph Neural Network2021 International Joint Conference on Neural Networks (IJCNN)10.1109/IJCNN52387.2021.9533391(1-8)Online publication date: 18-Jul-2021
    • (2021)Content and link-structure perspective of ranking webpagesComputer Science Review10.1016/j.cosrev.2021.10039740:COnline publication date: 1-May-2021
    • (2020)ChronoGraph: Enabling Temporal Graph Traversals for Efficient Information Diffusion Analysis over TimeIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2019.289156532:3(424-437)Online publication date: 1-Mar-2020
    • (2017)Temporal graph algebraProceedings of The 16th International Symposium on Database Programming Languages10.1145/3122831.3122838(1-12)Online publication date: 1-Sep-2017
    • (2016)Synergistic Analysis of Evolving GraphsACM Transactions on Architecture and Code Optimization10.1145/299278413:4(1-27)Online publication date: 25-Oct-2016
    • (2015)A Time-aware Random Walk Model for Finding Important Documents in Web ArchivesProceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/2766462.2767832(915-918)Online publication date: 9-Aug-2015
    • Show More Cited By

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media