An algorithm for identifying the best current friend in a social network
Fuente:
Redalyc
Saved in:
| Main Author: | |
|---|---|
| Format: | Artículo científico |
| Language: | en |
| Published: |
Universidad Nacional de Colombia
2015
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1876426543918481408 |
|---|---|
| author | F. J. Moreno |
| author_facet | F. J. Moreno |
| contents | An algorithm for identifying the best current friend in a social network F. J. Moreno S. Hernández Ingeniería graphs friends pagerank Social networks centrality measures A research field in the area of social networks (SNs) is the identification of some types of users and groups. To facilitate this process, a SN is usually represented by a graph. The centrality measures, which identify the most important vertices in a graph according to some criterion, are usual tools to analyze a graph. One of these measures is the PageRank (a measure originally designed to classify web pages). Informally, in the context of a SN, the PageRank of a user i represents the probability that another user of the SN is seeing the page of i after a considerable time of navigation in the SN. In this paper, we define a new type of user in a SN: the best current friend . The idea is to identify, among the friends of a user i , who is the friend k that would generate the highest decrease in the Page - Rank of i if k stops being his/her friend. This may be useful to identify the users/customers whose friendship/relationship should be a priority to keep. We provide formal definitions, algorithms and some experiments for this subject. Our experiments showed that the best current friend of a user is not necessarily the one who has the highest PageRank in the SN nor the one who has more friends. 2015 artículo científico 0120-5609 https://www.redalyc.org/articulo.oa?id=64340413013 en http://www.redalyc.org/revista.oa?id=643 Ingeniería e Investigación application/pdf Universidad Nacional de Colombia Ingeniería e Investigación (Colombia) Num.2 Vol.35 |
| format | Artículo científico |
| id | redalyc_64340413013 |
| institution | Redalyc |
| language | en |
| publishDate | 2015 |
| publisher | Universidad Nacional de Colombia |
| spellingShingle | An algorithm for identifying the best current friend in a social network F. J. Moreno Ingeniería graphs friends pagerank Social networks centrality measures An algorithm for identifying the best current friend in a social network F. J. Moreno S. Hernández Ingeniería graphs friends pagerank Social networks centrality measures A research field in the area of social networks (SNs) is the identification of some types of users and groups. To facilitate this process, a SN is usually represented by a graph. The centrality measures, which identify the most important vertices in a graph according to some criterion, are usual tools to analyze a graph. One of these measures is the PageRank (a measure originally designed to classify web pages). Informally, in the context of a SN, the PageRank of a user i represents the probability that another user of the SN is seeing the page of i after a considerable time of navigation in the SN. In this paper, we define a new type of user in a SN: the best current friend . The idea is to identify, among the friends of a user i , who is the friend k that would generate the highest decrease in the Page - Rank of i if k stops being his/her friend. This may be useful to identify the users/customers whose friendship/relationship should be a priority to keep. We provide formal definitions, algorithms and some experiments for this subject. Our experiments showed that the best current friend of a user is not necessarily the one who has the highest PageRank in the SN nor the one who has more friends. 2015 artículo científico 0120-5609 https://www.redalyc.org/articulo.oa?id=64340413013 en http://www.redalyc.org/revista.oa?id=643 Ingeniería e Investigación application/pdf Universidad Nacional de Colombia Ingeniería e Investigación (Colombia) Num.2 Vol.35 |
| title | An algorithm for identifying the best current friend in a social network |
| topic | Ingeniería graphs friends pagerank Social networks centrality measures |
| url | https://www.redalyc.org/articulo.oa?id=64340413013 |