Snowball: extracting relations from large plain-text collections
DL '00 Proceedings of the fifth ACM conference on Digital libraries
Text Categorization with Suport Vector Machines: Learning with Many Relevant Features
ECML '98 Proceedings of the 10th European Conference on Machine Learning
Extracting Patterns and Relations from the World Wide Web
WebDB '98 Selected papers from the International Workshop on The World Wide Web and Databases
Learning from Labeled and Unlabeled Data using Graph Mincuts
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Kernel methods for relation extraction
The Journal of Machine Learning Research
Natural language question answering: the view from here
Natural Language Engineering
Dependence language model for information retrieval
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
Semi-supervised learning using randomized mincuts
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Weakly-supervised relation classification for information extraction
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Immediate-head parsing for language models
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Unsupervised named-entity extraction from the web: an experimental study
Artificial Intelligence
Document re-ranking using cluster validation and label propagation
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
A study on convolution kernels for shallow semantic parsing
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Discovering relations among named entities from large corpora
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Dependency tree kernels for relation extraction
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Word sense disambiguation using label propagation based semi-supervised learning
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Extracting relations with integrated information using kernel methods
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Exploring various knowledge in relation extraction
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Modeling commonality among related classes in relation extraction
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Relation extraction using label propagation based semi-supervised learning
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
A composite kernel to extract relations between entities with both flat and structured features
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
IJCNLP'05 Proceedings of the Second international joint conference on Natural Language Processing
Clustering-based stratified seed sampling for semi-supervised relation classification
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
Developing Position Structure-Based Framework for Chinese Entity Relation Extraction
ACM Transactions on Asian Language Information Processing (TALIP)
ACM Transactions on Asian Language Information Processing (TALIP)
Cross-Lingual Annotation Projection for Weakly-Supervised Relation Extraction
ACM Transactions on Asian Language Information Processing (TALIP)
Hi-index | 0.00 |
This paper proposes a semi-supervised learning method for semantic relation extraction between named entities. Given a small amount of labeled data, it benefits much from a large amount of unlabeled data by first bootstrapping a moderate number of weighted support vectors from all the available data through a co-training procedure on top of support vector machines (SVM) with feature projection and then applying a label propagation (LP) algorithm via the bootstrapped support vectors and the remaining hard unlabeled instances after SVM bootstrapping to classify unseen instances. Evaluation on the ACE RDC corpora shows that our method can integrate the advantages of both SVM bootstrapping and label propagation. It shows that our LP algorithm via the bootstrapped support vectors and hard unlabeled instances significantly outperforms the normal LP algorithm via all the available data without SVM bootstrapping. Moreover, our LP algorithm can significantly reduce the computational burden, especially when a large amount of labeled and unlabeled data is taken into consideration.