{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T06:21:06Z","timestamp":1774765266749,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,11,29]],"date-time":"2013-11-29T00:00:00Z","timestamp":1385683200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10878-013-9684-y","type":"journal-article","created":{"date-parts":[[2013,11,27]],"date-time":"2013-11-27T22:57:24Z","timestamp":1385593044000},"page":"561-576","source":"Crossref","is-referenced-by-count":24,"title":["Neighborhood-based uncertainty generation in social networks"],"prefix":"10.1007","volume":"28","author":[{"given":"Meng","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingyuan","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinbao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shouling","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingshu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,29]]},"reference":[{"issue":"5","key":"9684_CR1","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1109\/TKDE.2008.190","volume":"21","author":"CC Aggarwal","year":"2009","unstructured":"Aggarwal CC, Yu PS (2009) A survey of uncertain data algorithms and applications. IEEE Trans Knowl Data Eng 21(5):609\u2013623","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"9684_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013656","DOI":"10.1109\/ICDE.2010.5447895"},{"key":"9684_CR3","unstructured":"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\u201390"},{"key":"9684_CR4","doi-asserted-by":"crossref","unstructured":"Cai Z, Lin G, Xue G (2005) Improved approximation algorithms for the capacitated multicast routing problem. In: COCOON, pp. 136\u2013145","DOI":"10.1007\/11533719_16"},{"key":"9684_CR5","unstructured":"Cheng S, Li J, Cai Z (2013) $$O(\\epsilon )$$ O ( \u03f5 ) -Approximation to physical world by sensor networks. In: INFOCOM, pp. 3084\u20133092"},{"issue":"4","key":"9684_CR6","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H Chernoff","year":"1952","unstructured":"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\u2013507","journal-title":"Ann Math Stat"},{"issue":"1","key":"9684_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10618-008-0106-1","volume":"17","author":"P Hintsanen","year":"2008","unstructured":"Hintsanen P, Toivonen H (2008) Finding reliable subgraphs from large probabilistic graphs. Data Min Knowl Discov 17(1):3\u201323","journal-title":"Data Min Knowl Discov"},{"issue":"301","key":"9684_CR8","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding W (1963) Probability inequalities for sums of bounded random variables. J Am Stat Assoc 58(301):13\u201330","journal-title":"J Am Stat Assoc"},{"key":"9684_CR9","unstructured":"http:\/\/snap.stanford.edu\/data\/ . Accessed July 2009"},{"key":"9684_CR10","unstructured":"http:\/\/string-db.org\/ . Accessed Sept 2003"},{"key":"9684_CR11","unstructured":"http:\/\/www.boost.org . Accessed Dec 1999"},{"issue":"9","key":"9684_CR12","doi-asserted-by":"crossref","first-page":"551","DOI":"10.14778\/2002938.2002941","volume":"4","author":"R Jin","year":"2011","unstructured":"Jin R, Liu L, Ding B, Wang H (2011) Distance-constraint reachability computation in uncertain graphs. Proc VLDB Endow 4(9):551\u2013562","journal-title":"Proc VLDB Endow"},{"key":"9684_CR13","doi-asserted-by":"crossref","unstructured":"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\u20131000","DOI":"10.1145\/2020408.2020569"},{"key":"9684_CR14","first-page":"56","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti A, Fortunato S (2009) Community detection algorithms: a comparative analysis. Phys Rev E 80:56\u2013117","journal-title":"Phys Rev E"},{"issue":"6","key":"9684_CR15","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1007\/s00778-012-0268-8","volume":"21","author":"J Li","year":"2012","unstructured":"Li J, Zou Z, Gao H (2012) Mining frequent subgraphs over uncertain graph databases under probabilistic semantics. VLDB J 21(6):753\u2013777","journal-title":"VLDB J"},{"issue":"1\u20132","key":"9684_CR16","doi-asserted-by":"crossref","first-page":"997","DOI":"10.14778\/1920841.1920967","volume":"3","author":"M Potamias","year":"2010","unstructured":"Potamias M, Bonchi F, Gionis A, Kollios G (2010) K-nearest neighbors in uncertain graphs. Proc VLDB Endow 3(1\u20132):997\u20131008","journal-title":"Proc VLDB Endow"},{"key":"9684_CR17","volume-title":"Introduction to probability models","author":"SM Ross","year":"2009","unstructured":"Ross SM (2009) Introduction to probability models. Academic press, Orlando"},{"issue":"4","key":"9684_CR18","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V Strassen","year":"1969","unstructured":"Strassen V (1969) Gaussian elimination is not optimal. Numer Math 13(4):354\u2013356","journal-title":"Numer Math"},{"key":"9684_CR19","doi-asserted-by":"crossref","first-page":"3080","DOI":"10.1016\/j.proeng.2012.01.444","volume":"29","author":"K Xu","year":"2012","unstructured":"Xu K, Zhang X (2012) Mining community in mobile social network. Procedia Eng 29:3080\u20133084","journal-title":"Procedia Eng"},{"key":"9684_CR20","doi-asserted-by":"crossref","unstructured":"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\u2013833","DOI":"10.1145\/1281192.1281280"},{"key":"9684_CR21","doi-asserted-by":"crossref","unstructured":"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\u201370","DOI":"10.1007\/978-3-642-12026-8_14"},{"issue":"9","key":"9684_CR22","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/TKDE.2010.80","volume":"22","author":"Z Zou","year":"2010","unstructured":"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\u20131218","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"9684_CR23","doi-asserted-by":"crossref","unstructured":"Zou Z, Li J, Gao H, Zhang Sh (2009) Frequent subgraph pattern mining on uncertain graph data. In: CIKM, pp. 583\u2013592","DOI":"10.1145\/1645953.1646028"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9684-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9684-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9684-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T01:41:46Z","timestamp":1564882906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9684-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,29]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["9684"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9684-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,29]]}}}