Search algorithm of Relations in SNS

DOI

10.2991/ameii-15.2015.351How to use a DOI?

Keywords

interpersonal relationship; SNS; N shortest relationship paths; improved Dijkstra.

Abstract

Interpersonal relationship plays a more and more important role in the real society. The study of relationship research algorithm is especially important .Based on the shortest path of graph theory and combined with the fact of the social network service (SNS) searching, the interpersonal closeness degree matrix is established. The improved Dijkstra algorithm is proposed to calculate N shortest relationship paths between any two persons that will establish the contact. It can get reasonable contact information by calculating and then determine realistic way of social interaction according to the actual situation. The research is significant to business activities and recruitment information delivery of connections among people.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Huanli Han
AU  - Guifa Teng
AU  - Yunli Zhang
AU  - Meng Hu
AU  - Yue Wang
PY  - 2015/04
DA  - 2015/04
TI  - Search algorithm of Relations in SNS
BT  - Proceedings of the International Conference on Advances in Mechanical Engineering and Industrial Informatics
PB  - Atlantis Press
SP  - 1890
EP  - 1894
SN  - 2352-5401
UR  - https://doi.org/10.2991/ameii-15.2015.351
DO  - 10.2991/ameii-15.2015.351
ID  - Han2015/04
ER  -