Making large-scale support vector machine learning practical
Advances in kernel methods
Combining support vector and mathematical programming methods for classification
Advances in kernel methods
Snowball: extracting relations from large plain-text collections
DL '00 Proceedings of the fifth ACM conference on Digital libraries
Transductive Inference for Text Classification using Support Vector Machines
ICML '99 Proceedings of the Sixteenth International 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
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A Maximum-Entropy-Inspired Parser
A Maximum-Entropy-Inspired Parser
Kernel methods for relation extraction
The Journal of Machine Learning Research
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
Understanding the Yarowsky Algorithm
Computational Linguistics
Classifying semantic relations in bioscience texts
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Compensating for annotation errors in training a relation extractor
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
Hi-index | 0.00 |
This paper studies the problem of mining relational data hidden in natural language text. In particular, it approaches the relation classification problem with the strategy of transductive learning. Different algorithms are presented and empirically evaluated on the ACE corpus. We show that transductive learners exploiting various lexical and syntactic features can achieve promising classification performance. More importantly, transductive learning performance can be significantly improved by using an induced similarity function.