Please use this identifier to cite or link to this item:
|Title:||Unsupervised relation disambiguation with order identification capabilities|
|Source:||Chen, J.,Ji, D.,Tan, C.L.,Niu, Z. (2006). Unsupervised relation disambiguation with order identification capabilities. COLING/ACL 2006 - EMNLP 2006: 2006 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference : 568-575. ScholarBank@NUS Repository.|
|Abstract:||We present an unsupervised learning approach to disambiguate various relations between name entities by use of various lexical and syntactic features from the contexts. It works by calculating eigenvectors of an adjacency graph's Laplacian to recover a submanifold of data from a high dimensionality space and then performing cluster number estimation on the eigenvectors. This method can address two difficulties encoutered in Hasegawa et al. (2004)'s hierarchical clustering: no consideration of manifold structure in data, and requirement to provide cluster number by users. Experiment results on ACE corpora show that this spectral clustering based approach outperforms Hasegawa et al. (2004)'s hierarchical clustering method and a plain k-means clustering method. © 2006 Association for Computational Linguistics.|
|Source Title:||COLING/ACL 2006 - EMNLP 2006: 2006 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 19, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.