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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S. Abiteboul, G. Cobena, J. Masanés, and G. Sedrati. A First Experience in Archiving the French Web. In ECDL ’02 Proceedings of the 6th European Conference on Research and Advanced Technology for Digital Libraries, volume 2458 of Lecture Notes in Computer Science, pages 1–15. Springer, 2002.
R. Albert, H. Jeong, and A-l. Barabási. Diameter of the world wide web. Computing Research Repository, 1999.
D. Aldous and J. Fill. Reversible Markov chains and random walks on graphs. Monograph in preparation, 2002.
R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovasz, and C. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. 20th Annual Symp. on Foundations of Computer Science, pages 218–223, 1979.
A Alshukri, F. Coenen, and M. Zito. Web-Site Boundary Detection. In Proceedings of the 10th Industrial Conference on Data Mining, pages 529–543, Berlin, Germany, 2010. Springer.
Albert-Laszloand Barabasi and Reka Albert. Emergence of scaling in random networks. Science, 1999.
K. Bharat, B-W. Chang, M. Henzinger, and M. Ruhl. Who links to whom: mining linkage between Web sites. In Proceedings 2001 IEEE International Conference on Data Mining, pages 51–58, Washington, DC, USA, 2001. IEEE Computer Society.
A. Z Broder. Graph structure in the Web. Computer Networks, 33(1-6):309–320, June 2000.
A. Z Broder, M Najork, and J. LWiener. Efficient URL caching for world wide web crawling. In WWW’03 Proceedings of the 12th international conference on World Wide Web, pages 679–689, Budapest, Hungary., 2003. ACM.
P. Dmitriev. As we may perceive: finding the boundaries of compound documents on the web. In WWW’08 Proceeding of the 17th international conference on World Wide Web, pages 1029–1030, Beijing, China, 2008. ACM.
M. H. Dunham. Data Mining: Introductory and Advanced Topics. Prentice Hall PTR Upper Saddle River, NJ, USA, 2002.
W. Feller. Introduction to probability theory and its applications. WSS, vol. 1, 1968.
J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann, 2001.
M. Henzinger. Finding near-duplicate web pages: a large-scale evaluation of algorithms. In Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, pages 284–291. ACM, 2006.
R. Kumar. Trawling the Web for emerging cyber-communities. Computer Networks, 31(11-16):1481–1493, May 1999.
R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. Stochastic models for the Web graph. In Proceedings 41st Annual Symposium on Foundations of Computer Science, pages 57–65, Washington, DC, USA, 2000. IEEE Computer Society.
B. Liu. Web Data Mining: Exploring Hyperlinks, Contents, and Usage Data. Springer, Springer-Verlag New York, Inc., 2007.
L. Lovász. Random walks on graphs: A survey. YaleU/DCS/TR-1029, 2:1–46, 1994.
J.M Peña, J.A Lozano, and P Larrañaga. An empirical comparison of four initialization methods for the K-Means algorithm. Pattern Recognition Letters, 20(10):1027–1040, October 1999.
J. Pokorn. Web Searching and Information Retrieval. Computing in Science and Engineering, 6(4):43–48, 2004.
P. Senellart. Identifying Websites with Flow Simulation. In David Lowe and Martin Gaedke, editors, ICWE, volume 3579 of Lecture Notes in Computer Science, Orsay, France., 2005. Gemo, INRIA Futurs., Springer.
P. N. Tan, M. Steinbach, and V. Kumar. Introduction to Data Mining. Pearson International Edition, 2006.
B. Meck Thiesson, C. Chickering, and D. Heckerman. Learning mixtures of Bayesian networks. Technical report, Microsoft Research Technical Report TR-97-30, Redmond, WA, 1997.
I. H. Witten and E. Frank. Data Mining: practical machine learning tools and techniques. Morgan Kaufman, 2005.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag London Limited
About this paper
Cite this paper
Alshukri, A., Coenen, F., Zito, M. (2011). Web-Site Boundary Detection Using Incremental RandomWalk Clustering. In: Bramer, M., Petridis, M., Nolle, L. (eds) Research and Development in Intelligent Systems XXVIII. SGAI 2011. Springer, London. https://doi.org/10.1007/978-1-4471-2318-7_20
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2318-7_20
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-2317-0
Online ISBN: 978-1-4471-2318-7
eBook Packages: Computer ScienceComputer Science (R0)