APPLICATIONS OF GRAPH PROBING TO WEB DOCUMENT ANALYSIS
Daniel Lopresti, Gordon Wilfong · Series in machine perception and artificial intelligence · 2003
this paper, we describe our first steps towards adapting the graph probing paradigm to allow pre-computation of a compact, efficient probe set for databases of graphstructured documents in general, and Web pages coded in HTML in particular. This new model is shown in Figure 1, where the portion of the computation bounded by dashed lines is performed off-line. We consider both comparing two graphs in their entirety, as well as determining whether one graph contains a subgraph that closely matches the other. We present an overview of work in progress, as well as some preliminary experimental results