A large‐scale study of the evolution of Web pages

By Dennis Fetterly, Mark S. Manasse, Marc Najork, Janet L. Wiener. The Web Conference, 2003

598 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Information Systems

View Paper: https://www.semanticscholar.org/paper/1407b7a7228a6d8a7567109eb10dc06bb3337cec

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Information Systems

Citations in the corpus

b-Bit Minwise Hashing for Estimating Three-Way Similarities (2010, methodology): “For example, consider web duplicate detection [17].”
What's new on the web?: the evolution of the web from a search engine perspective (2004, methodology): “Fetterly et al. [16] drew similar conclusions as to the pre-dictability of degree of change, using number of changed shin-gles to measure change.”
The Perron-Frobenius theorem: some of its applications (2005, unknown): “Other entrepreneurs build large sets of pages filled with random junk, say words chosen at random from a set of relevant terms [8], to collect Pagerank that can be passed on the other pages.”
Accessing the deep web (2007, background): “While we have understood the surface Web relatively well, with various surveys [3, 7]), how is the deep Web different? This article reports our survey of the deep Web, studying the scale, subject distribution, search-engine coverage, and other access characteristics of online databases.”
Spamming botnets: signatures and characteristics (2008, methodology): “We crawled all the corresponding Web pages 5 and applied text shingling [9] to generate 20 hash values (shingles) for each Web page.”
Spam, damn spam, and statistics: using statistical analysis to locate spam web pages (2004, methodology): “Our study is based on two data sets collected in the course of two separate previous experiments [5, 8].”
Densifying One Permutation Hashing via Rotation for Fast Near Neighbor Search (2014, background): “More than 10 years ago, industry already used n-grams (Broder et al., 1997; Fetterly et al., 2003) with (e.”
Improved Densification of One Permutation Hashing (2014, background): “Binary representations are common for high dimensional sparse data over the web [8, 25, 26, 1], especially for text data represented by high-order n -grams [4, 12].”
Structure and evolution of online social networks (2006, unknown): “Structural properties of different snapshots of the world-wide web graph was studied by Fetterly et al and Cho et al [14, 27].”
Microscopic evolution of social networks (2008, background): “Similarly, macroscopic properties of network evolution, like densification and shrinking diameters, were examined [16, 11, 19, 13].”