File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Influence spreading path and its application to the time constrained social influence maximization problem and beyond

TitleInfluence spreading path and its application to the time constrained social influence maximization problem and beyond
Authors
Keywordsinfluence maximization
Influence spreading path
large scale
social network
time constrained
Issue Date2014
Citation
IEEE Transactions on Knowledge and Data Engineering, 2014, v. 26, n. 8, p. 1904-1917 How to Cite?
AbstractInfluence maximization is a fundamental research problem in social networks. Viral marketing, one of its applications, is to get a small number of users to adopt a product, which subsequently triggers a large cascade of further adoptions by utilizing 'Word-of-Mouth' effect in social networks. Time plays an important role in the influence spread from one user to another and the time needed for a user to influence another varies. In this paper, we propose the time constrained influence maximization problem. We show that the problem is NP-hard, and prove the monotonicity and submodularity of the time constrained influence spread function. Based on this, we develop a greedy algorithm. To improve the algorithm scalability, we propose the concept of Influence Spreading Path in social networks and develop a set of new algorithms for the time constrained influence maximization problem. We further parallelize the algorithms for achieving more time savings. Additionally, we generalize the proposed algorithms for the conventional influence maximization problem without time constraints. All of the algorithms are evaluated over four public available datasets. The experimental results demonstrate the efficiency and effectiveness of the algorithms for both conventional influence maximization problem and its time constrained version. © 2013 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/321599
ISSN
2023 Impact Factor: 8.9
2023 SCImago Journal Rankings: 2.867
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorLiu, Bo-
dc.contributor.authorCong, Gao-
dc.contributor.authorZeng, Yifeng-
dc.contributor.authorXu, Dong-
dc.contributor.authorChee, Yeow Meng-
dc.date.accessioned2022-11-03T02:20:08Z-
dc.date.available2022-11-03T02:20:08Z-
dc.date.issued2014-
dc.identifier.citationIEEE Transactions on Knowledge and Data Engineering, 2014, v. 26, n. 8, p. 1904-1917-
dc.identifier.issn1041-4347-
dc.identifier.urihttp://hdl.handle.net/10722/321599-
dc.description.abstractInfluence maximization is a fundamental research problem in social networks. Viral marketing, one of its applications, is to get a small number of users to adopt a product, which subsequently triggers a large cascade of further adoptions by utilizing 'Word-of-Mouth' effect in social networks. Time plays an important role in the influence spread from one user to another and the time needed for a user to influence another varies. In this paper, we propose the time constrained influence maximization problem. We show that the problem is NP-hard, and prove the monotonicity and submodularity of the time constrained influence spread function. Based on this, we develop a greedy algorithm. To improve the algorithm scalability, we propose the concept of Influence Spreading Path in social networks and develop a set of new algorithms for the time constrained influence maximization problem. We further parallelize the algorithms for achieving more time savings. Additionally, we generalize the proposed algorithms for the conventional influence maximization problem without time constraints. All of the algorithms are evaluated over four public available datasets. The experimental results demonstrate the efficiency and effectiveness of the algorithms for both conventional influence maximization problem and its time constrained version. © 2013 IEEE.-
dc.languageeng-
dc.relation.ispartofIEEE Transactions on Knowledge and Data Engineering-
dc.subjectinfluence maximization-
dc.subjectInfluence spreading path-
dc.subjectlarge scale-
dc.subjectsocial network-
dc.subjecttime constrained-
dc.titleInfluence spreading path and its application to the time constrained social influence maximization problem and beyond-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/TKDE.2013.106-
dc.identifier.scopuseid_2-s2.0-84904673534-
dc.identifier.volume26-
dc.identifier.issue8-
dc.identifier.spage1904-
dc.identifier.epage1917-
dc.identifier.isiWOS:000341570800007-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats