Abstract
Modeling data as a graph of objects is increasingly popular, as we move away from the relational DB model and try to introduce explicit semantics in IR. Conceptually, one of the main challenges in this context is how to “intelligently” traverse the graph and exploit the associations between the data objects. Two highly used methods in retrieving information on structured data are: Markov chain random walks, as is the basic method for page rank, and spreading activation, which originates from the artificial intelligence area. In this paper, we compare these two methods from a mathematical point of view. Random walks have been preferred in information retrieval, while spreading activation has been proposed before, but not really adopted. In this study we find that they are very similar fundamentally under certain conditions. However, spreading activation has much more flexibility and customization options, while random walks holds concise mathematics foundation.
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
Berkhin, P.: A survey on pagerank computing. Internet Mathematics 2 (2005)
Berthold, M.R., Brandes, U., Kötter, T., Mader, M., Nagel, U., Thiel, K.: Pure spreading activation is pointless. In: Proc. of CIKM (2009)
Chib, S., Greenberg, E.: Understanding the metropolis-hastings algorithm. The American Statistician 49(4) (1995)
Clements, M., De Vries, A.P., Reinders, M.J.T.: The task-dependent effect of tags and ratings on social media access. ACM Trans. Inf. Syst. 28(4) (2010)
Collins-Thompson, K., Callan, J.: Query expansion using random walk models. In: Proc. of CIKM (2005)
Craswell, N., Szummer, M.: Random walks on the click graph. In: Proc. of SIGIR (2007)
Crestani, F.: Application of spreading activation techniques in information retrieval. Artificial Intelligence Review 11 (1997)
Golub, G.H., Van Loan, C.F.: Matrix computations, 3rd edn. Johns Hopkins University Press (1996)
Hussein, T., Ziegler, J.: Adapting web sites by spreading activation in ontologies. In: Int. Workshop on Recommendation and Collaboration (in Conjunction with IUI 2008) (2008)
Richardson, M., Domingos, P.: The Intelligent Surfer: Probabilistic Combination of Link and Content Information in PageRank. In: Proc. of NIPS (2002)
Rocha, C., Schwabe, D., Aragao, M.P.: A hybrid approach for searching in the semantic web. In: Proc. of WWW (2004)
Sabetghadam, S., Lupu, M., Rauber, A.: Astera - a generic model for multimodal information retrieval. In: Proc. of Integrating IR Technologies for Professional Search Workshop (2013)
Sabetghadam, S., Bierig, R., Rauber, A.: A hybrid approach for multi-faceted IR in multimodal domain. In: Kanoulas, E., Lupu, M., Clough, P., Sanderson, M., Hall, M., Hanbury, A., Toms, E. (eds.) CLEF 2014. LNCS, vol. 8685, pp. 86–97. Springer, Heidelberg (2014)
Salton, G., Buckley, C.: On the use of spreading activation methods in automatic information. In: Proc. of SIGIR (1988)
Szummer, M., Jaakkola, T.: Partially labeled classification with markov random walks. In: NIPS (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Sabetghadam, S., Lupu, M., Rauber, A. (2014). Which One to Choose: Random Walks or Spreading Activation?. In: Lamas, D., Buitelaar, P. (eds) Multidisciplinary Information Retrieval. IRFC 2014. Lecture Notes in Computer Science, vol 8849. Springer, Cham. https://doi.org/10.1007/978-3-319-12979-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-12979-2_11
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12978-5
Online ISBN: 978-3-319-12979-2
eBook Packages: Computer ScienceComputer Science (R0)