Morishima, A.; Nakamizo, A.; Iida, T.; Sugimoto, S. & Kitagawa, H.: Bringing Your Dead Links Back to Life: A Comprehensive Approach and Lessons Learned. HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia. New York, NY, USA: ACM, 2009
This paper presents an experimental study of the automatic correction of broken (dead) Web links focusing, in particular, on links broken by the relocation of Web pages.
r first contribution is that we developed an algorithm that incorporates a comprehensive set of heuristics, some of which are novel, in a single unified framework.
e second contribution is that we conducted a relatively large-scale experiment, and analysis of our results revealed the characteristics of the problem of finding moved Web pages.
demonstrated empirically that the problem of searching for moved pages is different from typical information retrieval problems.
rst, it is impossible to identify the final destination until the page is moved, so the index-server approach is not necessarily effective.
condly, there is a large bias about where the new address is likely to be and crawler-based solutions can be effectively implemented, avoiding the need to search the entire Web.
analyzed the experimental results in detail to show how important each heuristic is in real Web settings,
d conducted statistical analyses to show that our algorithm succeeds in correctly finding new links for more than 70% of broken links at 95% confidence level.
@inproceedings{morishima2009bringing,
author = {Morishima, Atsuyuki and Nakamizo, Akiyoshi and Iida, Toshinari and Sugimoto, Shigeo and Kitagawa, Hiroyuki},
title = {Bringing Your Dead Links Back to Life: A Comprehensive Approach and Lessons Learned},
booktitle = {HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia},
publisher = {ACM},
address = {New York, NY, USA},
year = {2009},
keywords = {broken, detection, ht09, hyperlink, link},
abstract = {This paper presents an experimental study of the automatic correction of broken (dead) Web links focusing, in particular, on links broken by the relocation of Web pages.
r first contribution is that we developed an algorithm that incorporates a comprehensive set of heuristics, some of which are novel, in a single unified framework.
e second contribution is that we conducted a relatively large-scale experiment, and analysis of our results revealed the characteristics of the problem of finding moved Web pages.
demonstrated empirically that the problem of searching for moved pages is different from typical information retrieval problems.
rst, it is impossible to identify the final destination until the page is moved, so the index-server approach is not necessarily effective.
condly, there is a large bias about where the new address is likely to be and crawler-based solutions can be effectively implemented, avoiding the need to search the entire Web.
analyzed the experimental results in detail to show how important each heuristic is in real Web settings,
d conducted statistical analyses to show that our algorithm succeeds in correctly finding new links for more than 70% of broken links at 95% confidence level.}
}
Drost, I. & Scheffer, T.: Thwarting the Nigritude Ultramarine: Learning to Identify Link Spam.. ECML. 2005, S. 96-107
[Volltext]
@inproceedings{conf/ecml/DrostS05,
author = {Drost, Isabel and Scheffer, Tobias},
title = {Thwarting the Nigritude Ultramarine: Learning to Identify Link Spam.},
booktitle = {ECML},
year = {2005},
pages = {96-107},
url = {http://dblp.uni-trier.de/db/conf/ecml/ecml2005.html#DrostS05},
keywords = {spam, rank, link, mining, ml}
}
Getoor, L. & Diehl, C. P.: Link mining: a survey. In: SIGKDD Explor. Newsl. 7 (2005), Nr. 2, S. 3-12
[Volltext]
@article{1117456,
author = {Getoor, Lise and Diehl, Christopher P.},
title = {Link mining: a survey},
journal = {SIGKDD Explor. Newsl.},
publisher = {ACM Press},
address = {New York, NY, USA},
year = {2005},
volume = {7},
number = {2},
pages = {3--12},
url = {http://www.cpdiehl.org/lmsurvey.pdf},
doi = {http://doi.acm.org/10.1145/1117454.1117456},
keywords = {survey, link, mining}
}