Complexity of data mining on the web

Evangelos Kranakis; Danny Krizanc; Andrzej Pelc; David Peleg

doi:10.1145/248052.248079

Complexity of data mining on the web

Evangelos Kranakis
, Danny Krizanc
, Andrzej Pelc
, David Peleg

Carleton University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	PODC 1996
Subtitle of host publication	Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Publisher	ACM
Pages	153
Number of pages	1
ISBN (Print)	9780897918008
DOIs	https://doi.org/10.1145/248052.248079
State	Published - 1 May 1996
Externally published	Yes
Event	15th Annual ACM Symposium on Principles of Distributed Computing, PODC 1996 - Philadelphia, PA, USA Duration: 23 May 1996 → 26 May 1996

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference	15th Annual ACM Symposium on Principles of Distributed Computing, PODC 1996
City	Philadelphia, PA, USA
Period	23/05/96 → 26/05/96

Access to Document

10.1145/248052.248079

Cite this

@inproceedings{bd5023d2495a4271bf96f107d3c2e992,

title = "Complexity of data mining on the web",

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.",

author = "Evangelos Kranakis and Danny Krizanc and Andrzej Pelc and David Peleg",

year = "1996",

month = may,

day = "1",

doi = "10.1145/248052.248079",

language = "אנגלית",

isbn = "9780897918008",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

publisher = "ACM",

pages = "153",

booktitle = "PODC 1996",

note = "15th Annual ACM Symposium on Principles of Distributed Computing, PODC 1996 ; Conference date: 23-05-1996 Through 26-05-1996",

}

Kranakis, E, Krizanc, D, Pelc, A & Peleg, D 1996, Complexity of data mining on the web. in PODC 1996: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, ACM, pp. 153, 15th Annual ACM Symposium on Principles of Distributed Computing, PODC 1996, Philadelphia, PA, USA, 23/05/96. https://doi.org/10.1145/248052.248079

Complexity of data mining on the web. / Kranakis, Evangelos; Krizanc, Danny; Pelc, Andrzej et al.
PODC 1996: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing. ACM, 1996. p. 153 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Complexity of data mining on the web

AU - Kranakis, Evangelos

AU - Krizanc, Danny

AU - Pelc, Andrzej

AU - Peleg, David

PY - 1996/5/1

Y1 - 1996/5/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0029707472

U2 - 10.1145/248052.248079

DO - 10.1145/248052.248079

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0029707472

SN - 9780897918008

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 153

BT - PODC 1996

PB - ACM

T2 - 15th Annual ACM Symposium on Principles of Distributed Computing, PODC 1996

Y2 - 23 May 1996 through 26 May 1996

ER -

Complexity of data mining on the web

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this