摘要

In the social computing environment, the complete information about an individual is usually distributed in heterogeneous social networks, which are presented as linked data. Synthetically recognizing and integrating these distributed and heterogeneous data for efficiently information searching is an important but challenging work. In this paper, a dynamic weight (DW)-based similarity calculation is proposed to recognize and integrate similar individuals from distributed data environments. First, each link of an individual is weighted by applying DW. Then, a semantic similarity metric is proposed to combine the DW into similarity calculation. Then, a searching system framework for a similarity-based individual is designed and tested in real-world data sets. Finally, massive experiments are conducted both in benchmark and real-world social community data sets. The results show that our approach can produce a good result in similar individual searching in social networks. In addition, it performs significantly better than the existing state-of-the-art approaches in similar individual searching.