國立高雄大學圖資館 |

Ranking models to identify influential actors in large-scale social networks.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Ranking models to identify influential actors in large-scale social networks.
Author:	Lu, Xiaohui.
Description:	150 p.
Notes:	Source: Dissertation Abstracts International, Volume: 75-02(E), Section: B.
Notes:	Adviser: Sibel Adali.
Contained By:	Dissertation Abstracts International75-02B(E).
Subject:	Computer Science.
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3601015
ISBN:	9781303514654

Ranking models to identify influential actors in large-scale social networks.
Lu, Xiaohui.

Ranking models to identify influential actors in large-scale social networks. - 150 p.

Source: Dissertation Abstracts International, Volume: 75-02(E), Section: B.

Thesis (Ph.D.)--Rensselaer Polytechnic Institute, 2013.

One of the primary tasks of social network analysis is the identification of the "important" or "prominent" actors in a social network. Centrality measures based on one's structural position, such as betweenness, closeness and degree centrality, are widely applied to various social networks for this purpose. However, these measures often suffer from prohibitive computational cost, non-intuitive assumptions, and limited applications. Meanwhile, with the explosive emergence and the widespread accessibility of online social network sites, large scale networks with multiple types of entities, such as author-publication, actor-movie, employee-email networks, are ubiquitous and readily available. However, due to size and multiple modes, centrality measures are helpless in such networks. In this thesis, we develop a framework to identify prominent actors from several perspectives. We first investigate the importance of actors in actor-actor networks. In these networks, centrality algorithms are good candidates. However, these centrality measures suffer from several issues - they either look solely at the structure of the network disregarding issues like attention nodes have to give to others or make a shortest path interaction assumption that might be impractical in large networks. To address these issues, we develop two algorithms "Attentive Betweenness Centrality (ABC)" and "Attentive Closeness Centrality (ACC)". These two algorithms take multiple paths of information flow and attention into consideration while computing importance scores of actors. ABC reduces anomalous behaviors of classical betweenness centrality while captures its essence. ACC, on the other hand, targets the improvement of closeness. These two algorithms have high performance in identifying prominent actors. In many cases, algorithms for pure actor-actor networks are not able to take advantage of abundant information hidden in multi-mode (heterogeneous) networks. We develop an algorithm to analyze such heterogeneous networks - "iterative Hyperedge Ranking (iHypR)". As the name implies, the algorithm iterates from one type of objects to another, and importance of objects flow through these different types of edges. This algorithm is based on empirical observations - prominent actors are likely to collaborate with prominent others; good collaboration product tends to be in good groups. The aforementioned algorithms are very different in methodology, however, they have one point in common - ranking actors globally. In the third model, we look at individual centrality in one's own community and the community centrality. We develop methods to compute prominence of individuals as a function of their position in their own communities and the importance of their communities in the network. We illustrate with many real life social networks that the algorithms in this thesis improve on the state of the art in computing prominence by incorporating different network levels of information.

ISBN: 9781303514654Subjects--Topical Terms:

212513
Computer Science.

Ranking models to identify influential actors in large-scale social networks.
LDR:03878nmm a2200277 4500 001 419334
005 20140520124017.5
008 140717s2013 ||||||||||||||||| ||eng d
020 $a 9781303514654
035 $a (MiAaPQ)AAI3601015
035 $a AAI3601015
040 $a MiAaPQ $c MiAaPQ
100 1 $a Lu, Xiaohui. $3 264297
245 1 0 $a Ranking models to identify influential actors in large-scale social networks.
300 $a 150 p.
500 $a Source: Dissertation Abstracts International, Volume: 75-02(E), Section: B.
500 $a Adviser: Sibel Adali.
502 $a Thesis (Ph.D.)--Rensselaer Polytechnic Institute, 2013.
520 $a One of the primary tasks of social network analysis is the identification of the "important" or "prominent" actors in a social network. Centrality measures based on one's structural position, such as betweenness, closeness and degree centrality, are widely applied to various social networks for this purpose. However, these measures often suffer from prohibitive computational cost, non-intuitive assumptions, and limited applications. Meanwhile, with the explosive emergence and the widespread accessibility of online social network sites, large scale networks with multiple types of entities, such as author-publication, actor-movie, employee-email networks, are ubiquitous and readily available. However, due to size and multiple modes, centrality measures are helpless in such networks. In this thesis, we develop a framework to identify prominent actors from several perspectives. We first investigate the importance of actors in actor-actor networks. In these networks, centrality algorithms are good candidates. However, these centrality measures suffer from several issues - they either look solely at the structure of the network disregarding issues like attention nodes have to give to others or make a shortest path interaction assumption that might be impractical in large networks. To address these issues, we develop two algorithms "Attentive Betweenness Centrality (ABC)" and "Attentive Closeness Centrality (ACC)". These two algorithms take multiple paths of information flow and attention into consideration while computing importance scores of actors. ABC reduces anomalous behaviors of classical betweenness centrality while captures its essence. ACC, on the other hand, targets the improvement of closeness. These two algorithms have high performance in identifying prominent actors. In many cases, algorithms for pure actor-actor networks are not able to take advantage of abundant information hidden in multi-mode (heterogeneous) networks. We develop an algorithm to analyze such heterogeneous networks - "iterative Hyperedge Ranking (iHypR)". As the name implies, the algorithm iterates from one type of objects to another, and importance of objects flow through these different types of edges. This algorithm is based on empirical observations - prominent actors are likely to collaborate with prominent others; good collaboration product tends to be in good groups. The aforementioned algorithms are very different in methodology, however, they have one point in common - ranking actors globally. In the third model, we look at individual centrality in one's own community and the community centrality. We develop methods to compute prominence of individuals as a function of their position in their own communities and the importance of their communities in the network. We illustrate with many real life social networks that the algorithms in this thesis improve on the state of the art in computing prominence by incorporating different network levels of information.
590 $a School code: 0185.
650 4 $a Computer Science. $3 212513
650 4 $a Sociology, Social Structure and Development. $3 212432
690 $a 0984
690 $a 0700
710 2 $a Rensselaer Polytechnic Institute. $b Computer Science. $3 660408
773 0 $t Dissertation Abstracts International $g 75-02B(E).
790 $a 0185
791 $a Ph.D.
792 $a 2013
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3601015