TY - GEN
T1 - Evaluating disseminators for time-critical information diffusion on social networks
AU - Li, Yung-Ming
AU - Lin, Lien Fa
PY - 2012
Y1 - 2012
N2 - In recent years, information diffusion in social networks has received significant attention from the Internet research community driven by many potential applications such as viral marketing and sales promotions. One of the essential problems in information diffusion process is how to select a set of influential nodes as the initial nodes to disseminate the information through their social network. Most of the existing solutions aim at how to maximize the influence effectiveness of the initially selected "influential nodes", but pay little attention on how the influential nodes selection could minimize the cost of the diffusion. Diffusion effectiveness is important for the applications such as innovation and new technology diffusion. However, many applications, such as disseminating disaster information or product promotions, have the mission to deliver messages in a minimal time. In this paper, we design and implement an efficiently k-best social sites selected mechanism in such that the total diffusion "social cost" required for each user in this social network to receive the diffusion critical time information is minimized.
AB - In recent years, information diffusion in social networks has received significant attention from the Internet research community driven by many potential applications such as viral marketing and sales promotions. One of the essential problems in information diffusion process is how to select a set of influential nodes as the initial nodes to disseminate the information through their social network. Most of the existing solutions aim at how to maximize the influence effectiveness of the initially selected "influential nodes", but pay little attention on how the influential nodes selection could minimize the cost of the diffusion. Diffusion effectiveness is important for the applications such as innovation and new technology diffusion. However, many applications, such as disseminating disaster information or product promotions, have the mission to deliver messages in a minimal time. In this paper, we design and implement an efficiently k-best social sites selected mechanism in such that the total diffusion "social cost" required for each user in this social network to receive the diffusion critical time information is minimized.
KW - Information diffusion
KW - Social networks
KW - Time-critical
UR - http://www.scopus.com/inward/record.url?scp=84867655226&partnerID=8YFLogxK
U2 - 10.5220/0004072002510260
DO - 10.5220/0004072002510260
M3 - Conference contribution
AN - SCOPUS:84867655226
SN - 9789898565235
T3 - DCNET 2012, ICE-B 2012, OPTICS 2012 - Proceedings of the International Conference on Data Communication Networking, e-Business and Optical Communication Systems, ICETE
SP - 251
EP - 260
BT - DCNET 2012, ICE-B 2012, OPTICS 2012 - Proceedings of the International Conference on Data Communication Networking, e-Business and Optical Communication Systems, ICETE
T2 - 3rd International Conference on Data Communication Networking, DCNET 2012, 7th International Conference on e-Business, ICE-B 2012 and 3rd International Conference on Optical Communication Systems, OPTICS 2012
Y2 - 24 July 2012 through 27 July 2012
ER -