Papadimitriou, Panagiotis and Dasdan, Ali and Garcia-Molina, Hector (2008) Web Graph Similarity for Anomaly Detection (poster). In: 17th International World Wide Web Conference (WWW 2008), April 21-25, 2008, Beijing, China.
This is the latest version of this item.
Official URL: http://www2008.org/papers/pdf/p1167-papadimitriouA...
Web graphs are approximate snapshots of the web, created by search engines. Their creation is an error-prone procedure that relies on the availability of Internet nodes and the faultless operation of multiple software and hardware units. Checking the validity of a web graph requires a notion of graph similarity. Web graph similarity helps measure the amount and significance of changes in consecutive web graphs. These measurements validate how well search engines acquire content from the web. In this paper we study five similarity schemes: three of them adapted from existing graph similarity measures and two adapted from well-known document and vector similarity methods. We compare and evaluate all five schemes using a sequence of web graphs for Yahoo! and study if the schemes can identify anomalies that may occur due to hardware or other problems.
|Item Type:||Conference or Workshop Item (Poster)|
|Uncontrolled Keywords:||anomaly detection; graph similarity; web graph LSH|
|Subjects:||Computer Science > Databases and the Web|
|Related URLs:||Project Homepage||http://infolab.stanford.edu/|
|Deposited By:||Import Account|
|Deposited On:||06 May 2008 17:00|
|Last Modified:||29 Apr 2009 21:49|
Available Versions of this Item
- Web Graph Similarity for Anomaly Detection. (deposited 21 Jan 2008 16:00)
- Web Graph Similarity for Anomaly Detection (poster). (deposited 06 May 2008 17:00) [Currently Displayed]
Repository Staff Only: item control page