Bootstrapping Supervised Machine-learning Polarity Classifiers with Rule-based Classification

Konferenzbeitrag

In this paper, we explore the effectiveness of bootstrapping supervised machine-learning polarity classifiers using the output of domain-independent rule-based classifiers. The benefit of this method is that no labeled training data are required. Still, this method allows to capture in-domain knowledge by training the supervised classifier on in-domain features, such as bag of words. We investigate how important the quality of the rule-based classifier is and what features are useful for the supervised classifier. The former addresses the issue in how far relevant constructions for polarity classification, such as word sense disambiguation, negation modeling, or intensification, are important for this self-training approach. We not only compare how this method relates to conventional semi-supervised learning but also examine how it performs under more difficult settings in which classes are not balanced and mixed reviews are included in the dataset.

Object Details

• Language: Englisch

Classification and Topics

• Subject: Computerlinguistik ; Maschinelles Lernen ; Information Extraction ; Polarität ; Natürliche Sprache ; Sprache

Contributors, Places and Time

• Event: Geistige Schöpfung
• (who): Wiegand, Michael ; Klakow, Dietrich
• Event: Veröffentlichung
• (who): Alicante : Universidad de Alicante
• (when): 2019-01-24

Further information

• URN: urn:nbn:de:bsz:mh39-84473
• Last update: 06.03.2025, 9:00 AM CET