IDEAS home Printed from https://ideas.repec.org/a/wsi/acsxxx/v27y2024i01n02ns0219525924500048.html
   My bibliography  Save this article

IMine: A CUSTOMIZABLE FRAMEWORK FOR INFLUENCE MINING IN COMPLEX NETWORKS

Author

Listed:
  • OWAIS A. HUSSAIN

    (College of Computing and Information Sciences, Karachi Institute of Economics and Technology, Karachi, Pakistan)

  • FARAZ A. ZAIDI

    (York University, Keele Campus, Toronto, Canada)

Abstract

The idea of discovering a few nodes with potential to impact an entire network, is known as Influence Maximization (IM) and has many real-world applications which make it one of well-studied research problems in the domain of network analysis. IM typically requires a fixed criteria of budget (number of influential nodes to be identified) as input. The fundamental premise of this research is that the budget is not the sole criteria for real-world applications. This study challenges the conventional method to identify influential nodes, and proves that it requires specification of the stoppage criteria and the model used to quantify influence. We analyze the complex interplay of various criteria that can be used to solve IM problem, and prove that changing the criterion also changes the algorithm determined as the top performer. A number of criteria are presented in this paper apart from budget, such as the spread achieved by the algorithm (in terms of number of nodes influenced) and absolute time. The proposed IMine framework provides an interface to apply influence problem on various stoppage criteria, while also providing customization option to change the model of quantifying influence spread.

Suggested Citation

  • Owais A. Hussain & Faraz A. Zaidi, 2024. "IMine: A CUSTOMIZABLE FRAMEWORK FOR INFLUENCE MINING IN COMPLEX NETWORKS," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 27(01n02), pages 1-33, March.
    • Handle: RePEc:wsi:acsxxx:v:27:y:2024:i:01n02:n:s0219525924500048
    DOI: 10.1142/S0219525924500048
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0219525924500048
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0219525924500048?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:acsxxx:v:27:y:2024:i:01n02:n:s0219525924500048. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/acs/acs.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.