메뉴 건너뛰기




Volumn , Issue , 2011, Pages 106-111

Declarative analysis of noisy information networks

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS TECHNIQUES; DATA CLEANING; DATA MANAGEMENT SYSTEM; DATALOG; DOMAIN SPECIFIC; GRAPH STRUCTURES; INFORMATION NETWORKS; NETWORK DATA; OBSERVATIONAL DATA; PERFORMANCE EVALUATION; PROTOTYPE SYSTEM; SOCIAL NETWORKS; WIDE SPECTRUM;

EID: 79958044971     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDEW.2011.5767619     Document Type: Conference Paper
Times cited : (11)

References (13)
  • 1
    • 10944272139 scopus 로고    scopus 로고
    • Friends and neighbors on the Web
    • DOI 10.1016/S0378-8733(03)00009-1, PII S0378873303000091
    • L. Adamic and E. Adar. Friends and neighbors on the web. Social Networks, 25(3):211-230, 2003. (Pubitemid 36831776)
    • (2003) Social Networks , vol.25 , Issue.3 , pp. 211-230
    • Adamic, L.A.1    Adar, E.2
  • 2
    • 0344756851 scopus 로고    scopus 로고
    • Eliminating fuzzy duplicates in data warehouses
    • R. Ananthakrishna, S. Chaudhuri, and V. Ganti. Eliminating fuzzy duplicates in data warehouses. In VLDB, 2002.
    • (2002) VLDB
    • Ananthakrishna, R.1    Chaudhuri, S.2    Ganti, V.3
  • 3
    • 67649649597 scopus 로고    scopus 로고
    • Large-scale deduplication with constraints using dedupalog
    • A. Arasu, C. Re, and D. Suciu. Large-scale deduplication with constraints using dedupalog. In ICDE, 2009.
    • (2009) ICDE
    • Arasu, A.1    Re, C.2    Suciu, D.3
  • 5
    • 34248229658 scopus 로고    scopus 로고
    • Collective entity resolution in relational data
    • I. Bhattacharya and L. Getoor. Collective entity resolution in relational data. ACM TKDD, 1:1-36, 2007.
    • (2007) ACM TKDD , vol.1 , pp. 1-36
    • Bhattacharya, I.1    Getoor, L.2
  • 6
    • 1142279457 scopus 로고    scopus 로고
    • Robust and efficient fuzzy match for online data cleaning
    • S. Chaudhuri, K. Ganjam, V. Ganti, and R. Motwani. Robust and efficient fuzzy match for online data cleaning. In SIGMOD, 2003.
    • (2003) SIGMOD
    • Chaudhuri, S.1    Ganjam, K.2    Ganti, V.3    Motwani, R.4
  • 8
    • 33749549879 scopus 로고    scopus 로고
    • Exploiting relationships for domain-independent data cleaning
    • D. Kalashnikov, S. Mehrotra, and Z. Chen. Exploiting relationships for domain-independent data cleaning. In SIAM SDM, 2005.
    • (2005) SIAM SDM
    • Kalashnikov, D.1    Mehrotra, S.2    Chen, Z.3
  • 9
    • 18744398132 scopus 로고    scopus 로고
    • The link prediction problem for social networks
    • D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In CIKM, 2003.
    • (2003) CIKM
    • Liben-Nowell, D.1    Kleinberg, J.2
  • 12
    • 70349107137 scopus 로고    scopus 로고
    • Evaluating very large datalog queries on social networks
    • R. Ronen and O. Shmueli. Evaluating very large datalog queries on social networks. In EDBT, 2009.
    • (2009) EDBT
    • Ronen, R.1    Shmueli, O.2
  • 13
    • 78650483466 scopus 로고    scopus 로고
    • Representing, querying and transforming social networks with rdf/sparql
    • M. San Martín and C. Gutierrez. Representing, querying and transforming social networks with rdf/sparql. In ESWC, 2009.
    • (2009) ESWC
    • San Martín, M.1    Gutierrez, C.2


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