To randomize or not to randomize: space optimal summaries for hyperlink analysis

No abstract is available for this paper.

• Publication year

  2006

• Venue

  The Web Conference

• Publication date

  2006-05-23

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/1135777.1135823
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Communication Complexity

  2016cited by this paper
• MapReduce: simplified data processing on large clusters

  2008cited by this paper
• Summarizing and Mining Skewed Data Streams

  2005cited by this paper
• A uniform approach to accelerated PageRank computation

  2005influential reference
• Scaling link-based similarity search

  2005influential reference
• Data streams: algorithms and applications

  2005cited by this paper
• Local methods for estimating pagerank values

  2004cited by this paper
• Ranking the web frontier

  2004cited by this paper
• An improved data stream summary: the count-min sketch and its applications

  2004influential reference
• Network Applications of Bloom Filters: A Survey

  2004cited by this paper
• Efficiency-Quality Tradeoffs for Vector Score Aggregation

  2004cited by this paper
• The webgraph framework I: compression techniques

  2004cited by this paper
• Towards Scaling Fully Personalized PageRank

  2004cited by this paper
• Comparing and aggregating rankings with ties

  2004cited by this paper
• Searching the workplace web

  2003cited by this paper
• Scaling personalized web search

  2003influential reference
• Efficient Encodings for Document Ranking Vectors (Extended Abstract)

  2003cited by this paper
• Exploiting the Block Structure of the Web for Computing

  2003cited by this paper
• Topic-Sensitive PageRank : A Context-Sensitive Ranking Algorithm for Web Search

  2003influential reference
• Extrapolation methods for accelerating PageRank computations

  2003cited by this paper
• Comparing top k lists

  2003cited by this paper
• Where to Start Browsing the Web?

  2003cited by this paper
• SimRank: a measure of structural-context similarity

  2002influential reference
• ANF: a fast and scalable tool for data mining in massive graphs

  2002cited by this paper
• Finding frequent items in data streams

  2002cited by this paper
• Sampling algorithms: lower bounds and applications

  2001cited by this paper
• External memory algorithms and data structures: dealing with massive data

  2001cited by this paper
• When experts agree: using non-affiliated experts to rank popular topics

  2001cited by this paper
• Rank aggregation methods for the Web

  2001cited by this paper
• WebBase: a repository of Web pages

  2000cited by this paper
• Computing on data streams

  1999cited by this paper
• The PageRank Citation Ranking : Bringing Order to the Web

  1999cited by this paper
• Authoritative sources in a hyperlinked environment

  1999influential reference
• Exact and approximate membership testers

  1978cited by this paper
• Space/time trade-offs in hash coding with allowable errors

  1970cited by this paper
• Rank Correlation Methods

  1949cited by this paper

• The Adaptive Use of Count-Min Sketch: What is Safe and What is Not?

  2025cites this paper
• Efficient Algorithms for Personalized PageRank Computation: A Survey

  2024cites this paper
• Efficient Resistance Distance Computation: The Power of Landmark-based Approaches

  2023cites this paper
• Randomly sparsified Richardson iteration: A dimension‐independent sparse linear solver

  2023cites this paper
• Efficient and Effective Similarity Search over Bipartite Graphs

  2022cites this paper
• GraphGuess: Approximate Graph Processing System with Adaptive Correction

  2021cites this paper
• Sketch for traffic measurement: design, optimization, application and implementation

  2020cites this paper
• V-Combiner: speeding-up iterative graph processing on a shared-memory platform with vertex merging

  2020cites this paper
• A survey on network node ranking algorithms: Representative methods, extensions, and applications

  2020cites this paper
• A survey of sketches in traffic measurement: Design, Optimization, Application and Implementation

  2020cites this paper
• A Survey on Personalized PageRank Computation Algorithms

  2019cites this paper
• Local Computation Algorithms

  2019cites this paper
• Buffered Count-Min Sketch on SSD: Theory and Experiments

  2018cites this paper
• Fast Exact CoSimRank Search on Evolving and Static Graphs

  2018cites this paper
• The Distributed Computing Column

  2017cites this paper
• A ( C entralized ) L ocal G uide

  2017cites this paper
• Can We Locally Compute Sparse Connected Subgraphs?

  2017cites this paper
• Buffered Count-Min Sketch

  2017cites this paper
• PowerWalk: Scalable Personalized PageRank via Random Walks with Vertex-Centric Decomposition

  2016cites this paper
• Count-Min Sketch

  2016cites this paper
• Assesing the Quality of Web via Semi-Supervised Methods

  2016cites this paper
• A Ranking Approach on Large-Scale Graph With Multidimensional Heterogeneous Information

  2016cites this paper
• Scaling Out Link Prediction with SNAPLE: 1 Billion Edges and Beyond

  2015cites this paper
• Constructing near spanning trees with few local inspections

  2015cites this paper
• Local Algorithms for Sparse Spanning Graphs

  2014cites this paper
• Efficient Node-to-Node Relevance Assessment Based on Hyperlinks

  2014cites this paper
• Title : Count-Min Sketch Name :

  2014cites this paper
• FAST-PPR: scaling personalized pagerank estimation for large graphs

  2014cites this paper
• HYBRID RECOMMENDATION USING ASSOCIATION RULE MINING BY PARTIAL EVALUATION OF WEB PERSONALIZATION FOR RETRIEVAL EFFECTIVENESS

  2014cites this paper
• FFSB: Fast Fibonacci Series-Based personalized PageRank on MPI

  2013cites this paper
• Scaling Graph-based Semi Supervised Learning to Large Number of Labels Using Count-Min Sketch

  2013cites this paper
• MCHITS: Monte Carlo based Method for Hyperlink Induced Topic Search on Networks

  2013cites this paper
• SIGIR 2013 workshop on time aware information access (#TAIA2013)

  2013cites this paper
• Temporal Wikipedia search by edits and linkage

  2013cites this paper
• Novel online data cleaning protocols for data streams in trajectory, Wireless Sensor Networks

  2013cites this paper
• On the Embeddability of Random Walk Distances

  2013cites this paper
• On the SPOT : Question Answering over Temporally Enhanced Structured Data

  2013cites this paper
• Sketch-based data recovery in sensor data streams

  2013cites this paper
• Fast Algorithm for Top-k Personalized PageRank Queries with Layered Graphs

  2012cites this paper
• A hybrid approach to personalized web search

  2012cites this paper
• A Survey on Proximity Measures for Social Networks

  2012cites this paper
• Fast Local Computation Algorithms

  2011cites this paper
• Multiplicative Approximations of Random Walk Transition Probabilities

  2011cites this paper
• Exploiting links and text structure on the Web: a quantitative approach to improving search quality

  2011cites this paper
• Semi-supervised ranking on very large graphs with rich metadata

  2011cites this paper
• Preserving Personalized Pagerank in Subgraphs

  2011cites this paper
• Preserving Pairwise Relationships in Subgraphs

  2011cites this paper
• CP-index: on the efficient indexing of large graphs

  2011cites this paper
• Data Mining Applications of Singular Value Decomposition

  2011influential citation
• Random Walks in Social Networks and their Applications: A Survey

  2011cites this paper
• Thesis submitted in partial fulfillment of the requirements for the M.Sc. degree in the School of Computer Science, Tel-Aviv University

  2011cites this paper
• Fast personalized PageRank on MapReduce

  2011influential citation
• Estimating PageRank on graph streams

  2011cites this paper
• Tractable algorithms for proximity search on large graphs

  2010cites this paper
• Fast Incremental and Personalized PageRank

  2010influential citation
• Mining Large Information Networks by Graph Summarization

  2010cites this paper
• Algorithms for large graphs

  2010cites this paper
• Adapting information retrieval to user needs in an evolving web environment

  2010cites this paper
• Fast nearest-neighbor search in disk-resident graphs

  2010cites this paper
• Random Walks with Random Projections

  2009cites this paper
• Evaluating the Effectiveness of Personalized Web Search

  2009cites this paper
• Spectral Clustering in Social Networks

  2009cites this paper
• Methods for Web Spam Filtering

  2009cites this paper
• Methods for Web Spam Filtering Ph.D. Thesis Summary

  2009cites this paper
• Monte Carlo methods for Web search

  2009cites this paper
• Mining Graph Patterns Efficiently via Randomized Summaries

  2009cites this paper
• Estimating PageRank on graph streams

  2008cites this paper
• Ordinal Ranking for Google's PageRank

  2008cites this paper
• NOAH: A CSP-based language for describing the behaviour of coupled models

  2008cites this paper
• Telephone Call Network Data Mining: A Survey with Experiments

  2008influential citation
• Robust PageRank and locally computable spam detection features

  2008cites this paper
• Semi-supervised learning: a comparative study for web spam and telephone user churn

  2007cites this paper
• When rank trumps precision: using the power method to compute google's pagerank

  2007cites this paper
• Classement de services et de données par leur utilisation

  2007cites this paper
• Local Partitioning for Directed Graphs Using PageRank

  2007cites this paper
• Personalized query expansion for the web

  2007cites this paper
• Emerging applications of link analysis for ranking

  2007cites this paper
• Spectral clustering in telephone call graphs

  2007cites this paper
• Blogs: On the Cutting Edge of the Next-generation Web — Antonio Miguel Fumero-Reverón and Fernando Sáez-Vacas 83 Harmonise Project: Building up to the Final Report—François-

  2007cites this paper
• Local Computation of PageRank Contributions

  2007cites this paper
• Emerging Applications of Link Analysis for Ranking

  2007cites this paper
• Searching the Web with Low Space Approximations

  2006cites this paper
• Approximating Personalized PageRank with Minimal Use of Web Graph Data

  2006cites this paper
• Link-Based Similarity Search to Fight Web Spam

  2006influential citation
• 2 New results Claim 1 Scaling fully personalized PageRank

  2006cites this paper
• Improved Approximation Algorithms for Large Matrices via Random Projections

  2006cites this paper
• Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments

  2005cites this paper
• A personalized search engine based on Web‐snippet hierarchical clustering

  2005cites this paper
• A Bibliography of Publications about the Google PageRank Algorithm

  year unknowncites this paper
• Adversarial Information Retrieval on the Web Airweb 2006 Program

  year unknowncites this paper