[1]AGGARWAL C C.Managing and mining uncertain data[M].Berlin,Germany:Springer,2010.
[2]POTAMIAS M,BONCHI F,GIONIS A,et al.K-nearest neighbors in uncertain graphs[J].Proceedings of the VLDB Endowment,2010,3(1/2):997-1008.
[3]JIN R,LIU L,DING B,et al.Distance-constraint reachability computation in uncertain graphs[J].Proceedings of the VLDB Endowment,2011,4(9):551-562.
[4]YUAN Y,CHEN L,WANG G.Efficiently answering probability threshold-based shortest path queries over uncertain graphs[C]//Proceedings of International Conference on Database Systems for Advanced Applications.Berlin,Germany:Springer,155-170.
[5]CHUA H N,SUNG W K,WONG L.Exploiting indirect neighbours and topological weight to predict protein function from protein-protein interactions[J].Bioinformatics,2006,22(13):1623-1630.
[6]ASTHANA S,KING O D,GIBBONS F D,et al.Predicting protein complex membership using probabilistic network reliability[J].Genome Research,2004,14(6):1170-1175.
[7]GHOSH J,NGO H Q,YOON S,et al.On a routing problem within probabilistic graphs and its application to intermittently connected networks[C]//Proceedings of the 26th IEEE International Conference on Computer Communications.Washington D.C.,USA:IEEE Press,2007:1721-1729.
[8]ADAR E,RE C.Managing uncertainty in socialnet-works[J].IEEE Data Engineering Bulletin,2007,30(2):15-22.
[9]KEMPE D,KLEINBERG J,TARDOS E.Maximizing the spread of influence through a social network[C]//Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.New York,USA:ACM Press,2003:137-146.
[10]WENG J,LIM E P,JIANG J,et al.TwitterRank:finding topic-sensitive influential Twitterers[C]//Proceedings of the 3rd ACM International Conference on Web Search and Data Mining.New York,USA:ACM Press,2010:261-270.
[11]LESKOVEC J,KLEINBERG J,FALOUTSOS C.Graphs over time:densification laws,shrinking diameters and possible explanations[C]//Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery in Data Mining.New York,USA:ACM Press,2005:177-187.
[12]LESKOVEC J,FALOUTSOS C.Sampling from large graphs[C]//Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.New York,USA:ACM Press,2006:631-636.
[13]邹兆年,朱鎔.大规模不确定图上的Top-k极大团挖掘算法[J].计算机学报,2013,36(10):2146-2155.
[14]YUAN Y,WANG G,WANG H,et al.Efficient subgraph search over large uncertain graphs[J].Proceedings of the VLDB Endowment,2011,4(11):876-886.
[15]CHEN Y,ZHAO X,LIN X,et al.Towards frequent subgraph mining on single large uncertain graphs[C]//Proceedings of the 15th IEEE International Conference on Data Mining.Washington D.C.,USA:IEEE Press,2015:41-50.
[16]MOUSTAFA W E,KIMMIG A,DESHPANDE A,et al.Subgraph pattern matching over uncertain graphs with identity linkage uncertainty[C]//Proceedings of the 30th International Conference on Data Engineering.Washington D.C.,USA:IEEE Press,2014:904-915.
[17]JIN R,LIU L,AGGARWAL C C.Discovering highly reliable subgraphs in uncertain graphs[C]//Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.New York,USA:ACM Press,2011:992-1000.
[18]LIU L,JIN R,AGGARWAL C,et al.Reliable clustering on uncertain graphs[C]//Proceedings of the 12th International Conference on Data Mining.Washington D.C.,USA:IEEE Press,2012:459-468.
[19]袁野,王国仁.基于阈值的概率图可达查询[J].计算机学报,2010,33(12):2219-2228.
[20]张应龙,李翠平,陈红,等.不确定图上的kNN查询处理[J].计算机研究与发展,2011,48(10):1850-1858.
[21]YUAN Y,WANG G,CHEN L,et al.Efficient subgraph similarity search on large probabilistic graph databases[J].Proceedings of the VLDB Endowment,2012,5(9):800-811.
[22]FISHMAN G S.A comparison of four Montecarlo methods for estimating the probability of s-t connectedness[J].IEEE Transactions on Reliability,1986,35(2):145-155.
[23]LI R H,YU J X,MAO R,et al.Efficient and accurate query evaluation on uncertain graphs via recursive stratified sampling[C]//Proceedings of the 30th International Conference on Data Engineering.Washington D.C.,USA:IEEE Press,2014:892-903.
[24]PARCHAS P,GULLO F,PAPADIAS D,et al.The pursuit of a good possible world:extracting representative instances of uncertain graphs[C]//Proceedings of 2014 ACM SIGMOD International Conference on Management of Data.New York,USA:ACM Press,2014:967-978.
[25]张柏礼,吕建华,生衍,等.一种不确定图中最可靠最大流问题的解决方案[J].计算机学报,2014,37(10):2084-2095.
[26]QIN Y,SHENG Q Z,PARKINSON S,et al.Edge influence computation in dynamic graphs[C]//Proceedings of International Conference on Database Systems for Advanced Applications.Berlin,Germany:Springer,2017:649-660.
[27]AKIBA T,IWATA Y,YOSHIDA Y.Fast exact shortest-path distance queries on large networks by pruned landmark labeling[C]//Proceedings of 2013 ACM SIGMOD International Conference on Management of Data.New York,USA:ACM Press,2013:349-360.
|