{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:19:01Z","timestamp":1759033141420,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,6,24]],"date-time":"2016-06-24T00:00:00Z","timestamp":1466726400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61173023","61532015"],"award-info":[{"award-number":["61173023","61532015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"973 Program of China","award":["2011CB036202"],"award-info":[{"award-number":["2011CB036202"]}]},{"name":"HIT-Tencent Open Research Fund"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s10115-016-0961-9","type":"journal-article","created":{"date-parts":[[2016,6,24]],"date-time":"2016-06-24T12:26:08Z","timestamp":1466771168000},"page":"723-750","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Towards efficient top-k reliability search on uncertain graphs"],"prefix":"10.1007","volume":"50","author":[{"given":"Rong","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaonian","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,24]]},"reference":[{"issue":"2","key":"961_CR1","first-page":"15","volume":"30","author":"E Adar","year":"2007","unstructured":"Adar E, R\u00e9 C (2007) Managing uncertainty in social networks. IEEE Data Eng Bull 30(2):15\u201322","journal-title":"IEEE Data Eng Bull"},{"key":"961_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-6045-0","volume-title":"Managing and mining uncertain data","author":"CC Aggarwal","year":"2010","unstructured":"Aggarwal CC (2010) Managing and mining uncertain data, vol 35. Springer, Berlin"},{"issue":"1","key":"961_CR3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0026-2714(75)90461-8","volume":"14","author":"K Aggarwal","year":"1975","unstructured":"Aggarwal K, Misra K, Gupta J (1975) Reliability evaluation a comparative study of different techniques. Microelectron Reliab 14(1):49\u201356","journal-title":"Microelectron Reliab"},{"key":"961_CR4","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/TR.1981.5220952","volume":"1","author":"K Aggarwal","year":"1981","unstructured":"Aggarwal K, Rai S (1981) Reliability evaluation in computer-communication networks. IEEE Trans Reliab 1:32\u201335","journal-title":"IEEE Trans Reliab"},{"issue":"6","key":"961_CR5","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1101\/gr.2203804","volume":"14","author":"S Asthana","year":"2004","unstructured":"Asthana S, King OD, Gibbons FD, Roth FP (2004) Predicting protein complex membership using probabilistic network reliability. Genome Res 14(6):1170\u20131175","journal-title":"Genome Res"},{"key":"961_CR6","unstructured":"Bader DA, Madduri K (2006) Gtgraph: a synthetic graph generator suite. http:\/\/www.cse.psu.edu\/~kxm85\/software\/GTgraph\/gen"},{"key":"961_CR7","doi-asserted-by":"crossref","unstructured":"Condie T, Conway N, Alvaro P, Hellerstein JM , Gerth J, Talbot J, Elmeleegy K, Sears R (2010) Online aggregation and continuous query support in mapreduce. In: Proceedings of the ACM SIGMOD international conference on management of data (SIGMOD\u201910), pp 1115\u20131118","DOI":"10.1145\/1807167.1807295"},{"key":"961_CR8","doi-asserted-by":"crossref","unstructured":"Jin R, Liu L, Aggarwal C C (2011) Discovering highly reliable subgraphs in uncertain graphs. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201911), pp 992\u20131000","DOI":"10.1145\/2020408.2020569"},{"issue":"9","key":"961_CR9","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 (PVLDB) 4(9):551\u2013562","journal-title":"Proc VLDB Endow (PVLDB)"},{"key":"961_CR10","unstructured":"Khan A, Bonchi F, Gionis A, Gullo F (2014) Fast reliability search in uncertain graphs. In: Proceedings of the 17th international conference on extending database technology (EDBT\u201914), pp 535\u2013546"},{"key":"961_CR11","doi-asserted-by":"crossref","unstructured":"Li RH, Yu JX, Mao R, Jin T (2014) Efficient and accurate query evaluation on uncertain graphs via recursive stratified sampling. In: Proceedings of the IEEE 30th international conference on data engineering (ICDE\u201914), pp 892\u2013903","DOI":"10.1109\/ICDE.2014.6816709"},{"key":"961_CR12","doi-asserted-by":"crossref","unstructured":"Liu L, Jin R, Aggarwal C, Shen Y (2012) Reliable clustering on uncertain graphs.In: Proceedings of the IEEE 12th international conference on data mining (ICDM\u201912), pp 459\u2013468","DOI":"10.1109\/ICDM.2012.11"},{"issue":"1\u20132","key":"961_CR13","first-page":"997","volume":"3","author":"M Potamias","year":"2012","unstructured":"Potamias M, Bonchi F, Gionis A, Kollios G (2012) K-nearest neighbors in uncertain graphs. Proc VLDB Endow 3(1\u20132):997\u20131008","journal-title":"Proc VLDB Endow"},{"issue":"2","key":"961_CR14","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/S089548019223872X","volume":"8","author":"JP Schmidt","year":"1995","unstructured":"Schmidt JP, Siegel A, Srinivasan A (1995) Chernoff\u2013Hoeffding bounds for applications with limited independence. SIAM J Discrete Math 8(2):223\u2013250","journal-title":"SIAM J Discrete Math"},{"key":"961_CR15","doi-asserted-by":"crossref","unstructured":"Sevon P, Eronen L, Hintsanen P, Kulovesi K, Toivonen H (2006) Link discovery in graphs derived from biological databases. In: Leser U, Naumann F, Eckman B (eds) Data integration in the life sciences. Springer, Berlin","DOI":"10.1007\/11799511_5"},{"issue":"3","key":"961_CR16","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant LG (1979) The complexity of enumeration and reliability problems. SIAM J Comput 8(3):410\u2013421","journal-title":"SIAM J Comput"},{"issue":"2","key":"961_CR17","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1093\/ietisy\/e89-d.2.570","volume":"89","author":"G Wepiw\u00c9","year":"2006","unstructured":"Wepiw\u00c9 G, Simeonov PL (2006) Hipeer: a highly reliable P2P system. IEICE Trans Inf Syst 89(2):570\u2013580","journal-title":"IEICE Trans Inf Syst"},{"issue":"5","key":"961_CR18","doi-asserted-by":"crossref","first-page":"401","DOI":"10.14778\/2732269.2732276","volume":"7","author":"AW Yu","year":"2014","unstructured":"Yu AW, Mamoulis N, Su H (2014) Reverse top-k search using random walk with restart. Proc VLDB Endow (PVLDB) 7(5):401\u2013412","journal-title":"Proc VLDB Endow (PVLDB)"},{"key":"961_CR19","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 the 15th database systems for advanced applications (DASFAA\u201910), pp 155\u2013170","DOI":"10.1007\/978-3-642-12026-8_14"},{"issue":"11","key":"961_CR20","doi-asserted-by":"crossref","first-page":"876","DOI":"10.14778\/3402707.3402726","volume":"4","author":"Y Yuan","year":"2011","unstructured":"Yuan Y, Wang G, Wang H, Chen L (2011) Efficient subgraph search over large uncertain graphs. Proc VLDB Endow (PVLDB) 4(11):876\u2013886","journal-title":"Proc VLDB Endow (PVLDB)"},{"issue":"3","key":"961_CR21","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1109\/TCBB.2013.2297915","volume":"11","author":"B Zhao","year":"2014","unstructured":"Zhao B, Wang J, Li M, Wu F, Pan Y (2014) Detecting protein complexes based on uncertain graph model. IEEE\/ACM Trans Comput Biol Bioinf 11(3):486\u2013497","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"key":"961_CR22","doi-asserted-by":"crossref","unstructured":"Zhu R, Zou Z, Li J (2015) Top-k reliability search on uncertain graphs. In: Proceedings of the 15th IEEE international conference on data mining (ICDM\u201915), pp 659\u2013668","DOI":"10.1109\/ICDM.2015.64"},{"key":"961_CR23","doi-asserted-by":"crossref","unstructured":"Zou Z, Li J, Gao H, Zhang S (2009) Frequent subgraph pattern mining on uncertain graph data. In: Proceedings of the 18th ACM conference on information and knowledge management (CIKM\u201909), pp 583\u2013592","DOI":"10.1145\/1645953.1646028"},{"key":"961_CR24","doi-asserted-by":"crossref","unstructured":"Zou Z, Li J, Gao H, Zhang S (2010) Finding top-k maximal cliques in an uncertain graph. In: Proceedings of the 26th IEEE international conference on data engineering (ICDE\u201910), pp 649\u2013652","DOI":"10.1109\/ICDE.2010.5447891"},{"issue":"9","key":"961_CR25","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"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-0961-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-016-0961-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-0961-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-0961-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T21:34:01Z","timestamp":1600810441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-016-0961-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,24]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["961"],"URL":"https:\/\/doi.org\/10.1007\/s10115-016-0961-9","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2016,6,24]]}}}