Conference paper Open Access

Community based influence maximization in the Independent Cascade Model

László Hajdu; Miklós Krész; András Bóta


DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="URL">https://zenodo.org/record/1443254</identifier>
  <creators>
    <creator>
      <creatorName>László Hajdu</creatorName>
      <nameIdentifier nameIdentifierScheme="ORCID" schemeURI="http://orcid.org/">0000-0002-1832-6944</nameIdentifier>
      <affiliation>University of Szeged Institute of Informatics</affiliation>
    </creator>
    <creator>
      <creatorName>Miklós Krész</creatorName>
      <affiliation>Innorenew CoE, University of Primorska Andrej Marušic Institute, University of Szeged Gyula Juhász Faculty of Education,</affiliation>
    </creator>
    <creator>
      <creatorName>András Bóta</creatorName>
      <affiliation>University of Szeged Gyula Juhász Faculty of Education</affiliation>
    </creator>
  </creators>
  <titles>
    <title>Community based influence maximization in the Independent Cascade Model</title>
  </titles>
  <publisher>Zenodo</publisher>
  <publicationYear>2018</publicationYear>
  <subjects>
    <subject>Community detection</subject>
    <subject>Infection maximization</subject>
    <subject>Independent Cascade Model</subject>
  </subjects>
  <dates>
    <date dateType="Issued">2018-09-26</date>
  </dates>
  <language>en</language>
  <resourceType resourceTypeGeneral="Text">Conference paper</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/1443254</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.15439/2018F201</relatedIdentifier>
    <relatedIdentifier relatedIdentifierType="URL" relationType="IsPartOf">https://zenodo.org/communities/innorenew</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="http://creativecommons.org/licenses/by/4.0/legalcode">Creative Commons Attribution 4.0 International</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">&lt;p&gt;Community detection is a widely discussed topic in network science which allows us to discover detailed information about the connections between members of a given group. Communities play a critical role in the spreading of viruses or the diffusion of information. In [1], [8] Kempe et al. proposed the Independent Cascade Model, defining a simple set of rules that describe how information spreads in an arbitrary network. In the same paper the influence maximization problem is defined. In this problem we are looking for the initial vertex set which maximizes the expected number of the infected vertices. The main objective of this paper is to further improve the efficiency of influence maximization by incorporating information on the community structure of the network into the optimization process. We present different community-based improvements for the infection maximization problem, and compare the results by running the greedy maximization method.&lt;/p&gt;</description>
  </descriptions>
  <fundingReferences>
    <fundingReference>
      <funderName>European Commission</funderName>
      <funderIdentifier funderIdentifierType="Crossref Funder ID">10.13039/501100000780</funderIdentifier>
      <awardNumber awardURI="info:eu-repo/grantAgreement/EC/H2020/739574/">739574</awardNumber>
      <awardTitle>Renewable materials and healthy environments research and innovation centre of excellence</awardTitle>
    </fundingReference>
  </fundingReferences>
</resource>
217
202
views
downloads
Views 217
Downloads 202
Data volume 67.7 MB
Unique views 173
Unique downloads 186

Share

Cite as