메뉴 건너뛰기




Volumn 1, Issue , 2014, Pages 775-785

Robust entity clustering via phylogenetic inference

Author keywords

[No Author keywords available]

Indexed keywords

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 84906925171     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/v1/p14-1073     Document Type: Conference Paper
Times cited : (15)

References (41)
  • 4
    • 80053349286 scopus 로고    scopus 로고
    • Who is who and what is what: Experiments in crossdocument co-reference
    • Stroudsburg, PA, USA. Association for Computational Linguistics
    • Alex Baron and Marjorie Freedman. 2008. Who is who and what is what: Experiments in crossdocument co-reference. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, EMNLP '08, pages 274-283, Stroudsburg, PA, USA. Association for Computational Linguistics.
    • (2008) Proceedings of the Conference on Empirical Methods in Natural Language Processing, EMNLP '08 , pp. 274-283
    • Baron, A.1    Freedman, M.2
  • 6
    • 80053537814 scopus 로고    scopus 로고
    • Distance dependent chinese restaurant processes
    • November
    • David M. Blei and Peter I. Frazier. 2011. Distance dependent chinese restaurant processes. J. Mach. Learn. Res., 12:2461-2488, November.
    • (2011) J. Mach. Learn. Res. , vol.12 , pp. 2461-2488
    • Blei, D.M.1    Frazier, P.I.2
  • 14
    • 70450158501 scopus 로고    scopus 로고
    • Latent-variable modeling of string transductions with finite-state methods
    • Honolulu, Hawaii, October. Association for Computational Linguistics
    • Markus Dreyer, Jason Smith, and Jason Eisner. 2008. Latent-variable modeling of string transductions with finite-state methods. In Proceedings of the 2008 Conference on Empirical Methods in Natural Language Processing, pages 1080-1089, Honolulu, Hawaii, October. Association for Computational Linguistics.
    • (2008) Proceedings of the 2008 Conference on Empirical Methods in Natural Language Processing , pp. 1080-1089
    • Dreyer, M.1    Smith, J.2    Eisner, J.3
  • 15
    • 80052250414 scopus 로고    scopus 로고
    • Adaptive subgradient methods for online learning and stochastic optimization
    • July
    • John Duchi, Elad Hazan, and Yoram Singer. 2011. Adaptive subgradient methods for online learning and stochastic optimization. J. Mach. Learn. Res., 12:2121-2159, July.
    • (2011) J. Mach. Learn. Res. , vol.12 , pp. 2121-2159
    • Duchi, J.1    Hazan, E.2    Singer, Y.3
  • 21
    • 84889074989 scopus 로고    scopus 로고
    • To link or not to link? a study on end-to-end tweet entity linking
    • Stephen Guo, Ming-Wei Chang, and Emre Kiciman. 2013. To link or not to link? a study on end-to-end tweet entity linking. In Proceedings of NAACL-HLT, pages 1020-1030.
    • (2013) Proceedings of NAACL-HLT , pp. 1020-1030
    • Guo, S.1    Chang, M.2    Kiciman, E.3
  • 23
    • 80052248446 scopus 로고    scopus 로고
    • Pcfgs, topic models, adaptor grammars and learning topical collocations and the structure of proper names
    • Stroudsburg, PA, USA. Association for Computational Linguistics
    • Mark Johnson. 2010. Pcfgs, topic models, adaptor grammars and learning topical collocations and the structure of proper names. In Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, ACL '10, pages 1148-1157, Stroudsburg, PA, USA. Association for Computational Linguistics.
    • (2010) Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, ACL '10 , pp. 1148-1157
    • Johnson, M.1
  • 24
    • 84871545356 scopus 로고    scopus 로고
    • Unsupervised name ambiguity resolution using a generative model
    • Stroudsburg, PA, USA. Association for Computational Linguistics
    • Zornitsa Kozareva and Sujith Ravi. 2011. Unsupervised name ambiguity resolution using a generative model. In Proceedings of the First Workshop on Unsupervised Learning in NLP, EMNLP '11, pages 105-112, Stroudsburg, PA, USA. Association for Computational Linguistics.
    • (2011) Proceedings of the First Workshop on Unsupervised Learning in NLP, EMNLP '11 , pp. 105-112
    • Kozareva, Z.1    Ravi, S.2
  • 27
    • 78049372129 scopus 로고    scopus 로고
    • Improved minmax cut graph clustering with nonnegative relaxation
    • José L. Balcázar, Francesco Bonchi, Aristides Gionis, and Michèle Sebag, editors, Springer
    • Feiping Nie, Chris H. Q. Ding, Dijun Luo, and Heng Huang. 2010. Improved minmax cut graph clustering with nonnegative relaxation. In José L. Balcázar, Francesco Bonchi, Aristides Gionis, and Michèle Sebag, editors, ECML/PKDD (2), volume 6322 of Lecture Notes in Computer Science, pages 451-466. Springer.
    • (2010) ECML/PKDD (2), Volume 6322 of Lecture Notes in Computer Science , pp. 451-466
    • Nie, F.1    Ding, C.H.Q.2    Luo, D.3    Huang, H.4
  • 29
    • 84950632109 scopus 로고
    • Objective criteria for the evaluation of clustering methods
    • William M. Rand. 1971. Objective criteria for the evaluation of clustering methods. Journal of the American Statistical Association, 66(336):846-850.
    • (1971) Journal of the American Statistical Association , vol.66 , Issue.336 , pp. 846-850
    • Rand, W.M.1
  • 31
    • 84906929444 scopus 로고    scopus 로고
    • Technical Report CS-TR-532-96, Princeton University, Department of Computer Science
    • Eric Sven Ristad and Peter N. Yianilos. 1996. Learning string edit distance. Technical Report CS-TR- 532-96, Princeton University, Department of Computer Science.
    • (1996) Learning String Edit Distance
    • Sven Ristad, E.1    Yianilos, P.N.2
  • 35
    • 0017465744 scopus 로고
    • Finding optimum branchings
    • R E Tarjan. 1977. Finding optimum branchings. Networks, 7(1):25-35.
    • (1977) Networks , vol.7 , Issue.1 , pp. 25-35
    • Tarjan, R.E.1
  • 36
    • 0000576595 scopus 로고
    • Markov chains for exploring posterior distributions
    • Luke Tierney. 1994. Markov Chains for Exploring Posterior Distributions. The Annals of Statistics, 22(4):1701-1728.
    • (1994) The Annals of Statistics , vol.22 , Issue.4 , pp. 1701-1728
    • Tierney, L.1
  • 38
    • 84876803966 scopus 로고    scopus 로고
    • A discriminative hierarchical model for fast coreference at large scale
    • ACL '12, Stroudsburg, PA, USA. Association for Computational Linguistics
    • Michael Wick, Sameer Singh, and Andrew McCallum. 2012. A discriminative hierarchical model for fast coreference at large scale. In Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1, ACL '12, pages 379-388, Stroudsburg, PA, USA. Association for Computational Linguistics.
    • (2012) Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers , vol.1 , pp. 379-388
    • Wick, M.1    Singh, S.2    McCallum, A.3


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