登录 | 注册 | 充值 | 退出 | 公司首页 | 繁体中文 | 满意度调查
综合馆
面向不确定图的k最近邻查询
  • 摘要

    生物网络、社会网络、交际网络等复杂的网络被广泛的研究,由于数据抽出时引入的噪声和错误使这些数据具有不确定性,因此可以对这些应用使用不确定图模型建模,k最近邻查询问题是查询一个图上的距离某个特定点最近的k个邻居节点的问题,它是不确定图上的一个基础问题.设计了一个解决不确定图上最近邻问题的框架,首先定义了一种新颖的不确定图上的k最近邻查询,然后提出了针对该查询的一般处理算法,同时对该算法进行了优化,使算法效率得到极大提高.理论分析和实验结果表明提出的算法能够高效地处理不确定图上的k最近邻查询.

  • 作者

    张旭  何向南  金澈清  周傲英  Zhang Xu  He Xiangnan  Jin Cheqing  Zhou Aoying 

  • 作者单位

    华东师范大学软件学院上海市高可信计算重点实验室 上海200062

  • 刊期

    2011年10期 ISTIC EI PKU

  • 关键词

    生物网络  社会网络  不确定图  k最近邻查询  可能世界 

参考文献
  • [1] 张硕,高宏,李建中,邹兆年. 不确定图数据库中高效查询处理. 计算机学报, 2009,10
  • [2] Hintsanen P;Toivonen H. Finding reliable subgraphs from large probabilistic graphs. Data mining and knowledge discovery, 2008,1
  • [3] Singh S;Mayfield C;Mittal S. Orion 2.0:Native support for uncertain data. New York:ACM, 2008
  • [4] Agrawal P;Benjelloun O;Sarma A D. Trio:A system for data uncertainty and lineage. New York:ACM, 2006
  • [5] Cheng R;Chen J;Mokbel M. Probabilistic verifiers:Evaluating constrained nearest-neighbor queries over uncertain data. Piscataway,NJ:IEEE, 2008
  • [6] Cheng R;Kalashnikov D V;Prabhakar S. Querying imprecise data in moving object environments. IEEE TKDE, 2004,09
  • [7] Kriegel H P;Kunath P;Renz M. Probabilistic nearestneighbor query on uncertain objects. Beilin:Springer-Verlag, 2007
  • [8] Sen P;Deshpande A;Getoor L. PrDB:Managing and exploiting rich correlations in probabilistic databases. VLDB Journal:Very Large Data Bases, 2009,05
  • [9] Asthana S;King O D;Gibbons F D. Predicting protein complex membership using probabilistic network reliability. Genome Research, 2004,06
  • [10] Zou Z;Li J;Gao H. Mining frequent subgraph patterns from uncertain graphdata. IEEE Transactions on Knowledge and Data Engineering, 2010,09
  • [11] Zhang W;Lin X;Cheema M A. Quantile-based kNN over multi-valued objects. Piscataway,NJ:IEEE, 2010
  • [12] Zhang Y;Lin X;Zhu G. Efficient rank based kNN query processing over uncertain data. Piscataway,NJ:IEEE, 2010
  • [13] Zou Z;Li J;Gao H. Finding top-k maximal cliques in an uncertain graph. Piscataway,NJ:IEEE, 2010
  • [14] Zou Z;Li J;Gao H. Discovering probabilistic frequent subgraphs over uncertain graph databases. New York:ACM, 2010
  • [15] Dalvi N;Suciu D. Management of probabilistic data Foundations and challenges. New York:ACM, 2007
  • [16] Khoussainova N;Balazinska M. Towards correcting input data errors probabilistically using integrity constraints. New York:ACM, 2006
  • [17] Cohen W. Enron email data. http://snap.stanford.edu/data/email-Enron.html, 2011-06-01
  • [18] Wang D Z;Michelakis E;Garofalakis M. Bayesstore:Managing large uncertain data repositories with probabilistic graphical models. Proceedings of the VLDB Endowment, 2008,01
  • [19] Antova L;Jansen T;Koch C. Fast and simple relational processing of uncertain data. Piscataway,NJ:IEEE, 2008
  • [20] Potamias M;Bonchi F;Gionis A. k-Nearest neighbors in uncertain graphs. Proceedings of the VLDB Endowment, 2010,01
  • [21] Hintanen P. The most reliable subgraph problem. Beilin:Springer-Verlag, 2007
  • [22] Bekales G;Soliman M A;Ilyas I F. Efficient search for the top-k probable nearest neighbors in uncertain databases. Proceedings of the VLDB Endowment, 2008,01
  • [23] Jampani R;Xu F;Wu M. Mcdb:A monte carlo approach to managing uncertain data. New York:ACM, 2008
  • [24] Dalvi N;Suciu D. Efficient query evaluation on probabilistic databases. San Francisco:Morgan Kaufmann Publishers, 2004
查看更多︾
相似文献 查看更多>>
3.226.243.10