Pure spreading activation is pointless

Almost every application of spreading activation is accompanied by its own set of often heuristic restrictions on the dynamics. We show that in constraint-free scenarios spreading activation would actually yield query-independent results, so that the specific choice of restrictions is not only a pragmatic computational issue, but crucially determines the outcome. Categories and Subject Descriptors H.3.3 [Information storage and retrieval]: Information Search and Retrieval—retrieval models, search process General Terms Algorithms, Theory, Performance Keywords Spreading activation, cosine similarity, information retrieval

• Type: Conference
• Year: 2009
• Where: CIKM
• Authors: Michael R. Berthold, Ulrik Brandes, Tobias Kötter, Martin Mader, Uwe Nagel, Kilian Thiel
• Keywords: CIKM 2009, Database, Keywords Spreading Activation, Scenarios Spreading Activation, Spreading Activation