TY - GEN
T1 - Automatic reputation computation through document analysis
T2 - 2011 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011
AU - Lee, Joo Young
AU - Duan, Yue
AU - Oh, Jae C.
AU - Du, Wenliang
AU - Blair, Howard
AU - Wang, Lusha
AU - Jin, Xing
PY - 2011
Y1 - 2011
N2 - We develop and study two social network-based algorithms for automatically computing authors' reputations from a collection of textual documents. First, given a set of documents, both algorithms examine keyword reference behaviors of the authors to construct a social network. This social network represents the relationship among the authors in terms of information reference behavior. With the resulting network, the first algorithm computes each author's reputation value considering only direct referential activities while the second considers indirect activities as well. We discuss the reputation values computed by the two algorithms and compare them with the reputation ratings given by a human domain expert. We also analyze the social network through a community detection algorithm. We observed several interesting phenomena including the network being scale-free and having negative assortativity.
AB - We develop and study two social network-based algorithms for automatically computing authors' reputations from a collection of textual documents. First, given a set of documents, both algorithms examine keyword reference behaviors of the authors to construct a social network. This social network represents the relationship among the authors in terms of information reference behavior. With the resulting network, the first algorithm computes each author's reputation value considering only direct referential activities while the second considers indirect activities as well. We discuss the reputation values computed by the two algorithms and compare them with the reputation ratings given by a human domain expert. We also analyze the social network through a community detection algorithm. We observed several interesting phenomena including the network being scale-free and having negative assortativity.
UR - http://www.scopus.com/inward/record.url?scp=80052747431&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80052747431&partnerID=8YFLogxK
U2 - 10.1109/ASONAM.2011.124
DO - 10.1109/ASONAM.2011.124
M3 - Conference contribution
AN - SCOPUS:80052747431
SN - 9780769543758
T3 - Proceedings - 2011 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011
SP - 559
EP - 560
BT - Proceedings - 2011 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011
Y2 - 25 July 2011 through 27 July 2011
ER -