Preference rules for label ranking: Mining patterns in multi-target relations
원문 초록
In this paper we investigate two variants of association rules for preference data, Label Ranking Association Rules and Pairwise Association Rules. Label Ranking Association Rules (LRAR) are the equivalent of Class Association Rules (CAR) for the Label Ranking task. In CAR, the consequent is a single class, to which the example is expected to belong to. In LRAR, the consequent is a ranking of the labels. The generation of LRAR requires special support and confidence measures to assess the similarity of rankings. In this work, we carry out a sensitivity analysis of these similarity-based measures. We want to understand which datasets benefit more from such measures and which parameters have more influence in the accuracy of the model. Furthermore, we propose an alternative type of rules, the Pairwise Association Rules (PAR), which are defined as association rules with a set of pairwise preferences in the consequent. While PAR can be used both as descriptive and predictive models, they are essentially descriptive models. Experimental results show the potential of both approaches.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Describe Anything Model for Visual Question Answering on Text-rich Images
Assay2Mol: large language model-based drug design using BioAssay context
Beyond Accuracy: Metrics that Uncover What Makes a 'Good' Visual Descriptor
Dataset Distillation via Vision-Language Category Prototype
DRAMA-X: A Fine-grained Intent Prediction and Risk Reasoning Benchmark For Driving
InstructTTSEval: Benchmarking Complex Natural-Language Instruction Following in Text-to-Speech Systems
토론
이 논문과 연결된 포럼 글이 아직 없습니다.