• Login
    View Item 
    •   Home
    • Research
    • Conference Papers
    • View Item
    •   Home
    • Research
    • Conference Papers
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Tracking Influential Nodes in Time-Decaying Dynamic Interaction Networks

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Conference Paperfile1.pdf
    Size:
    1.077Mb
    Format:
    PDF
    Description:
    Pre-print
    Download
    Type
    Conference Paper
    Authors
    Zhao, Junzhou
    Shang, Shuo
    Wang, Pinghui
    Lui, John C.S.
    Zhang, Xiangliang cc
    KAUST Department
    Computer Science
    Computer Science Program
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Date
    2019-06-06
    Permanent link to this record
    http://hdl.handle.net/10754/655951
    
    Metadata
    Show full item record
    Abstract
    Identifying influential nodes that can jointly trigger the maximum influence spread in networks is a fundamental problem in many applications such as viral marketing, online advertising, and disease control. Most existing studies assume that social influence is static and they fail to capture the dynamics of influence in reality. In this work, we address the dynamic influence challenge by designing efficient streaming methods that can identify influential nodes from highly dynamic node interaction streams. We first propose a general time-decaying dynamic interaction network (TDN) model to model node interaction streams with the ability to smoothly discard outdated data. Based on the TDN model, we design three algorithms, i.e., SieveADN, BasicReduction, and HistApprox. SieveADN identifies influential nodes from a special kind of TDNs with efficiency. BasicReduction uses SieveADN as a basic building block to identify influential nodes from general TDNs. HistApprox significantly improves the efficiency of BasicReduction. More importantly, we theoretically show that all three algorithms enjoy constant factor approximation guarantees. Experiments conducted on various real interaction datasets demonstrate that our approach finds near-optimal solutions with speed at least 5 to 15 times faster than baseline methods.
    Citation
    Zhao, J., Shang, S., Wang, P., Lui, J. C. S., & Zhang, X. (2019). Tracking Influential Nodes in Time-Decaying Dynamic Interaction Networks. 2019 IEEE 35th International Conference on Data Engineering (ICDE). doi:10.1109/icde.2019.00102
    Sponsors
    We would like to thank the anonymous reviewers for their valuable comments and suggestions to help us improve this paper. This work is financially supported by the King Abdullah University of Science and Technology (KAUST) Sensor Initiative, Saudi Arabia. The work of John C.S. Lui was supported in part by the GRF Funding 14208816.
    Publisher
    Institute of Electrical and Electronics Engineers (IEEE)
    Conference/Event name
    2019 IEEE 35th International Conference on Data Engineering (ICDE)
    DOI
    10.1109/ICDE.2019.00102
    arXiv
    1810.07917
    Additional Links
    https://ieeexplore.ieee.org/document/8731541/
    https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8731541
    http://arxiv.org/pdf/1810.07917
    ae974a485f413a2113503eed53cd6c53
    10.1109/ICDE.2019.00102
    Scopus Count
    Collections
    Conference Papers; Computer Science Program; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2023  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.