메뉴 건너뛰기




Volumn 277, Issue , 2014, Pages 492-511

Entity resolution for probabilistic data

Author keywords

Entity resolution; Probabilistic database

Indexed keywords

ARTIFICIAL INTELLIGENCE; SOFTWARE ENGINEERING;

EID: 84901754548     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2014.02.135     Document Type: Conference Paper
Times cited : (18)

References (41)
  • 4
    • 84883204963 scopus 로고    scopus 로고
    • Computing all skyline probabilities for uncertain data
    • M.J. Atallah, Y. Qi, Computing all skyline probabilities for uncertain data, in: Proc. of PODS, 2009.
    • (2009) Proc. of PODS
    • Atallah, M.J.1    Qi, Y.2
  • 8
    • 77952372966 scopus 로고    scopus 로고
    • Adaptive duplicate detection using learnable string similarity measures
    • M. Bilenko, R.J. Mooney, Adaptive duplicate detection using learnable string similarity measures, in: Proc. of KDD, 2003.
    • (2003) Proc. of KDD
    • Bilenko, M.1    Mooney, R.J.2
  • 11
    • 61349087255 scopus 로고    scopus 로고
    • Cleaning uncertain data with quality guarantees
    • R. Cheng, J. Chen, X. Xie, Cleaning uncertain data with quality guarantees, in: PVLDB, vol. 1, 2008.
    • (2008) PVLDB , vol.1
    • Cheng, R.1    Chen, J.2    Xie, X.3
  • 12
    • 0032091575 scopus 로고    scopus 로고
    • Integration of heterogeneous databases without common domains using queries based on textual similarity
    • W.W. Cohen, Integration of heterogeneous databases without common domains using queries based on textual similarity, in: Proc. of SIGMOD Conference, 1998.
    • (1998) Proc. of SIGMOD Conference
    • Cohen, W.W.1
  • 13
    • 11144240583 scopus 로고    scopus 로고
    • A comparison of string distance metrics for name-matching tasks
    • W.W. Cohen, P.D. Ravikumar, S.E. Fienberg, A comparison of string distance metrics for name-matching tasks, in: Proc. of IIWeb, 2003.
    • (2003) Proc. of IIWeb
    • Cohen, W.W.1    Ravikumar, P.D.2    Fienberg, S.E.3
  • 14
    • 67649643456 scopus 로고    scopus 로고
    • Semantics of ranking queries for probabilistic data and expected ranks
    • G. Cormode, F. Li, K. Yi, Semantics of ranking queries for probabilistic data and expected ranks, in: Proc. of ICDE, 2009.
    • (2009) Proc. of ICDE
    • Cormode, G.1    Li, F.2    Yi, K.3
  • 17
    • 29844452555 scopus 로고    scopus 로고
    • Reference reconciliation in complex information spaces
    • X. Dong, A.Y. Halevy, J. Madhavan, Reference reconciliation in complex information spaces, in: Proc. of SIGMOD, 2005.
    • (2005) Proc. of SIGMOD
    • Dong, X.1    Halevy, A.Y.2    Madhavan, J.3
  • 21
    • 0013331361 scopus 로고    scopus 로고
    • Real-world data is dirty: Data cleansing and the merge/purge problem
    • M.A. Hernández, and S.J. Stolfo Real-world data is dirty: data cleansing and the merge/purge problem Data Min. Knowl. Discov. 2 1998
    • (1998) Data Min. Knowl. Discov. , vol.2
    • Hernández, M.A.1    Stolfo, S.J.2
  • 23
    • 85123004356 scopus 로고    scopus 로고
    • Flexible string matching against large databases in practice
    • N. Koudas, A. Marathe, D. Srivastava, Flexible string matching against large databases in practice, in: Proc. of VLDB, 2004.
    • (2004) Proc. of VLDB
    • Koudas, N.1    Marathe, A.2    Srivastava, D.3
  • 24
    • 43349106519 scopus 로고    scopus 로고
    • Probabilistic nearest-neighbor query on uncertain objects
    • H.-P. Kriegel, P. Kunath, M. Renz, Probabilistic nearest-neighbor query on uncertain objects, in: DASFAA, 2007.
    • (2007) DASFAA
    • Kriegel, H.-P.1    Kunath, P.2    Renz, M.3
  • 25
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions, and reversals
    • V.I. Levenshtein, Binary codes capable of correcting deletions, insertions, and reversals. Sov. Phys. Doklady 10 1966
    • (1966) Sov. Phys. Doklady , vol.10
    • Levenshtein, V.I.1
  • 26
    • 78651594422 scopus 로고    scopus 로고
    • A survey on uncertainty management in data integration
    • M. Magnani, and D. Montesi A survey on uncertainty management in data integration J. Data Inf. Qual. 2 2010
    • (2010) J. Data Inf. Qual. , vol.2
    • Magnani, M.1    Montesi, D.2
  • 27
    • 0034592784 scopus 로고    scopus 로고
    • Efficient clustering of high-dimensional data sets with application to reference matching
    • A. McCallum, K. Nigam, L.H. Ungar, Efficient clustering of high-dimensional data sets with application to reference matching, in: Proc. of KDD, 2000.
    • (2000) Proc. of KDD
    • McCallum, A.1    Nigam, K.2    Ungar, L.H.3
  • 29
    • 85018108837 scopus 로고    scopus 로고
    • The field matching problem: Algorithms and applications
    • A.E. Monge, C. Elkan, The field matching problem: algorithms and applications, in: Proc. of KDD, 1996.
    • (1996) Proc. of KDD
    • Monge, A.E.1    Elkan, C.2
  • 30
    • 0004043396 scopus 로고    scopus 로고
    • An efficient domain-independent algorithm for detecting approximately duplicate database records
    • A.E. Monge, C. Elkan, An efficient domain-independent algorithm for detecting approximately duplicate database records, in: Proc. of DMKD, 1997.
    • (1997) Proc. of DMKD
    • Monge, A.E.1    Elkan, C.2
  • 32
    • 84863758445 scopus 로고    scopus 로고
    • Optimizing probabilistic query processing on continuous uncertain data
    • L. Peng, Y. Diao, and A. Liu Optimizing probabilistic query processing on continuous uncertain data PVLDB 4 2011
    • (2011) PVLDB , vol.4
    • Peng, L.1    Diao, Y.2    Liu, A.3
  • 33
    • 34548714632 scopus 로고    scopus 로고
    • Efficient top-k query evaluation on probabilistic data
    • C. Re, N.N. Dalvi, D. Suciu, Efficient top-k query evaluation on probabilistic data, in: Proc. of ICDE, 2007.
    • (2007) Proc. of ICDE
    • Re, C.1    Dalvi, N.N.2    Suciu, D.3
  • 36
    • 77952590351 scopus 로고    scopus 로고
    • Embracing uncertainty in large-scale computational astrophysics
    • D. Suciu, A. Connolly, B. Howe, Embracing uncertainty in large-scale computational astrophysics, in: MUD, 2009.
    • (2009) MUD
    • Suciu, D.1    Connolly, A.2    Howe, B.3
  • 37
    • 0035545848 scopus 로고    scopus 로고
    • Learning object identification rules for information integration
    • S. Tejada, C.A. Knoblock, and S. Minton Learning object identification rules for information integration Inf. Syst. 26 2001
    • (2001) Inf. Syst. , vol.26
    • Tejada, S.1    Knoblock, C.A.2    Minton, S.3
  • 39
    • 27544453079 scopus 로고
    • An Application of the Fellegi-Sunter Model of Record Linkage to the 1990 us Decennial Census
    • US Bureau of the Census
    • W. Winkler, Y. Thibaudeau, An Application of the Fellegi-Sunter Model of Record Linkage to the 1990 us Decennial Census, Technical Report Statistical Research Report Series RR91/09, US Bureau of the Census, 1991.
    • (1991) Technical Report Statistical Research Report Series RR91/09
    • Winkler, W.1    Thibaudeau, Y.2
  • 40
    • 53349136541 scopus 로고    scopus 로고
    • Efficient processing of top-k queries in uncertain databases with x-relations
    • K. Yi, F. Li, G. Kollios, and D. Srivastava Efficient processing of top-k queries in uncertain databases with x-relations TKDE 20 2008
    • (2008) TKDE , vol.20
    • Yi, K.1    Li, F.2    Kollios, G.3    Srivastava, D.4
  • 41
    • 77952908455 scopus 로고    scopus 로고
    • Superseding nearest neighbor search on uncertain spatial databases
    • S.M. Yuen, Y. Tao, X. Xiao, J. Pei, and D. Zhang Superseding nearest neighbor search on uncertain spatial databases TKDE 22 2010
    • (2010) TKDE , vol.22
    • Yuen, S.M.1    Tao, Y.2    Xiao, X.3    Pei, J.4    Zhang, D.5


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