TY  - CONF
AU  - Adamic, Lada A.
A2  - 
T1  - The social hyperlink
T2  - HT '09: Proceedings of the 20th ACM conference on Hypertext and hypermedia
PB  - ACM
C1  - New York, NY, USA
PY  - 2009/
CY  -  
VL  - 
IS  - 
SP  - 1
EP  - 2
UR  - http://portal.acm.org/citation.cfm?id=1557914.1557916&coll=portal&dl=acm&type=series&idx=SERIES399&part=series&WantType=Proceedings&title=HT&CFID=://www.bibsonomy.org/user/hotho/ht09&CFTOKEN=www.bibsonomy.org/user/hotho/ht09
DO  - http://doi.acm.org/10.1145/1557914.1557916
KW  - ht09
KW  - hyperlink
KW  - keynote
KW  - social
L1  - 
SN  - 978-1-60558-486-7
N1  - HT: HT '09, The social hyperlink
N1  - 
AB  - 
ER  -

TY  - CONF
AU  - Morishima, Atsuyuki
AU  - Nakamizo, Akiyoshi
AU  - Iida, Toshinari
AU  - Sugimoto, Shigeo
AU  - Kitagawa, Hiroyuki
A2  - 
T1  - Bringing Your Dead Links Back to Life: A Comprehensive Approach and Lessons Learned
T2  - HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia
PB  - ACM
C1  - New York, NY, USA
PY  - 2009/07
CY  -  
VL  - 
IS  - 
SP  - 
EP  - 
UR  - 
DO  - 
KW  - broken
KW  - detection
KW  - ht09
KW  - hyperlink
KW  - link
L1  - 
SN  - 
N1  - 
N1  - 
AB  - 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. 
<p>Our 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. 
<p>The 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. 
<p>We demonstrated empirically that the problem of searching for moved pages is different from typical information retrieval problems. 
<p>First, it is impossible to identify the final destination until the page is moved, so the index-server approach is not necessarily effective. 
<p>Secondly, 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.
<p>We analyzed the experimental results in detail to show how important each heuristic is in real Web settings,
<p>and 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.
ER  -

TY  - CONF
AU  - Chakrabarti, S.
AU  - Dom, B.
AU  - Gibson, D.
AU  - Kleinberg, J.
AU  - Raghavan, P.
AU  - Rajagopalan, S.
A2  - 
T1  - Automatic resource compilation by analyzing hyperlink structure and associated text
T2  - Proceedings of the 7th World-wide web conference (WWW7),30(1-7)
PB  - 
C1  - 
PY  - 1998/
CY  -  
VL  - 
IS  - 
SP  - 65
EP  - 74
UR  - citeseer.nj.nec.com/chakrabarti98automatic.html
DO  - 
KW  - text
KW  - compilation
KW  - hyperlink
KW  - analyze
KW  - resource
KW  - structure
KW  - automatic
L1  - 
SN  - 
N1  - 
N1  - 
AB  - 
ER  -