메뉴 건너뛰기




Volumn 1, Issue , 2013, Pages 1083-1093

Resolving entity morphs in censored data

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

EID: 84907374542     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (17)

References (33)
  • 1
    • 10944272139 scopus 로고    scopus 로고
    • Friends and neighbors on the web
    • Lada A. Adamic and Eytan Adar. 2001. Friends and neighbors on the web. SOCIAL NETWORKS, 25:211-230.
    • (2001) Social Networks , vol.25 , pp. 211-230
    • Adamic, L.A.1    Adar, E.2
  • 2
    • 65449152304 scopus 로고    scopus 로고
    • Influence and correlation in social networks
    • Aris Anagnostopoulos, Ravi Kumar, and Mohammad Mahdian. 2008. Influence and correlation in social networks. In KDD, pages 7-15.
    • (2008) KDD , pp. 7-15
    • Anagnostopoulos, A.1    Kumar, R.2    Mahdian, M.3
  • 3
    • 84864017443 scopus 로고    scopus 로고
    • Censorship and deletion practices in chinese social media
    • David Bamman, Brendan O'Connor, and Noah A. Smith. 2012. Censorship and deletion practices in chinese social media. First Monday, 17 (3).
    • (2012) First Monday , vol.17 , Issue.3
    • Bamman, D.1    O'Connor, B.2    Smith, N.A.3
  • 4
    • 78751513528 scopus 로고    scopus 로고
    • The one thing you must get right when building a brand
    • Patrick Barwise and Seán Meehan. 2010. The one thing you must get right when building a brand. Harvard Business Review, 88(12):80-84.
    • (2010) Harvard Business Review , vol.88 , Issue.12 , pp. 80-84
    • Barwise, P.1    Seán Meehan2
  • 9
    • 84901762166 scopus 로고    scopus 로고
    • Improving named entity translation by exploiting comparable and parallel corpora
    • Ahmed Hassan, Haytham Fahmy, and Hany Hassan. 2007. Improving named entity translation by exploiting comparable and parallel corpora. In RANLP.
    • (2007) RANLP
    • Hassan, A.1    Fahmy, H.2    Hassan, H.3
  • 10
    • 84976825385 scopus 로고
    • Algorithms for the longest common subsequence problem
    • Daniel S. Hirschberg. 1977. Algorithms for the longest common subsequence problem. J. ACM, 24(4):664-675.
    • (1977) J. ACM , vol.24 , Issue.4 , pp. 664-675
    • Hirschberg, D.S.1
  • 15
    • 84859903043 scopus 로고    scopus 로고
    • Refining event extraction through cross-document inference
    • Heng Ji and Ralph Grishman. 2008. Refining event extraction through cross-document inference. In Proceedings of ACL, pages 254-262.
    • (2008) Proceedings of ACL , pp. 254-262
    • Ji, H.1    Grishman, R.2
  • 26
    • 83255185987 scopus 로고    scopus 로고
    • Pathsim: Meta path-based top-k similarity search in heterogeneous information networks
    • Yizhou Sun, Jiawei Han, Xifeng Yan, Philip S. Yu, and Tianyi Wu. 2011b. Pathsim: Meta path-based top-k similarity search in heterogeneous information networks. PVLDB, 4(11):992-1003.
    • (2011) PVLDB , vol.4 , Issue.11 , pp. 992-1003
    • Sun, Y.1    Han, J.2    Yan, X.3    Yu, P.S.4    Wu, T.5
  • 29
    • 0015960104 scopus 로고
    • The string-to-string correction problem
    • Robert A. Wagner and Michael J. Fischer. 1974. The string-to-string correction problem. J. ACM, 21(1):168-173.
    • (1974) J. ACM , vol.21 , Issue.1 , pp. 168-173
    • Wagner, R.A.1    Fischer, M.J.2
  • 31
    • 77956217647 scopus 로고    scopus 로고
    • On the quality of inferring interests from social neighbors
    • Zhen Wen and Ching-Yung Lin. 2010. On the quality of inferring interests from social neighbors. In KDD, pages 373-382.
    • (2010) KDD , pp. 373-382
    • Wen, Z.1    Lin, C.2


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