Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > Multi-interval Discretization of Continuous Attributes for Label Ranking
Publication

Publications

Multi-interval Discretization of Continuous Attributes for Label Ranking

Title
Multi-interval Discretization of Continuous Attributes for Label Ranking
Type
Article in International Conference Proceedings Book
Year
2013
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)
FEUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Arno Knobbe
(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
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
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
Conference proceedings International
Pages: 155-169
16th International Conference on Discovery Science (DS)
Singapore, SINGAPORE, OCT 06-09, 2013
Scientific classification
FOS: Natural sciences > Computer and information sciences
Other information
Authenticus ID: P-008-HKZ
Abstract (EN): Label Ranking (LR) problems, such as predicting rankings of financial analysts, are becoming increasingly important in data mining. While there has been a significant amount of work on the development of learning algorithms for LR in recent years, pre-processing methods for LR are still very scarce. However, some methods, like Naive Bayes for LR and APRIORI-LR, cannot deal with real-valued data directly. As a make-shift solution, one could consider conventional discretization methods used in classification, by simply treating each unique ranking as a separate class. In this paper, we show that such an approach has several disadvantages. As an alternative, we propose an adaptation of an existing method, MDLP, specifically for LR problems. We illustrate the advantages of the new method using synthetic data. Additionally, we present results obtained on several benchmark datasets. The results clearly indicate that the discretization is performing as expected and in some cases improves the results of the learning algorithms.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 15
Documents
We could not find any documents associated to the publication.
Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-15 at 19:34:41 | Privacy Policy | Personal Data Protection Policy | Whistleblowing