IEEE Transactions on Knowledge and Data Engineering · 2007 · 31 citations · 16 references
ComputingComputer ScienceComputer SystemsAlgorithmsInformation RetrievalNatural Language ProcessingChange DetectionTree Topology ComparisonWeb MiningWeb Performance OptimizationHungarian Algorithm
This paper describes an efficient Web page change detection system based on three optimizations that were implemented on top of the Hungarian algorithm, which we employ to compare trees that correspond to HTML Web pages. The optimizations attempt to stop the comparator algorithm that employs this O(n <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> ) algorithm before it completes all its iterations based on criteria having to do with properties of HTML and heuristics. Analysis and experimental results prove the effectiveness of these optimizations and their ability to render O(n <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ) performance, where n denotes the number of nodes in the tree. A complete system was implemented and used to carry out the performance experiments. This system includes functionalities and interfaces for processing user requests, fetching Web pages from the Internet, allowing users to select zones in Web pages to monitor, and highlighting changes on the Web pages being monitored
16
The Hungarian method for the assignment problem
Harold W. Kuhn · Naval Research Logistics Quarterly · 1955 · 12.6K citations
The Hungarian method for the assignment problem
H. W. Kuhn · Naval Research Logistics (NRL) · 2004 · 1.3K citations · Full text
Detecting changes in XML documents
Grégory Cobéna, Serge Abiteboul, Amélie Marian · 2003 · 421 citations
An Algorithm for Differential File Comparison
James Hunt, M. D. McIlroy · 2008 · 301 citations