DocumentCode :
2210362
Title :
Node Similarities from Spreading Activation
Author :
Thiel, Kilian ; Berthold, Michael R.
Author_Institution :
Dept. of Bioinf. & Inf. Min., Univ. of Konstanz, Konstanz, Germany
fYear :
2010
fDate :
13-17 Dec. 2010
Firstpage :
1085
Lastpage :
1090
Abstract :
In this paper we propose two methods to derive two different kinds of node similarities in a network based on their neighborhood. 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. Instead of using standard node measures, 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 apply both methods to a real-world graph dataset and discuss the results.
Keywords :
data analysis; graph theory; graph dataset; node similarity; spreading activation; graph analysis; node signatures; node similarities; spreading activation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Mining (ICDM), 2010 IEEE 10th International Conference on
Conference_Location :
Sydney, NSW
ISSN :
1550-4786
Print_ISBN :
978-1-4244-9131-5
Electronic_ISBN :
1550-4786
Type :
conf
DOI :
10.1109/ICDM.2010.108
Filename :
5694089
Link To Document :
بازگشت