• Research on influence maximization problem on heterogeneous multi-parties and multi-rounds problem.
• Proposed a new idea, considered the relationship between heterogeneous social networks and made use of the feature of social networks.
• Our method can work when influenced by another heterogeneous social network.
• Our current result shows that nodes include the risk influenced by another social network and will result in a worse or terrible outcome.
• Using Python and graphtool to implement a program which can handle the selection of seeds by greedy algo., max-degree, mindegree, central, or random, tie-breaking, multiple features on nodes and links, time limitation, propagating influence, tracking the propagation, and grouping.