DataWords: Getting Contrarian with Text, Structured Data and Explanations
Our goal is to build classification models using a combination of free-text and structured data. To do this, we represent structured data by text sentences, DataWords, so that similar data items are mapped into the same sentence. This permits modeling a mixture of text and structured data by using only text-modeling algorithms. Several examples illustrate that it is possible to improve text classification performance by first running extraction tools (named entity recognition), then converting the output to DataWords, and adding the DataWords to the original text -- before model building and classification. This approach also allows us to produce explanations for inferences in terms of both free text and structured data.
Code (0)
등록된 구현이 없습니다.
Tasks
Classificationnamed-entity-recognitionNamed Entity RecognitionNamed Entity Recognition (NER)Sentencetext-classificationText ClassificationSimilar Papers 제목 키워드 기반
Augmented CARDS: A machine learning approach to identifying triggers of climate change misinformation on Twitter
Misinformation about climate change poses a significant threat to societal well-being, prompting the urgent need for effective mitigation strategies. However, the rapid proliferation of online misinformation on social me…
MisinformationHijacking online reviews: sparse manipulation and behavioral buffering in popularity-biased rating systems
Online reviews and recommendation systems help users navigate overwhelming choice, but they are vulnerable to self-reinforcing distortions. This paper examines how a single malicious reviewer can exploit popularity-biase…
Recommendation SystemsGenerative Debunking of Climate Misinformation
Misinformation about climate change causes numerous negative impacts, necessitating corrective responses. Psychological research has offered various strategies for reducing the influence of climate misinformation, such a…
MisinformationErased, but Not Gone: Output Forgetting Is Not True Forgetting
Machine unlearning (MU) is commonly judged by output forgetting, such as low forget-set accuracy or reduced logit-level membership inference. But if output-level success can coexist with retraining-inconsistent residuals…
Can an LLM Induce a Graph? Investigating Memory Drift and Context Length
Recently proposed evaluation benchmarks aim to characterize the effective context length and the forgetting tendencies of large language models (LLMs). However, these benchmarks often rely on simplistic 'needle in a hays…
Relational Reasoning