@inproceedings{d9e0f9aeceb34bb2a3d13e3e50d98c07,
title = "Capturing missing edges in social networks using vertex similarity",
abstract = "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.",
author = "Chen, \{Hung Hsuan\} and Liang Gou and Xiaolong Zhang and Giles, \{Clyde Lee\}",
year = "2011",
month = jun,
day = "26",
doi = "10.1145/1999676.1999722",
language = "English (US)",
isbn = "9781450303965",
series = "KCAP 2011 - Proceedings of the 2011 Knowledge Capture Conference",
publisher = "Association for Computing Machinery",
pages = "195--196",
booktitle = "KCAP 2011 - Proceedings of the 2011 Knowledge Capture Conference",
}