Complexity of data mining on the web

Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg

Research output: Contribution to conferencePaperpeer-review

Abstract

Nowadays, to a certain extent, some sites charged users for access to particular Web pages. Hence, it is even possible to particularly useful catalogues of WWW pages will require payment. Moreover, telecommunication companies may start charging Internet access per use rather than a flat access fee. This situation makes it important to use good strategies for searching the Web with a restricted budget. This paper proposes a model for this task, under various assumptions regarding access costs on the Web. It then investigates the complexity of finding optimal search strategies with a given budget and develops such strategies in several cases.

Original languageEnglish
Pages153
Number of pages1
DOIs
StatePublished - 1996
Externally publishedYes
EventProceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing - Philadelphia, PA, USA
Duration: 23 May 199626 May 1996

Conference

ConferenceProceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing
CityPhiladelphia, PA, USA
Period23/05/9626/05/96

Fingerprint

Dive into the research topics of 'Complexity of data mining on the web'. Together they form a unique fingerprint.

Cite this