SimRank: a measure of structural-context similarity
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Introduction to Data Mining, (First Edition)
Introduction to Data Mining, (First Edition)
CollabSeer: a search engine for collaboration discovery
Proceedings of the 11th annual international ACM/IEEE joint conference on Digital libraries
Discovering missing links in networks using vertex similarity measures
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Predicting recent links in FOAF networks
SBP'12 Proceedings of the 5th international conference on Social Computing, Behavioral-Cultural Modeling and Prediction
Taxonomy-based query-dependent schemes for profile similarity measurement
Proceedings of the 1st Joint International Workshop on Entity-Oriented and Semantic Search
ASCOS: an asymmetric network structure COntext similarity measure
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Hi-index | 0.00 |
We introduce the graph vertex similarity measure, Relation Strength Similarity (RSS), that utilizes a network's topology to discover and capture similar vertices. The RSS has the advantage that it is asymmetric; can be used in a weighted network; and has an adjustable "discovery range" parameter that enables exploration of friend of friend connections in a social network. To evaluate RSS we perform experiments on a coauthorship network from the CiteSeerX database. Our method significantly outperforms other vertex similarity measures in terms of the ability to predict future coauthoring behavior among authors in the CiteSeerX database for the near future 0 to 4 years out and reasonably so for 4 to 6 years out.