SIGIR '89 Proceedings of the 12th annual international ACM SIGIR conference on Research and development in information retrieval
Application of Spreading Activation Techniques in InformationRetrieval
Artificial Intelligence Review
On the Use of Spreading Activation Methods in Automatic Information Retrieval
On the Use of Spreading Activation Methods in Automatic Information Retrieval
Spreading Activation Models for Trust Propagation
EEE '04 Proceedings of the 2004 IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE'04)
Network Analysis: Methodological Foundations (Lecture Notes in Computer Science)
Network Analysis: Methodological Foundations (Lecture Notes in Computer Science)
Boosting Item Keyword Search with Spreading Activation
WI '05 Proceedings of the 2005 IEEE/WIC/ACM International Conference on Web Intelligence
Automatic Information Organization and Retrieval.
Automatic Information Organization and Retrieval.
Dual diffusion model of spreading activation for content-based image retrieval
MIR '06 Proceedings of the 8th ACM international workshop on Multimedia information retrieval
Pure spreading activation is pointless
Proceedings of the 18th ACM conference on Information and knowledge management
Supporting creativity: towards associative discovery of new insights
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Towards creative information exploration based on koestler's concept of bisociation
Bisociative Knowledge Discovery
Bisociative knowledge discovery
IDA'11 Proceedings of the 10th international conference on Advances in intelligent data analysis X
Towards bisociative knowledge discovery
Bisociative Knowledge Discovery
From information networks to bisociative information networks
Bisociative Knowledge Discovery
Bisociative Knowledge Discovery
Hi-index | 0.00 |
In this paper we propose two methods to derive different kinds of node neighborhood based similarities in a network. The first similarity measure focuses on the overlap of direct and indirect neighbors. The second similarity compares nodes based on the structure of their possibly also very distant neighborhoods. Both similarities are derived from spreading activation patterns over time. Whereas in the first method the activation patterns are directly compared, in the second method the relative change of activation over time is compared. We applied both methods to a real world graph dataset and discuss some of the results in more detail.