Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1145/1367497.1367709 | WWW |
Keywords | Field | DocType |
anomaly detection,internet node,web graph,hardware unit,search engine,vector similarity method,web graph similarity,similarity scheme,graph similarity measure,consecutive web graph,graph similarity | Anomaly detection,Data mining,Web search query,World Wide Web,Graph database,Search engine,Information retrieval,Computer science,Software,Snapshot (computer storage),Graph (abstract data type),The Internet | Conference |
Citations | PageRank | References |
6 | 0.63 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Panagiotis Papadimitriou | 1 | 407 | 40.26 |
| Ali Dasdan | 2 | 849 | 73.11 |
| Héctor García-Molina | 3 | 24359 | 5652.13 |