Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Aghabozorgi, Farshad | Reza Khayyambashi, Mohammad; *
Affiliations: Faculty of Computer Engineering, University of Isfahan, Isfahan, Iran
Correspondence: [*] Corresponding author. Mohammad Reza Khayyambashi, Faculty of Computer Engineering, University of Isfahan, Postal Code 81746-73441, Isfahan, Iran. Tel.: +98 913 3676728; E-mail: [email protected].
Abstract: Link prediction is the problem of inferring future interactions among existing network members based on available knowledge. Computing similarity between a node pair is a known solution for link prediction. This article proposes some new similarity measures. Some of them use nodes’ recency of activities, some weights of edges and some fusion of both in their calculation. A new definition of recency is provided here. A supervised learning method that applies a range of network properties and nodes similarity measures as its features set is developed here for experiments. The results of the experiments indicate that using proposed similarity measures would improve the performance of the link prediction.
Keywords: Link prediction, supervised learning, recency, similarity measures, social networks
DOI: 10.3233/JIFS-17770
Journal: Journal of Intelligent & Fuzzy Systems, vol. 34, no. 4, pp. 2667-2678, 2018
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]