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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aggarwal CC, Yu PS (2009) A survey of uncertain data algorithms and applications. IEEE Trans Knowl Data Eng 21(5):609–623
Bortner D, Han J (2010) Progressive clustering of networks using structure-connected order of traversal. In: IEEE the international conference on data engineering ICDE, pp. 653–656
Burton S, Morris R, Dimond M, Hansen J, Giraud-Carrier C, West J, Hanson C, Barnes M (2010) Public health community mining in YouTube. In: Proceedings of the 2nd ACM SIGHIT symposium on international health informatics, pp. 81–90
Cai Z, Lin G, Xue G (2005) Improved approximation algorithms for the capacitated multicast routing problem. In: COCOON, pp. 136–145
Cheng S, Li J, Cai Z (2013) \(O(\epsilon )\)-Approximation to physical world by sensor networks. In: INFOCOM, pp. 3084–3092
Chernoff H (1952) A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann Math Stat 23(4):493–507
Hintsanen P, Toivonen H (2008) Finding reliable subgraphs from large probabilistic graphs. Data Min Knowl Discov 17(1):3–23
Hoeffding W (1963) Probability inequalities for sums of bounded random variables. J Am Stat Assoc 58(301):13–30
http://snap.stanford.edu/data/. Accessed July 2009
http://string-db.org/. Accessed Sept 2003
http://www.boost.org. Accessed Dec 1999
Jin R, Liu L, Ding B, Wang H (2011) Distance-constraint reachability computation in uncertain graphs. Proc VLDB Endow 4(9):551–562
Jin R, Liu L, Aggarwal CC (2011) Discovering highly reliable subgraphs in uncertain graphs. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining, pp. 992–1000
Lancichinetti A, Fortunato S (2009) Community detection algorithms: a comparative analysis. Phys Rev E 80:56–117
Li J, Zou Z, Gao H (2012) Mining frequent subgraphs over uncertain graph databases under probabilistic semantics. VLDB J 21(6):753–777
Potamias M, Bonchi F, Gionis A, Kollios G (2010) K-nearest neighbors in uncertain graphs. Proc VLDB Endow 3(1–2):997–1008
Ross SM (2009) Introduction to probability models. Academic press, Orlando
Strassen V (1969) Gaussian elimination is not optimal. Numer Math 13(4):354–356
Xu K, Zhang X (2012) Mining community in mobile social network. Procedia Eng 29:3080–3084
Xu X, Yuruk N, Feng Z, Schweiger TAJ (2007) Scan: a structural clustering algorithm for networks. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 824–833
Yuan Y, Chen L, Wang G (2010) Efficiently answering probability threshold-based shortest path queries over uncertain graphs. In: Proceedings of DASFAA, Berlin, Springer, pp. 155–70
Zou Z, Li J, Gao H, Zhang S (2010) Mining frequent subgraph patterns from uncertain graph data. IEEE Trans Knowl Data Eng 22(9):1203–1218
Zou Z, Li J, Gao H, Zhang Sh (2009) Frequent subgraph pattern mining on uncertain graph data. In: CIKM, pp. 583–592
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Han, M., Yan, M., Li, J. et al. Neighborhood-based uncertainty generation in social networks. J Comb Optim 28, 561–576 (2014). https://doi.org/10.1007/s10878-013-9684-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-013-9684-y