Abstract
Much research has been performed investigating how links between web pages can be exploited in an Information Retrieval setting [1,4]. In this poster, we investigate the application of the Barabási-Albert model to link structure analysis on a collection of web documents within the language modeling framework. Our model utilizes the web structure as described by a Scale Free Network and derives a document prior based on a web document’s age and linkage. Preliminary experiments indicate the utility of our approach over other current link structure algorithms and warrants further research.
Similar content being viewed by others
References
Baeza-Yates, R., Saint-Jean, F., Castillo, C.: Web structure, age and page quality. In: 2nd International Workshop on Web Dynamics, WebDyn 2002 (2002)
Barabási, A.-L., Albert, R., Jeong, H.: Mean-field theory for scale-free random networks. Physica A 272(173) (1999), cond-mat/9907068
Barabási, A.-L., Albert, R., Jeong, H.: Scale-free characteristics of random networks: the topology of the world wide web. Physica A 281(69) (2000)
Kraaij, W., Westerveld, T.: Tno/ut at trec-9: How different are web documents? In: Proceedings of the ninth Text Retrieval Conference TREC-9, pp. 665–671 (2001)
Miller, D.R.H., Leek, T., Schwartz, R.M.: A hidden markov model information retrieval. In: 22nd Annual International ACM SIGIR conference on Research and development in information retrieval, California, US, pp. 214–221. ACM Press, New York (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hauff, C., Azzopardi, L. (2005). Age Dependent Document Priors in Link Structure Analysis. In: Losada, D.E., Fernández-Luna, J.M. (eds) Advances in Information Retrieval. ECIR 2005. Lecture Notes in Computer Science, vol 3408. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31865-1_48
Download citation
DOI: https://doi.org/10.1007/978-3-540-31865-1_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25295-5
Online ISBN: 978-3-540-31865-1
eBook Packages: Computer ScienceComputer Science (R0)