Weakly-supervised relation classification for information extraction
The DOI matches its Crossref record.
Abstract
This paper approaches the relation classification problem in information extraction framework with bootstrapping on top of Support Vector Machines. A new bootstrapping algorithm is proposed and empirically evaluated on the ACE corpus. We show that the supervised SVM classifier using various lexical and syntactic features can achieve promising classification accuracy. More importantly, the proposed BootProject algorithm based on random feature projection can significantly reduce the need for labeled training data with only limited sacrifice of performance.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Exploring various knowledge in relation extraction
GuoDong, Z., Jian, S., Jie, Z., & Min, Z. (2005) · Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics - ACL '05 · doi:10.3115/1219840.1219893 · Cited by 764
Challenges in Data-to-Document Generation
Wiseman, S., Shieber, S., & Rush, A. (2017) · Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d17-1239 · Cited by 524
Classifying Relations by Ranking with Convolutional Neural Networks
dos Santos, C., Xiang, B., & Zhou, B. (2015) · Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) · doi:10.3115/v1/p15-1061 · Cited by 498
Relation Classification via Multi-Level Attention CNNs
Wang, L., Cao, Z., de Melo, G., & Liu, Z. (2016) · Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p16-1123 · Cited by 487
Named Entity Recognition and Relation Extraction: State-of-the-Art
Nasar, Z., Jaffry, S. W., & Malik, M. K. (2022) · ACM Computing Surveys · doi:10.1145/3445965 · Cited by 245
Metadata
- Authors
- Zhang, Z.
- Venue
- Proceedings of the thirteenth ACM international conference on Information and knowledge management
- Publisher
- ACM
- Published
- 2004-11-13
- Pages
- 581-588
- OpenAlex
- W2039914071
- Cited by
- 89
- References
- 0
- FWCI
- 1.95
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Weakly-supervised relation classification for information extraction. https://app.cochat.ai/papers/10.1145/1031171.1031279
- The paper
- Zhang, Z. (2004). Weakly-supervised relation classification for information extraction. Proceedings of the thirteenth ACM international conference on Information and knowledge management. https://doi.org/10.1145/1031171.1031279
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.