메뉴 건너뛰기




Volumn 23, Issue 1, 2014, Pages 77-102

Incremental entity resolution on rules and data

Author keywords

Data cleaning; Data evolution; Entity resolution; Rule evolution

Indexed keywords

LARGE DATASET;

EID: 84892808316     PISSN: 10668888     EISSN: 0949877X     Source Type: Journal    
DOI: 10.1007/s00778-013-0315-0     Document Type: Article
Times cited : (45)

References (31)
  • 1
    • 85012236181 scopus 로고    scopus 로고
    • A framework for clustering evolving data streams
    • Aggarwal, C. C., Han, J., Wang, J., Yu, P. S.: A framework for clustering evolving data streams. In: VLDB, pp. 81-92 (2003).
    • (2003) VLDB , pp. 81-92
    • Aggarwal, C.C.1    Han, J.2    Wang, J.3    Yu, P.S.4
  • 2
    • 77954717287 scopus 로고    scopus 로고
    • On active learning of record matching packages
    • Arasu, A., Götz, M., Kaushik, R.: On active learning of record matching packages. In: SIGMOD Conference, pp. 783-794 (2010).
    • (2010) SIGMOD Conference , pp. 783-794
    • Arasu, A.1    Götz, M.2    Kaushik, R.3
  • 4
    • 34248229658 scopus 로고    scopus 로고
    • Collective entity resolution in relational data
    • Bhattacharya, I., Getoor, L.: Collective entity resolution in relational data. TKDD 1(1) (2007).
    • (2007) TKDD , vol.1 , Issue.1
    • Bhattacharya, I.1    Getoor, L.2
  • 5
    • 0030675156 scopus 로고    scopus 로고
    • Incremental clustering and dynamic information retrieval
    • Charikar, M., Chekuri, C., Feder, T., Motwani, R.: Incremental clustering and dynamic information retrieval. In: STOC, pp. 626-635 (1997).
    • (1997) STOC , pp. 626-635
    • Charikar, M.1    Chekuri, C.2    Feder, T.3    Motwani, R.4
  • 6
    • 26444550791 scopus 로고    scopus 로고
    • Robust identification of fuzzy duplicates
    • Tokyo, Japan
    • Chaudhuri, S., Ganti, V., Motwani, R.: Robust identification of fuzzy duplicates. In: Proc. of ICDE. Tokyo, Japan (2005).
    • (2005) Proc. of ICDE
    • Chaudhuri, S.1    Ganti, V.2    Motwani, R.3
  • 9
    • 29844452555 scopus 로고    scopus 로고
    • Reference reconciliation in complex information spaces
    • Dong, X., Halevy, A., Madhavan, J.: Reference reconciliation in complex information spaces. SIGMOD, In (2005).
    • (2005) SIGMOD
    • Dong, X.1    Halevy, A.2    Madhavan, J.3
  • 11
    • 0040746926 scopus 로고    scopus 로고
    • Optimizing queries using materialized views: A practical, scalable solution
    • Goldstein, J., Larson, P.Å.: Optimizing queries using materialized views: A practical, scalable solution. In: SIGMOD Conference, pp. 331-342 (2001).
    • (2001) SIGMOD Conference , pp. 331-342
    • Goldstein, J.1    Larson, P.Å.2
  • 12
    • 0001120850 scopus 로고
    • Minimum spanning trees and single linkage cluster analysis
    • Gower, J. C., Ross, G. J. S.: Minimum spanning trees and single linkage cluster analysis. Applied Statistics 18(1), 54-64 (1969).
    • (1969) Applied Statistics , vol.18 , Issue.1 , pp. 54-64
    • Gower, J.C.1    Ross, G.J.S.2
  • 14
    • 77953181128 scopus 로고    scopus 로고
    • Schema and data: A holistic approach to mapping, resolution and fusion in information integration
    • Haas, L. M., Hentschel, M., Kossmann, D., Miller, R. J.: Schema and data: A holistic approach to mapping, resolution and fusion in information integration. In: ER, pp. 27-40 (2009).
    • (2009) ER , pp. 27-40
    • Haas, L.M.1    Hentschel, M.2    Kossmann, D.3    Miller, R.J.4
  • 16
    • 84976856849 scopus 로고
    • The merge/purge problem for large databases
    • Hernández, M. A., Stolfo, S. J.: The merge/purge problem for large databases. In: Proc. of ACM SIGMOD, pp. 127-138 (1995).
    • (1995) Proc. of ACM SIGMOD , pp. 127-138
    • Hernández, M.A.1    Stolfo, S.J.2
  • 17
    • 0344612511 scopus 로고    scopus 로고
    • A small approximately min-wise independent family of hash functions
    • Indyk, P.: A small approximately min-wise independent family of hash functions. J. Algorithms 38(1), 84-90 (2001).
    • (2001) J. Algorithms , vol.38 , Issue.1 , pp. 84-90
    • Indyk, P.1
  • 18
    • 77953765820 scopus 로고    scopus 로고
    • Data clustering: 50 years beyond k-means
    • Jain A. K.: Data clustering: 50 years beyond k-means. In: ECML/PKDD (1), pp. 3-4 (2008).
    • (2008) ECML/PKDD (1) , pp. 3-4
    • Jain, A.K.1
  • 20
    • 83055197116 scopus 로고    scopus 로고
    • Scalable entity matching computation with materialization
    • Lee, S., Lee, J., won Hwang, S.: Scalable entity matching computation with materialization. In: CIKM, pp. 2353-2356 (2011).
    • (2011) CIKM , pp. 2353-2356
    • Lee, S.1    Lee, J.2    won Hwang, S.3
  • 22
    • 0034592784 scopus 로고    scopus 로고
    • Efficient clustering of high-dimensional data sets with application to reference matching
    • Boston, MA
    • McCallum, A. K., Nigam, K., Ungar, L.: Efficient clustering of high-dimensional data sets with application to reference matching. In: Proc. of KDD, pp. 169-178. Boston, MA (2000).
    • (2000) Proc. of KDD , pp. 169-178
    • McCallum, A.K.1    Nigam, K.2    Ungar, L.3
  • 23
    • 79960270026 scopus 로고    scopus 로고
    • Evaluating entity resolution results
    • Menestrina, D., Whang, S., Garcia-Molina, H.: Evaluating entity resolution results. PVLDB 3(1), 208-219 (2010).
    • (2010) Pvldb , vol.3 , Issue.1 , pp. 208-219
    • Menestrina, D.1    Whang, S.2    Garcia-Molina, H.3
  • 24
    • 0004043396 scopus 로고    scopus 로고
    • An efficient domain-independent algorithm for detecting approximately duplicate database records
    • Monge, A. E., Elkan, C.: An efficient domain-independent algorithm for detecting approximately duplicate database records. In: DMKD, pp. 23-29 (1997).
    • (1997) DMKD , pp. 23-29
    • Monge, A.E.1    Elkan, C.2
  • 25
    • 0001139918 scopus 로고
    • Record linkage: making maximum use of the discriminating power of identifying information
    • Newcombe, H. B., Kennedy, J. M.: Record linkage: making maximum use of the discriminating power of identifying information. Commun. ACM 5(11), 563-566 (1962).
    • (1962) Commun. ACM , vol.5 , Issue.11 , pp. 563-566
    • Newcombe, H.B.1    Kennedy, J.M.2
  • 26
    • 0242456811 scopus 로고    scopus 로고
    • Interactive deduplication using active learning
    • Edmonton, Alberta
    • Sarawagi, S., Bhamidipaty, A.: Interactive deduplication using active learning. In: Proc. of ACM SIGKDD. Edmonton, Alberta (2002).
    • (2002) Proc. of ACM SIGKDD
    • Sarawagi, S.1    Bhamidipaty, A.2
  • 27
    • 0035545848 scopus 로고    scopus 로고
    • Learning object identification rules for information integration
    • Tejada, S., Knoblock, C. A., Minton, S.: Learning object identification rules for information integration. Information Systems Journal 26(8), 635-656 (2001).
    • (2001) Information Systems Journal , vol.26 , Issue.8 , pp. 635-656
    • Tejada, S.1    Knoblock, C.A.2    Minton, S.3
  • 28
    • 71349088450 scopus 로고    scopus 로고
    • Generic entity resolution with negative rules
    • Whang, S. E., Benjelloun, O., Garcia-Molina, H.: Generic entity resolution with negative rules. VLDB J. 18(6), 1261-1277 (2009).
    • (2009) VLDB J. , vol.18 , Issue.6 , pp. 1261-1277
    • Whang, S.E.1    Benjelloun, O.2    Garcia-Molina, H.3
  • 29
    • 83055176299 scopus 로고    scopus 로고
    • Entity resolution with evolving rules
    • Whang, S. E., Garcia-Molina, H.: Entity resolution with evolving rules. PVLDB 3(1), 1326-1337 (2010).
    • (2010) Pvldb , vol.3 , Issue.1 , pp. 1326-1337
    • Whang, S.E.1    Garcia-Molina, H.2


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