Open Access System for Information Sharing

Login Library

 

Article
Cited 30 time in webofscience Cited 39 time in scopus
Metadata Downloads
Full metadata record
Files in This Item:
There are no files associated with this item.
DC FieldValueLanguage
dc.contributor.authorKim, J-
dc.contributor.authorLee, W-
dc.contributor.authorYu, H-
dc.date.accessioned2016-03-31T07:30:20Z-
dc.date.available2016-03-31T07:30:20Z-
dc.date.created2015-02-24-
dc.date.issued2014-05-
dc.identifier.issn0950-7051-
dc.identifier.other2014-OAK-0000032037-
dc.identifier.urihttps://oasis.postech.ac.kr/handle/2014.oak/13705-
dc.description.abstractInfluence maximization problem has gained much attention, which is to find the most influential people. Efficient algorithms have been proposed to solve influence maximization problem according to the proposed diffusion models. Existing diffusion models assume that a node influences its neighbors once, and there is no time constraint in activation process. However, in real-world marketing situations, people influence his/her acquaintances repeatedly, and there are often time restrictions for a marketing. This paper proposes a new realistic influence diffusion model Continuously activated and Time-restricted IC (CT-IC) model which generalizes the IC model. In CT-IC model, every active node activate its neighbors repeatedly, and activation continues until a given time. We first prove CT-IC model satisfies monotonicity and submodularity for influence spread. We then provide an efficient method for calculating exact influence spread for a directed tree. Finally, we propose a scalable influence evaluation algorithm under CT-IC model CT-IPA. Our experiments show CT-IC model finds seeds of higher influence spread than IC model, and CT-IPA is four orders of magnitude faster than the greedy algorithm while providing similar influence spread. (C) 2014 Elsevier B.V. All rights reserved.-
dc.description.statementofresponsibilityX-
dc.languageEnglish-
dc.publisherElsevier B.V.-
dc.relation.isPartOfKnowledge-Based Systems-
dc.subjectInfluence maximization-
dc.subjectViral marketing-
dc.subjectSocial networks-
dc.subjectInfluence diffusion model-
dc.subjectGraph mining-
dc.subjectDYNAMIC BAYESIAN NETWORKS-
dc.subjectSOCIAL NETWORKS-
dc.subjectINFORMATION DIFFUSION-
dc.titleCT-IC: Continuously activated and Time-restricted Independent Cascade model for viral marketing-
dc.typeArticle-
dc.contributor.college컴퓨터공학과-
dc.identifier.doi10.1016/J.KNOSYS.2014.02.013-
dc.author.googleKim, J-
dc.author.googleLee, W-
dc.author.googleYu, H-
dc.relation.volume62-
dc.relation.startpage57-
dc.relation.lastpage68-
dc.contributor.id10162777-
dc.relation.journalKnowledge-Based Systems-
dc.relation.indexSCI급, SCOPUS 등재논문-
dc.relation.sciSCI-
dc.collections.nameJournal Papers-
dc.type.rimsART-
dc.identifier.bibliographicCitationKnowledge-Based Systems, v.62, pp.57 - 68-
dc.identifier.wosid000336116900006-
dc.date.tcdate2019-01-01-
dc.citation.endPage68-
dc.citation.startPage57-
dc.citation.titleKnowledge-Based Systems-
dc.citation.volume62-
dc.contributor.affiliatedAuthorYu, H-
dc.identifier.scopusid2-s2.0-84899059193-
dc.description.journalClass1-
dc.description.journalClass1-
dc.description.wostc9-
dc.description.scptc10*
dc.date.scptcdate2018-05-121*
dc.type.docTypeArticle-
dc.subject.keywordAuthorInfluence maximization-
dc.subject.keywordAuthorViral marketing-
dc.subject.keywordAuthorSocial networks-
dc.subject.keywordAuthorInfluence diffusion model-
dc.subject.keywordAuthorGraph mining-
dc.relation.journalWebOfScienceCategoryComputer Science, Artificial Intelligence-
dc.description.journalRegisteredClassscie-
dc.description.journalRegisteredClassscopus-
dc.relation.journalResearchAreaComputer Science-

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher

유환조YU, HWANJO
Dept of Computer Science & Enginrg
Read more

Views & Downloads

Browse