.png){kind=icon}
Return
IDD: A supervised interval distance-based method for discretization
.png){kind=icon}
OA
AI
DOI：10.1109/TKDE.2008.66.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper introduces a new method for supervised discretization based on interval distances by using a novel concept of neighborhood in the target's space. The proposed method takes into consideration the order of the class attribute, when this exists, so that it can be used with ordinal discrete classes as well as continuous classes, in the case of regression problems. The method has proved to be very efficient in terms of accuracy and faster than the most commonly supervised discretization methods used in the literature. It is illustrated through several examples, and a comparison with other standard discretization methods is performed for three public data sets by using two different learning tasks: a decision tree algorithm and SVM for regression.
Keywords:
classification
ordinal regression
supervised discretization
interval distances
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.4
Papers:
6.8K
Citations:
3.2W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveJoint wireless resource allocation and service function chaining scheduling for Tactile InternetOAAI
OAAIShareSaveShareSaveShareSaveEffects of Eugenol on Alzheimer’s Disease-like Manifestations in Insulin- and Aβ-Induced Rat Models
PREAI
ShareSaveShareSave
ShareSave no more
no more