IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v28y2014i3d10.1007_s10878-013-9684-y.html
   My bibliography  Save this article

Neighborhood-based uncertainty generation in social networks

Author

Listed:
  • Meng Han

    (Georgia State University)

  • Mingyuan Yan

    (Georgia State University)

  • Jinbao Li

    (Heilongjiang University)

  • Shouling Ji

    (Georgia Institute of Technology)

  • Yingshu Li

    (Georgia State University
    Heilongjiang University)

Abstract

Imprecision, incompleteness and dynamic exist in a wide range of network applications. It is difficult to decide the uncertainty relationship among nodes since traditional models are not meaningful in uncertain networks, and the inherent computational complexity of the problems with uncertainty is always intractable. In this paper, we study how to capture uncertainty in networks by transforming a series of snapshots of a network to an uncertain graph. A novel sampling scheme is also proposed which enables the development of efficient algorithms to measure uncertainty in networks. Considering the practical aspects of neighborhood relationship in real networks, a framework is introduced to transform an uncertain network into a deterministic weighted network where the weights on edges can be measured by Jaccard-like index. The comprehensive experimental evaluation results on real data demonstrate the effectiveness and efficiency of our algorithms.

Suggested Citation

  • Meng Han & Mingyuan Yan & Jinbao Li & Shouling Ji & Yingshu Li, 2014. "Neighborhood-based uncertainty generation in social networks," Journal of Combinatorial Optimization, Springer, vol. 28(3), pages 561-576, October.
    • Handle: RePEc:spr:jcomop:v:28:y:2014:i:3:d:10.1007_s10878-013-9684-y
    DOI: 10.1007/s10878-013-9684-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-013-9684-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-013-9684-y?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:spr:jcomop:v:28:y:2014:i:3:d:10.1007_s10878-013-9684-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.