Procedia Engineering · 2012 · 11 citations · 8 references
ComputingComputer ScienceInformation TechnologyData MiningDatabasesMachine LearningQuery OptimizationQuery ProcessingWeb MiningWeb SearchCommunication Cost AnalysisCommunication Cost ModelsIncremental LearningIncremental Query ProcessingWeb Crawling
Abstract The goal of incremental deep web crawling is to select the appropriate query to obtain the incremental records as many as possible while minimizing the communication cost. In this paper, an effective and efficient approach is proposed to solve this problem. In the approach, a set covering model is used to indicate the web database; based on this model, an incremental harvest model is learned by the machine learning method to select the appropriate query automatically. Extensive experimental evaluations over real web databases test and validate our techniques.
8
Adapting ranking SVM to document retrieval
Yunbo Cao, Jun Xu, Tie‐Yan Liu et al. · 2006 · 573 citations
Web data extraction based on partial tree alignment
Yanhong Zhai, Bing Liu · 2005 · 495 citations
Bin He, Mitesh Patel, Zhen Zhang et al. · Communications of the ACM · 2007 · 328 citations
Fully automatic wrapper generation for search engines
Hongkun Zhao, Weiyi Meng, Zonghuan Wu et al. · 2005 · 295 citations