Efficient Discovery of Expressive Multi-label Rules using Relaxed Pruning
Being able to model correlations between labels is considered crucial in multi-label classification. Rule-based models enable to expose such dependencies, e.g., implications, subsumptions, or exclusions, in an interpretable and human-comprehensible manner. Albeit the number of possible label combinations increases exponentially with the number of available labels, it has been shown that rules with multiple labels in their heads, which are a natural form to model local label dependencies, can be induced efficiently by exploiting certain properties of rule evaluation measures and pruning the label search space accordingly. However, experiments have revealed that multi-label heads are unlikely to be learned by existing methods due to their restrictiveness. To overcome this limitation, we propose a plug-in approach that relaxes the search space pruning used by existing methods in order to introduce a bias towards larger multi-label heads resulting in more expressive rules. We further demonstrate the effectiveness of our approach empirically and show that it does not come with drawbacks in terms of training time or predictive performance.
Code (1)
Tasks
Multi-Label ClassificationMUlTI-LABEL-ClASSIFICATIONMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Relaxed Multiple-Instance SVM with Application to Object Discovery
Multiple-instance learning (MIL) has served as an important tool for a wide range of vision applications, for instance, image classification, object detection, and visual tracking. In this paper, we propose a novel metho…
General Classificationimage-classificationImage ClassificationMultiple Instance Learning+5Adaptive Multi-view Rule Discovery for Weakly-Supervised Compatible Products Prediction
On e-commerce platforms, predicting if two products are compatible with each other is an important functionality to achieve trustworthy product recommendation and search experience for consumers. However, accurately pred…
AttributeLanguage ModelingLanguage ModellingProduct RecommendationRobust Discovery of Positive and Negative Rules in Knowledge-Bases
We present RUDIK, a system for the discovery of declarative rules over knowledge-bases (KBs). RUDIK discovers rules that express positive relationships between entities, such as “if two persons have the same parent, they…
Knowledge GraphsKnowledge Graphs Data CurationPrompt-Based Rule Discovery and Boosting for Interactive Weakly-Supervised Learning
Weakly-supervised learning (WSL) has shown promising results in addressing label scarcity on many NLP tasks, but manually designing a comprehensive, high-quality labeling rule set is tedious and difficult. We study inter…
Weakly-supervised LearningPRBoost: Prompt-Based Rule Discovery and Boosting for Interactive Weakly-Supervised Learning
Weakly-supervised learning (WSL) has shown promising results in addressing label scarcity on many NLP tasks, but manually designing a comprehensive, high-quality labeling rule set is tedious and difficult. We study inter…
Weakly-supervised Learning