Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Logótipo
Você está em: Start > Publications > View > Mining Association Rules for Label Ranking
Publication

Mining Association Rules for Label Ranking

Title
Mining Association Rules for Label Ranking
Type
Article in International Conference Proceedings Book
Year
2011
Authors
Claudio Rebelo de Sa
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Carlos Soares
(Author)
FEP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Alipio Mario Jorge
(Author)
FCUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page Without ORCID
Paulo Azevedo
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. View Authenticus page Without ORCID
Joaquim Costa
(Author)
FCUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Conference proceedings International
Pages: 432-443
15th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD)
Shenzhen, PEOPLES R CHINA, MAY 24-27, 2011
Scientific classification
CORDIS: Physical sciences > Computer science
FOS: Natural sciences > Computer and information sciences
Other information
Authenticus ID: P-002-VX3
Abstract (EN): Recently, a number of learning algorithms have been adapted for label ranking, including instance-based and tree-based methods. In this paper, we propose an adaptation of association rules for label ranking. The adaptation, which is illustrated in this work with APRIORI Algorithm, essentially consists of using variations of the support and confidence measures based on ranking similarity functions that are suitable for label ranking. We also adapt the method to make a prediction from the possibly conflicting consequents of the rules that apply to an example. Despite having made our adaptation from a very simple variant of association rules for classification, the results clearly show that the method is making valid predictions. Additionally, they show that it competes well with state-of-the-art label ranking algorithms.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 12
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same scientific areas

On Applying Linear Tabling to Logic Programs (2010)
Thesis
MIGUEL AREIAS; Ricardo Rocha
APRIORI Algorithm for Label Ranking (2010)
Thesis
Cláudio Sá; Carlos Soares; Joaquim Costa
On the average size of pd automata: an analytic combinatorics approach (2010)
Technical Report
Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis
On Covering Path Orthogonal Polygons (preliminary version) (2016)
Technical Report
Ana Paula Tomás; Catarina Lobo Ferreira

See all (138)

Recommend this page Top
Copyright 1996-2025 © Faculdade de Psicologia e de Ciências da Educação da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z  I Guest Book
Page created on: 2025-06-30 at 11:21:18 | Acceptable Use Policy | Data Protection Policy | Complaint Portal