Spreading Activation for Web Scale Reasoning: Promise and Problems

Nazihah Md. Akim, Alan Dix, Akrivi Katifori, Giorgos Lepouras, Nadeem Shabir, Costas Vassilakis
ACM WebSci 11, poster presentation

Various forms of spreading activation has been used in a number of web systems, not least in the PageRank algorithm. In our own work we have been using this as a technique for managing context over small and large ontologies, and both our own work and that in LarKC suggests that spreading activation has the potential to aid in reasoning over web-scale data sets including the growing set of linked open data resources. Of particular importance is that spreading activation can be applied locally to a dynamic self-selecting working set of an (practically) unbound linked data collection, as well as globally to the entire collection. However, this potential does not come without problems, some concerning the nature of the algorithm on any large data set, and some more to do with the particular nature of linked open data.

Note: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
PDF icon WebSci2011-Spreading-Act.pdf398.74 KB