淡江大學機構典藏:Item 987654321/98125
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62822/95882 (66%)
Visitors : 4015549      Online Users : 538
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
    •  Adv. Search
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/98125


    Title: CIM: Community-Based Influence Maximization in Social Networks
    Authors: Chen, Yi-Cheng;Peng, Wen-Chih;Lee, Wan-Chien;Lee, Suh-Yin
    Contributors: 淡江大學資訊工程學系
    Keywords: Community detection;diffusion models;influence maximization;social network analysis
    Date: 2014-04-01
    Issue Date: 2014-05-27 09:15:46 (UTC+8)
    Publisher: A C M Special Interest Group
    Abstract: Given a social graph, the problem of influence maximization is to determine a set of nodes that maximizes the spread of influences. While some recent research has studied the problem of influence maximization, these works are generally too time consuming for practical use in a large-scale social network. In this article, we develop a new framework, community-based influence maximization (CIM), to tackle the influence maximization problem with an emphasis on the time efficiency issue. Our proposed framework, CIM, comprises three phases: (i) community detection, (ii) candidate generation, and (iii) seed selection. Specifically, phase (i) discovers the community structure of the network; phase (ii) uses the information of communities to narrow down the possible seed candidates; and phase (iii) finalizes the seed nodes from the candidate set. By exploiting the properties of the community structures, we are able to avoid overlapped information and thus efficiently select the number of seeds to maximize information spreads. The experimental results on both synthetic and real datasets show that the proposed CIM algorithm significantly outperforms the state-of-the-art algorithms in terms of efficiency and scalability, with almost no compromise of effectiveness.
    Relation: ACM Transactions on Intelligent Systems and Technology 5(2), Article 25, pp.1-31
    DOI: 10.1145/2532549
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

    Files in This Item:

    File Description SizeFormat
    2014_cim_community-based influence maximization in social networks.pdf.pdf9975KbAdobe PDF448View/Open
    index.html0KbHTML242View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback