Social networks attract much attention due to their ability to replicate social interactions at scale. Link prediction, or the assessment of which unconnected nodes are likely to connect in the future, is an interesting but non-trivial research area. Three approaches exist to deal with the link-prediction problem: featurebased models, Bayesian probabilistic models, and probabilistic relational models. In feature-based methods, graphical features are extracted and used for classification. Usually, these features are subdivided into three feature groups based on their formula. Some formulas are extracted based on neighborhood graph traverse. Accordingly, there exist three groups of features: neighborhood features, pathbased features, and node-based features. In this paper, we attempt to validate the underlying structure of topological features used in feature-based link prediction. The results of our analysis indicate differing results from the prevailing grouping of these features, which indicates that current literatures' classification of feature groups should be redefined. Thus, the contribution of this work is exploring the factor loading of graphical features in link prediction in social networks. To the best of our knowledge, no prior studies had addressed it.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.