메뉴 건너뛰기




Volumn 7, Issue 3, 2013, Pages 205-216

Probabilistic nearest neighbor queries on uncertain moving object trajectories

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN NETWORKS; DATABASE SYSTEMS; INFERENCE ENGINES; MARKOV CHAINS; NEAREST NEIGHBOR SEARCH; QUERY PROCESSING; SEMANTICS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

EID: 84887522064     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2732232.2732239     Document Type: Conference Paper
Times cited : (46)

References (32)
  • 1
    • 57049160857 scopus 로고    scopus 로고
    • Event queries on correlated probabilistic streams
    • C. Ré, J. Letchner, M. Balazinksa, and D. Suciu, "Event queries on correlated probabilistic streams," in Proc. SIGMOD, 2008, 715-728.
    • (2008) Proc. SIGMOD , pp. 715-728
    • Ré, C.1    Letchner, J.2    Balazinksa, M.3    Suciu, D.4
  • 2
    • 85039651919 scopus 로고    scopus 로고
    • Friendship and mobility: User movement location-based social networks
    • E. Cho, S. A. Myers, and J. Leskovec., "Friendship and mobility: User movement in location-based social networks," in Proc. KDD, 2001.
    • (2001) Proc. KDD
    • Cho, E.1    Myers, S.A.2    Leskovec, J.3
  • 4
    • 59249083364 scopus 로고    scopus 로고
    • Understanding mobility based on gps dat
    • Y. Zheng, Q. Li, Y. Chen, X. Xie, and W. Ma., "Understanding mobility based on gps data." in Proc. Ubicomp, 2008, 312-312.
    • (2008) Proc. Ubicomp , pp. 312-1312
    • Zheng, Y.1    Li, Q.2    Chen, Y.3    Xie, X.4    Ma, W.5
  • 5
    • 34248580800 scopus 로고    scopus 로고
    • Algorithms for nearest neighbor search on moving object trajectories
    • E. Frentzos, K. Gratsias, N. Pelekis, and Y. Theodoridis, "Algorithms for nearest neighbor search on moving object trajectories," Geoinformatica, vol. 11, no. 2, 159-193, 2007.
    • (2007) Geoinformatica , vol.11 , Issue.2 , pp. 159-193
    • Frentzos, E.1    Gratsias, K.2    Pelekis, N.3    Theodoridis, Y.4
  • 6
    • 77957315034 scopus 로고    scopus 로고
    • Efficient k-nearest neighbor search on moving object trajectories
    • R. H. Güting, T. Behr, and J. Xu, "Efficient k-nearest neighbor search on moving object trajectories," VLDB J., vol. 19, no. 5, 687-714, 2010.
    • (2010) VLDB J , vol.19 , Issue.5 , pp. 687-714
    • Güting, R.H.1    Behr, T.2    Xu, J.3
  • 7
    • 85012111044 scopus 로고    scopus 로고
    • Continuous k-nearest neighbor queries for continuously moving points with updates
    • G. S. Iwerks, H. Samet, and K. Smith, "Continuous k-nearest neighbor queries for continuously moving points with updates," in VLDB, 2003, 512-523.
    • (2003) VLDB , pp. 512-523
    • Iwerks, G.S.1    Samet, H.2    Smith, K.3
  • 8
    • 0037788772 scopus 로고    scopus 로고
    • Continuous nearest neighbor search
    • Y. Tao, D. Papadias, and Q. Shen, "Continuous nearest neighbor search," in Proc. VLDB, 2002, 287-298.
    • (2002) Proc. VLDB , pp. 287-298
    • Tao, Y.1    Papadias, D.2    Shen, Q.3
  • 9
    • 3142713119 scopus 로고    scopus 로고
    • Prediction and indexing of moving objects with unknown motion patterns
    • Y. Tao, C. Faloutsos, D. Papadias, and B. Liu, "Prediction and indexing of moving objects with unknown motion patterns," in Proc. SIGMOD, 2004, 611-622.
    • (2004) Proc. SIGMOD , pp. 611-622
    • Tao, Y.1    Faloutsos, C.2    Papadias, D.3    Liu, B.4
  • 10
    • 23944481004 scopus 로고    scopus 로고
    • Monitoring k-nearest neighbor queries over moving objects
    • X. Yu, K. Q. Pu, and N. Koudas, "Monitoring k-nearest neighbor queries over moving objects," in Proc. ICDE, 2005, 631-642.
    • (2005) Proc. ICDE , pp. 631-642
    • Yu, X.1    Pu, K.Q.2    Koudas, N.3
  • 11
    • 28044449142 scopus 로고    scopus 로고
    • Sea-cnn: Scalable processing of continuous k-nearest neighbor queries spatio-temporal databases
    • X. Xiong, M. F. Mokbel, and W. G. Aref, "Sea-cnn: Scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases," in Proc. ICDE, 2005, 643-654.
    • (2005) Proc. ICDE , pp. 643-654
    • Xiong, X.1    Mokbel, M.F.2    Aref, W.G.3
  • 12
    • 2342471891 scopus 로고    scopus 로고
    • Universal trajectory queries for moving object databases
    • H. Mokhtar and J. Su, "Universal trajectory queries for moving object databases," in Proc. MDM, 2004, 133-144.
    • (2004) Proc. MDM , pp. 133-144
    • Mokhtar, H.1    Su, J.2
  • 14
    • 70349162749 scopus 로고    scopus 로고
    • Continuous probabilistic nearest-neighbor queries for uncertain trajectories
    • G. Trajcevski, R. Tamassia, H. Ding, P. Scheuermann, and I. F. Cruz, "Continuous probabilistic nearest-neighbor queries for uncertain trajectories," in Proc. EDBT, 2009, 874-885.
    • (2009) Proc. EDBT , pp. 874-885
    • Trajcevski, G.1    Tamassia, R.2    Ding, H.3    Scheuermann, P.4    Cruz, I.F.5
  • 17
    • 4544385907 scopus 로고    scopus 로고
    • Querying imprecise data moving object environments
    • R. Cheng, D. Kalashnikov, and S. Prabhakar, "Querying imprecise data in moving object environments," in IEEE TKDE, vol. 16, no. 9, 2004, 1112-1127.
    • (2004) IEEE TKDE , vol.16 , Issue.9 , pp. 1112-1127
    • Cheng, R.1    Kalashnikov, D.2    Prabhakar, S.3
  • 18
    • 78149282726 scopus 로고    scopus 로고
    • Putmode: prediction of uncertain trajectories moving objects databases
    • S. Qiao, C. Tang, H. Jin, T. Long, S. Dai, Y. Ku, and M. Chau, "Putmode: prediction of uncertain trajectories in moving objects databases," Appl. Intell., vol. 33, no. 3, 370-386, 2010.
    • (2010) Appl. Intell. , vol.33 , Issue.3 , pp. 370-386
    • Qiao, S.1    Tang, C.2    Jin, H.3    Long, T.4    Dai, S.5    Ku, Y.6    Chau, M.7
  • 19
    • 84881336103 scopus 로고    scopus 로고
    • Interval reverse nearest neighbor queries on uncertain data with markov correlations
    • C. Xu, Y. Gu, L. Chen, J. Qiao, and G. Yu, "Interval reverse nearest neighbor queries on uncertain data with markov correlations," in Proc. ICDE, 2013.
    • (2013) Proc. ICDE
    • Xu, C.1    Gu, Y.2    Chen, L.3    Qiao, J.4    Yu, G.5
  • 22
    • 49049119939 scopus 로고    scopus 로고
    • Efficient continuous k-nearest neighbor query processing over moving objects with uncertain speed and direction
    • Y.-K. Huang, S.-J. Liao, and C. Lee, "Efficient continuous k-nearest neighbor query processing over moving objects with uncertain speed and direction," in Proc. SSDBM, 2008, 549-557.
    • (2008) Proc. SSDBM , pp. 549-557
    • Huang, Y.-K.1    Liao, S.-J.2    Lee, C.3
  • 23
    • 79955087000 scopus 로고    scopus 로고
    • Cknn query processing over moving objects with uncertain speeds road networks
    • G. Li, Y. Li, L. Shu, and P. Fan, "Cknn query processing over moving objects with uncertain speeds in road networks," in APWeb, 2011, 65-76.
    • (2011) APWeb , pp. 65-76
    • Li, G.1    Li, Y.2    Shu, L.3    Fan, P.4
  • 26
    • 84942584773 scopus 로고    scopus 로고
    • Probabilistic nearest neighbor queries on uncertain moving object trajectories (technical report)
    • J. Niedermayer, A. Züfle, T. Emrich, M. Renz, N. Mamoulis, L. Chen, and H.-P. Kriegel, "Probabilistic nearest neighbor queries on uncertain moving object trajectories (technical report)," 2013, http://www.dbs.ifi.lmu.de/Publikationen/Papers/TR PNN.pdf.
    • (2013)
    • Niedermayer, J.1    Züfle, A.2    Emrich, T.3    Renz, M.4    Mamoulis, N.5    Chen, L.6    Kriegel, H.-P.7
  • 27
    • 0001882616 scopus 로고
    • Fast algorithms for mining association rules
    • R. Agrawal and R. Srikant, "Fast algorithms for mining association rules," in Proc. VLDB, 1994, 487-499.
    • (1994) Proc. VLDB , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 30
    • 45349099441 scopus 로고    scopus 로고
    • Hidden markov models and the baum-welch algorithm
    • 1
    • L. R. Welch, "Hidden markov models and the baum-welch algorithm," IEEE Information Theory Society Newsletter, vol. 53, no. 4, 1,10-13, 2003.
    • (2003) IEEE Information Theory Society Newsletter , vol.53 , Issue.4 , pp. 10-13
    • Welch, L.R.1
  • 31
    • 0025447750 scopus 로고
    • The R*-Tree: An efficient and robust access method for points and rectangles
    • N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, "The R*-Tree: An efficient and robust access method for points and rectangles," in Proc. SIGMOD, 1990.
    • (1990) Proc. SIGMOD
    • Beckmann, N.1    Kriegel, H.-P.2    Schneider, R.3    Seeger, B.4
  • 32
    • 80052688627 scopus 로고    scopus 로고
    • Driving with knowledge from the physical world
    • J. Yuan, Y. Zheng, X. Xie, and G. Sun, "Driving with knowledge from the physical world," in Proc. KDD, 2011, 316-324.
    • (2011) Proc. KDD , pp. 316-324
    • Yuan, J.1    Zheng, Y.2    Xie, X.3    Sun, G.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.