Pure Spreading Activation is Pointless

author: Kilian Thiel, University of Konstanz
published: Oct. 20, 2009,   recorded: September 2009,   views: 3945
Categories

Slides

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Delicious Bibliography

Description

Spreading activation is a popular technique for retrieving and ranking indirectly related information by activating query items and spreading their activation along relatedness links. Almost every use of the technique is accompanied by its own set of restrictions on the dynamics, though, and the usual motivation is a reduced computational demand or an improved t to specifi c types of data. We show that in linear, constraint-free scenarios spreading activation would actually yield query-independent results, so that applications crucially depend on the imposed restrictions. To avoid this undesirable behavior, we study natural modifi cations that ensure query-dependent results even without heuristic restrictions and provide experimental evidence for their effectiveness.

See Also:

Download slides icon Download slides: ecmlpkdd09_berthold_psap_01.pdf (305.2┬áKB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: