Using Graphs of Classifiers to Impose Declarative Constraints on Semi-supervised Learning
We propose a general approach to modeling semi-supervised learning (SSL) algorithms. Specifically, we present a declarative language for modeling both traditional supervised classification tasks and many SSL heuristics, including both well-known heuristics such as co-training and novel domain-specific heuristics. In addition to representing individual SSL heuristics, we show that multiple heuristics can be automatically combined using Bayesian optimization methods. We experiment with two classes of tasks, link-based text classification and relation extraction. We show modest improvements on well-studied link-based classification benchmarks, and state-of-the-art results on relation-extraction tasks for two realistic domains.
Code (0)
등록된 구현이 없습니다.
Tasks
Bayesian OptimizationClassificationGeneral ClassificationRelationRelation Extractiontext-classificationText ClassificationSimilar Papers 제목 키워드 기반
Using Graphs of Classifiers to Impose Constraints on Semi-supervised Relation Extraction
Semi-Supervised Learning with Declaratively Specified Entropy Constraints
We propose a technique for declaratively specifying strategies for semi-supervised learning (SSL). The proposed method can be used to specify ensembles of semi-supervised learning, as well as agreement constraints and en…
Bayesian OptimizationRelation ExtractionDisCoveR: Accurate & Efficient Discovery of Declarative Process Models
Declarative process modeling formalisms - which capture high-level process constraints - have seen growing interest, especially for modeling flexible processes. This paper presents DisCoveR, an extremely efficient and ac…
Binary ClassificationStreamlining Knowledge Graph Creation with PyRML
Knowledge Graphs (KGs) are increasingly adopted as a foundational technology for integrating heterogeneous data in domains such as climate science, cultural heritage, and the life sciences. Declarative mapping languages …
Data IntegrationKnowledge GraphsEfficiently Deciding Algebraic Equivalence of Bow-Free Acyclic Path Diagrams
For causal discovery in the presence of latent confounders, constraints beyond conditional independences exist that can enable causal discovery algorithms to distinguish more pairs of graphs. Such constraints are not wel…
Causal Discovery