paper-with-me

홈 › Papers

Unsupervised Expressive Rules Provide Explainability and Assist Human Experts Grasping New Domains

2020-10-19 · Findings of the Association for Computational Linguistics 2020 · Eyal Shnarch, Leshem Choshen, Guy Moshkowich, Noam Slonim, Ranit Aharonov

Approaching new data can be quite deterrent; you do not know how your categories of interest are realized in it, commonly, there is no labeled data at hand, and the performance of domain adaptation methods is unsatisfactory. Aiming to assist domain experts in their first steps into a new task over a new corpus, we present an unsupervised approach to reveal complex rules which cluster the unexplored corpus by its prominent categories (or facets). These rules are human-readable, thus providing an important ingredient which has become in short supply lately - explainability. Each rule provides an explanation for the commonality of all the texts it clusters together. We present an extensive evaluation of the usefulness of these rules in identifying target categories, as well as a user study which assesses their interpretability.

📄 PDF Abstract BibTeX arXiv:2010.09459

Code (0)

등록된 구현이 없습니다.

Tasks

Domain Adaptation

Similar Papers 제목 키워드 기반

BoolXLLM: LLM-Assisted Explainability for Boolean Models

2026-05-12 · Du Cheng, Serdar Kadioglu, Xin Wang arxiv

Interpretable machine learning aims to provide transparent models whose decision-making processes can be readily understood by humans. Recent advances in rule-based approaches, such as expressive Boolean formulas (BoolXA…

Interpretable Machine Learning

Experimenting with UD Adaptation of an Unsupervised Rule-based Approach for Sentiment Analysis of Mexican Tourist Texts

2023-09-11 · Olga Kellert, Mahmud Uz Zaman, Nicholas Hill Matlis, Carlos Gómez-Rodríguez

This paper summarizes the results of experimenting with Universal Dependencies (UD) adaptation of an Unsupervised, Compositional and Recursive (UCR) rule-based approach for Sentiment Analysis (SA) submitted to the Shared…

NegationSentiment Analysis

Mode-Assisted Joint Training of Deep Boltzmann Machines

2021-02-17 · Haik Manukian, Massimiliano Di Ventra

The deep extension of the restricted Boltzmann machine (RBM), known as the deep Boltzmann machine (DBM), is an expressive family of machine learning models which can serve as compact representations of complex probabilit…

Logical Expressivity and Explanations for Monotonic GNNs with Scoring Functions

2025-08-14 · Matthew Morris, David J. Tena Cucala, Bernardo Cuenca Grau arxiv

Graph neural networks (GNNs) are often used for the task of link prediction: predicting missing binary facts in knowledge graphs (KGs). To address the lack of explainability of GNNs on KGs, recent works extract Datalog r…

Knowledge GraphsLink Prediction

Explainable and Efficient Randomized Voting Rules

2023-09-21 · NeurIPS 2023 11

With a rapid growth in the deployment of AI tools for making critical decisions (or aiding humans in doing so), there is a growing demand to be able to explain to the stakeholders how these tools arrive at a decision. Co…