With the goal of harvesting all information about a given entity, in this paper, we try to harvest all matching documents for a given query submitted on a search engine. The objective is to retrieve all information about for instance "Michael Jackson", "Islamic State", or "FC Barcelona" from indexed data in search engines, or hidden data behind web forms, using a minimum number of queries. Policies of web search engines usually do not allow accessing all of the matching query search results for a given query. They limit the number of returned documents and the number of user requests. These limitations are also applied in deep web sources, for instance in social networks like Twitter. In this work, we propose a new approach which automatically collects information related to a given query from a search engine, given the search engine's limitations. The approach minimizes the number of queries that need to be sent by analysing the retrieved results and combining this analysed information with information from a large external corpus. The new approach outperforms existing approaches when tested on Google, measuring the total number of unique documents found per query.
|Title of host publication||Proceedings of the 17th International Conference on Information Integration and Web-based Applications & Services (iiWAS 2015)|
|Place of Publication||New York|
|Publisher||Association for Computing Machinery (ACM)|
|Number of pages||9|
|Publication status||Published - 11 Dec 2015|
Khelghati, M., Hiemstra, D., & van Keulen, M. (2015). Towards Complete Coverage in Focused Web Harvesting. In Proceedings of the 17th International Conference on Information Integration and Web-based Applications & Services (iiWAS 2015) (pp. 65). New York: Association for Computing Machinery (ACM). https://doi.org/10.1145/2837185.2837208