Graph-based clustering for computational linguistics: A survey

ACL 2010 - TextGraphs 2010: 2010 Workshop on Graph-Based Methods for Natural Language Processing, Proceedings of the Workshop

Volumn , Issue , 2010, Pages 1-9

  Chen, Zheng ^a   Ji, Heng ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH-BASED CLUSTERING; ITS APPLICATIONS;

COMPUTATIONAL LINGUISTICS; NATURAL LANGUAGE PROCESSING SYSTEMS; SURVEYS;

GRAPHIC METHODS;

EID: 80053255437     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (45)

1. A. Bagga and B. Baldwin.1998. Algorithms for scoring coreference chains. Proc. The First International Conference on Language Resources and Evaluation Workshop on Linguistics Coreference.
2. A. Clauset. 2005. Finding local community structure in networks. Physical Review E, 72:026132.
3. B. Dom. 2001. An information-theoretic external cluster-validity measure. IBM Research Report.
4. B. Dorow, D. Widdows. 2003. Discovering corpusspecific word-senses. In Proc. EACL.
5. B. W. Kernighan and S. Lin.1970. An efficient heuristic procedur for partitioning graphs. Bell Syst. Techn. J., Vol. 49, No. 2, pp. 291-307.
6. C. Biemann. 2006. Chinese Whispers - An Efficient- Graph Clustering Algorithm and its Application to Natural Language Processing Problems. In Proc. of the HLT-NAACL-06 Workshop on Textgraphs-06.
7. C. Nicolae and G. Nicolae. 2006. Bestcut: A graph algorithm for coreference resolution. In EMNLP, pages 275-283, Sydney, Australia.
8. E. Agirre, D. Martinez, O.L. de Lacalle and A.Soroa. 2007. Two graph-based algorithms for state-of-theart WSD. In Proc. EMNLP.
9. E. Amigo, J. Gonzalo, J. Artiles and F. Verdejo. 2008. A comparison of extrinsic clustering evaluation metrics based on formal constraints. Information Retrieval.
10. E. Terra and C. L. A. Clarke. Frequency Estimates for Statistical Word Similarity Measures. In Proc. HLT/NAACL 2003.
11. G. Karypis and V. Kumar. 1999. Multilevel algorithms for multiconstraint graph partitioning. in Proceedings of the 36th ACM/IEEE conference on Design automation conference, (New Orleans, Louisiana), pp. 343 - 348.
12. G. W. Flake, R. E. Tarjan and K. Tsioutsiouliklis. 2003. Graph clustering and minimum cut trees. Internet Mathematics, 1(4):385-408.
13. H. Zha.2002. Generic summarization and keyphrase extraction using mutual reinforcement principle and sentence clustering. In Proc. of SIGIR2002, pp. 113-120.
14. J. Chen, O. R. Zaïane, R. Goebel. 2009. Detecting Communities in Social Networks Using Max-Min Modularity. SDM 2009: 978-989.
15. J. Ruan and W. Zhang.2008. Identifying network communities with a high resolution. Physical Review E, 77:016104.
16. J. Shi and J. Malik. 2000. Normalized Cuts and Image Segmentation. IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888-905.
17. J. Véronis. 2004. HyperLex: Lexical Cartography for Information Retrieval. Computer Speech & Language 18(3).
18. K. Ichioka and F. Fukumoto. 2008. Graph-based clustering for semantic classification of onomatopoetic words. In Proc. of the 3rd Textgraphs Workshop on Graph-based Algorithms for Natural Language Processing.
19. L. Hagen and A. B. Kahng. 1992. New spectral methods for ratio cut partitioning and clustering. IEEE Transactions Computer-Aided Design, Santa Clara CA, 422-427.
20. L. R. Ford, D. R. Fulkerson. 1956. Maximal flow through a network. Canadian Journal of Mathematics 8: 399-404.
21. M. E. J. Newman. 2004. Detecting community structure in networks. Eur. Phys. J. B, 38, 321-330.
22. M. E. J. Newman. 2004. Fast algorithm for detecting community structure in networks. Phys Rev E. 69, 2004.
23. M. E. J. Newman and M. Girvan. 2004. Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113.
24. M. Girvan and M. E. J. Newman. 2002. Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99, 7821-7826.
25. M. Meila. 2003. Comparing clusterings. In Proceedings of COLT03.
26. M. Vilain, J. Burger, J. Aberdeen, D. Connolly and L. Hirschman.1995. A model-theoretic coreference scoring scheme. In Proceedings of the Sixth Message Understanding Conference (MUC-6).
27. P. Elango. 2005. Coreference Resolution: A Survey. Technical Report, University of Wisconsin Madison.
28. R. Kannan, S. Vempala, and A. Vetta. 2000. On clusterings: good, bad and spectral. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science.
29. S. Abney. 2007. Semi-supervised Learning for Computational Linguistics, Chapman and Hall.
30. S. E. Schaeffer. 2007. Graph clustering. Computer Science Review, 1(1):27-64.
31. S. Fortunato, V. Latora, and M. Marchiori. 2004. A Method to Find Community Structures Based on Information Centrality. Phys Rev E.70, 056104.
32. S. van Dongen. 2000. Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht.
33. S. White and P. Smyth. 2005. A spectral clustering approach to finding communities in graphs. In SIAM International Conference on Data Mining.
34. U. Brandes, M. Gaertler, and D. Wagner. 2003. Experiments on graph clustering algorithms. Proc. 11th European Symp. Algorithms, LNCS 2832:568-579.
35. U. Brandes, M. Gaertler, and D.Wagner. 2007. Engineering graph clustering: Models and experimental evaluation. J. Exp. Algorithmics, 12:1.1.
36. U. Luxburg, O. Bousquet, M. Belkin. 2005. Limits of spectral clustering. In L. K. Saul, Y. Weiss and L. Bottou (Eds.), Advances in neural information processing systems 17. Cambridge, MA: MIT Press.
37. U. Luxburg.2006. A tutorial on spectral clustering. Technical Report 149, Max Plank Institute for Biological Cybernetics.
38. V. Ng and C. Cardie. 2002. Improving machine learning approaches to coreference resolution. In Proc. Of the ACL, pages 104-111.
39. W. M. Soon, H. T. Ng and D. Lim.2001. A machine learning approach to coreference resolution of noun phrases. Computational Linguistics, 27(4):521-544.
40. X. Luo. 2005. On coreference resolution performance metrics. Proc. of HLT-EMNLP.
41. X. Luo, A. Ittycheriah, H. Jing, N. Kambhatla and S. Roukos. 2004. A mention-synchronous coreference resolution algorithm based on the Bell Tree. In Proc. of ACL-04, pp.136-143.
42. Y. Matsuo, T. Sakaki, K. Uchiyama, and M. Ishizuka. 2006. Graph-based word clustering using web search engine. In Proc. of EMNLP 2006.
43. Z. Chen and H. Ji. 2009a. Graph-based Event Coreference Resolution. In Proc. ACL-IJCNLP 2009 workshop on TextGraphs-4: Graph-based Methods for Natural Language Processing.
44. Z. Chen, H. Ji, R. Haralick. 2009b. A Pairwise Coreference Model, Feature Impact and Evaluation for Event Coreference Resolution. In Proc. RANLP 2009 workshop on Events in Emerging Text Types.
45. Z. Chen. 2010. Graph-based Clustering and its Application in Coreference Resolution. Technical Report, the Graduate Center, the City University of New York.