Web-site boundary detection using incremental randomwalk clustering

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we describe a random walk clustering technique to addressthe Website Boundary Detection (WBD) problem. The technique is fully described and compared with alternative (breadth and depth first) approaches. The reported evaluation demonstrates that the random walk technique produces comparable or better results than those produced by these alternative techniques, while at the same time visiting fewer 'noise' pages. To demonstrate that the good results are not simply a consequence of a randomisation of the input data we also compare with a random ordering technique. © Springer-Verlag London Limited 2011.

Cite

CITATION STYLE

APA

Alshukri, A., Coenen, F., & Zito, M. (2011). Web-site boundary detection using incremental randomwalk clustering. In Res. and Dev. in Intelligent Syst. XXVIII: Incorporating Applications and Innovations in Intel. Sys. XIX - AI 2011, 31st SGAI Int. Conf. on Innovative Techniques and Applications of Artificial Intel. (pp. 255–268). Springer London. https://doi.org/10.1007/978-1-4471-2318-7_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free