Unsupervised relation disambiguation using spectral clustering

COLING/ACL 2006 - 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Main Conference Poster Sessions

Volumn , Issue , 2006, Pages 89-96

  Chen, Jinxiu ^a   Ji, Donghong ^a   Tan, Chew Lim ^b   Niu, Zhengyu ^a  

^a INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS;

ADJACENCY GRAPHS; CLUSTER NUMBER ESTIMATION; CLUSTERING METHODS; GRAPH LAPLACIAN; HIGH DIMENSIONALITY; LEXICAL FEATURES; SPECTRAL CLUSTERING; SUBMANIFOLDS; SYNTACTIC FEATURES;

EIGENVALUES AND EIGENFUNCTIONS;

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

References (17)

1. th ACM International Conference on Digital Libraries (ACMDL'00).
2. Brin Sergey. 1998. Extracting patterns and relations from world wide web. In Proc. of WebDB Workshop at 6th International Conference on Extending Database Technology (WebDB'98). pages 172-183.
3. Charniak E.. 1999. A Maximum-entropy-inspired parser. Technical Report CS-99-12.. Computer Science Department, Brown University.
4. Culotta A. and Soresen J. 2004. Dependency tree kernels for relation extraction, In proceedings of 42th Annual Meeting of the Association for Computational Linguistics. 21-26 July 2004. Barcelona, Spain.
5. Defense Advanced Research Projects Agency. 1995. Proceedings of the Sixth Message Understanding Conference (MUC-6) Morgan Kaufmann Publishers, Inc.
6. Hasegawa Takaaki, Sekine Satoshi and Grishman Ralph. 2004. Discovering Relations among Named Entities from Large Corpora, Proceeding of Conference ACL2004. Barcelona, Spain.
7. Kambhatla N. 2004. Combining lexical, syntactic and semantic features with Maximum Entropy Models for extracting relations, In proceedings of 42th Annual Meeting of the Association for Computational Linguistics. 21-26 July 2004. Barcelona, Spain.
8. Kannan R., Vempala S., and Vetta A.. 2000. On clustering: Good,bad and spectral. In Proceedings of the 41st Foundations of Computer Science. pages 367-380.
9. Miller S.,Fox H.,Ramshaw L. and Weischedel R. 2000. A novel use of statistical parsing to extract information from text. In proceedings of 6th Applied Natural Language Processing Conference. 29 April-4 may 2000, Seattle USA.
10. Ng Andrew.Y, Jordan M., and Weiss Y.. 2001. On spectral clustering: Analysis and an algorithm. In Proceedings of Advances in Neural Information Processing Systems. pages 849-856.
11. Sanguinetti G., Laidler J. and Lawrence N.. 2005. Automatic determination of the number of clusters using spectral algorithms.In: IEEE Machine Learning for Signal Processing. 28-30 Sept 2005, Mystic, Connecticut, USA.
12. Shi J. and Malik.J. 2000. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence. 22(8):888-905.
13. Weiss Yair. 1999. Segmentation using eigenvectors: A unifying view. ICCV(2). pp.975-982.
14. Zelenko D., Aone C. and Richardella A.. 2002. Kernel Methods for Relation Extraction, Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP). Philadelphia.
15. Zha H.,Ding C.,Gu.M,He X.,and Simon H.. 2001. Spectral Relaxation for k-means clustering. In Neural Information Processing Systems (NIPS2001). pages 1057-1064, 2001.
16. Zhang Zhu. 2004. Weakly-supervised relation classification for Information Extraction, In proceedings of ACM 13th conference on Information and Knowledge Management (CIKM'2004). 8-13 Nov 2004. Washington D.C.,USA.
17. Zhou GuoDong, Su Jian, Zhang Jie and Zhang min. 2005. Exploring Various Knowledge in Relation Extraction, In proceedings of 43th Annual Meeting of the Association for Computational Linguistics. USA.