paper-with-me

홈 › Papers

Is Something Better than Nothing? Automatically Predicting Stance-based Arguments Using Deep Learning and Small Labelled Dataset

2018-06-01 · NAACL 2018 6 · Pavithra Rajendran, Danushka Bollegala, Simon Parsons

Online reviews have become a popular portal among customers making decisions about purchasing products. A number of corpora of reviews have been widely investigated in NLP in general, and, in particular, in argument mining. This is a subset of NLP that deals with extracting arguments and the relations among them from user-based content. A major problem faced by argument mining research is the lack of human-annotated data. In this paper, we investigate the use of weakly supervised and semi-supervised methods for automatically annotating data, and thus providing large annotated datasets. We do this by building on previous work that explores the classification of opinions present in reviews based whether the stance is expressed explicitly or implicitly. In the work described here, we automatically annotate stance as implicit or explicit and our results show that the datasets we generate, although noisy, can be used to learn better models for implicit/explicit opinion classification.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Abstract ArgumentationArgument MiningGeneral ClassificationOpinion MiningSentiment Analysis

Similar Papers 제목 키워드 기반

Something for (almost) nothing: Improving deep ensemble calibration using unlabeled data

2023-10-04 · Konstantinos Pitas, Julyan Arbel

We present a method to improve the calibration of deep ensembles in the small training data regime in the presence of unlabeled data. Our approach is extremely simple to implement: given an unlabeled set, for each unlabe…

Diversity

GitOfThoughts: Version-Controlled Reasoning and Agent Memory You Can Replay, Diff, and Merge

2026-06-12 · Pavan C Shekar, Abhishek H S, Aswanth Krishnan arxiv

Large language model reasoning leaves no trace once it is done. The steps of a chain of thought disappear when the context window closes, a pruned search branch is just gone, and memory buffers cannot be diffed, merged, …

On the effectiveness of task granularity for transfer learning

2018-04-24 · Farzaneh Mahdisoltani, Guillaume Berger, Waseem Gharbieh, David Fleet 외

We describe a DNN for video classification and captioning, trained end-to-end, with shared features, to solve tasks at different levels of granularity, exploring the link between granularity in a source task and the qual…

ClassificationDiversityGeneral ClassificationTransfer Learning+1

Automatic Domain Adaptation Outperforms Manual Domain Adaptation for Predicting Financial Outcomes

2020-06-25 · ACL 2019 7 · Marina Sedinkina, Nikolas Breitkopf, Hinrich Schütze

In this paper, we automatically create sentiment dictionaries for predicting financial outcomes. We compare three approaches: (I) manual adaptation of the domain-general dictionary H4N, (ii) automatic adaptation of H4N a…

Domain Adaptation

Scrapyard AI

2026-04-09 · Marc Böhlen, Sai Krishna arxiv

This paper considers AI model churn as an opportunity for frugal investigation of large AI models. It describes how the incessant push for ever more powerful AI systems leaves in its wake a collection of obsolete yet pow…