Discovering the staring people from social networks

Authors:
Dewei Chen;Jie Tang;Juanzi Li;Lizhu Zhou
Affiliations:
Tsinghua University, Beijing, China;Tsinghua University, Beijing, China;Tsinghua University, Beijing, China;Tsinghua University, Beijing, China
Venue:
Proceedings of the 18th international conference on World wide web
Year:
2009

Citing 4
Cited 2

Theory and Practice of Uncertain Programming

Theory and Practice of Uncertain Programming
Formal models for expert finding in enterprise corpora

SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Facetnet: a framework for analyzing communities and their evolutions in dynamic networks

Proceedings of the 17th international conference on World Wide Web
Graph summarization with bounded error

Proceedings of the 2008 ACM SIGMOD international conference on Management of data

Understanding a celebrity with his salient events

AMT'10 Proceedings of the 6th international conference on Active media technology
Affinity-driven blog cascade analysis and prediction

Data Mining and Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study a novel problem of staring people discovery from social networks, which is concerned with finding people who are not only authoritative but also sociable in the social network. We formalize this problem as an optimization programming problem. Taking the co-author network as a case study, we define three objective functions and propose two methods to combine these objective functions. A genetic algorithm based method is further presented to solve this problem. Experimental results show that the proposed solution can effectively find the staring people from social networks.