Incremental Web-Site Boundary Detection Using Random Walks-Reference-Cited by-同舟云学术

Incremental Web-Site Boundary Detection Using Random Walks

Published:2011 Issue: Volume: Page:414-427
ISSN:0302-9743
Container-title:Machine Learning and Data Mining in Pattern Recognition
language:
Short-container-title:

Author:

Alshukri Ayesh,Coenen Frans,Zito Michele

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-23199-5_31

Reference25 articles.

1. Lecture Notes in Computer Science;S. Abiteboul,2002

2. Aldous, D., Fill, J.: Reversible markov chains and random walks on graphs. Monograph in preparation (2002)

3. Aleliunas, R., Karp, R.M., Lipton, R.J., Lovasz, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: Proceedings of the 20th Annual Symposium on Foundations of Computer Science, pp. 218–223. IEEE Computer Society, Washington, DC, USA (1979)

4. Lecture Notes in Computer Science;A. Alshukri,2010

5. Bharat, K., Chang, B.-W., Henzinger, M.R., Ruhl, M.: Who links to whom: Mining linkage between web sites. In: Proceedings of the 2001 IEEE International Conference on Data Mining, ICDM 2001, pp. 51–58. IEEE Computer Society, Washington, DC, USA (2001)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Mining the information architecture of the WWW using automated website boundary detection;Web Intelligence;2017-11-20

2. A Dynamic Approach to the Website Boundary Detection Problem Using Random Walks;2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT);2014-08

3. Mining Groups of Common Interest: Discovering Topical Communities with Network Flows;Machine Learning and Data Mining in Pattern Recognition;2013