Change Password

Input error
Input error
Input error
Submit

Change Nickname

Current Nickname:
Submit
Search
v4.0
    v4.0

    CELF

    Overview

    CELF (Cost Effective Lazy Forward) algorithm selects some seed nodes in a network as the propagation source to reach the effect of Influence Maximimzation (IM). CELF algorithm was proposed by Jure Leskovec et al. in 2007, it improves the traditional greedy algorithm based on the IC model by taking advantage of the submodality. It only calculates the influence score of all nodes only at the initial stage and does not recalculate for all nodes afterwards, hence cost-effective. A typical application scenario of the algorithm is to prevent epidemic outbreaks by selecting a small group of people to monitor, so that any disease can be detected early in the outbreak.

    Related materials of the algorithm:

    Command and Configuration

    • Command: algo(celf)
    • Configurations for the parameter params():
    Name
    Type
    Default
    Specification
    Description
    seedSetSize int 1 >=1 The number of seed nodes
    monteCarloSimulations int 1000 >=1 The number of Monte-Carlo simulations
    propagationProbability float 0.1 (0,1) The probability of a node being activated

    Algorithm Execution

    Task Writeback

    1. File Writeback

    Configuration
    Data in Each Row
    filename _id,spread

    2.Property Writeback

    Not supported by this algorithm.

    3. Statistics Writeback

    This algorithm has no statistics.

    Direct Return

    Alias Ordinal Type
    Description
    Column Name
    0 []perNode Node and its marginal return _uuid, spread

    Streaming Return

    Alias Ordinal Type
    Description
    Column Name
    0 []perNode Node and its marginal return _uuid, spread

    Real-time Statistics

    This algorithm has no statistics.

    Please complete the following information to download this book
    *
    公司名称不能为空
    *
    公司邮箱必须填写
    *
    你的名字必须填写
    *
    你的电话必须填写
    *
    你的电话必须填写