• Aucun résultat trouvé

Optimistic Rough Sets Attribute Reduction using Dynamic Programming

N/A
N/A
Protected

Academic year: 2021

Partager "Optimistic Rough Sets Attribute Reduction using Dynamic Programming"

Copied!
12
0
0

Texte intégral

Références

Documents relatifs

5) Train and test data: Unlike most common multi-scale features that rely on spatial windows, attribute profiles rely on specific connectivity that prevents the use of random points

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

In the case of big data, to retrieve information, there are various analysis techniques with different orientations and results, such as Representation-learning

This paper presents a classification algorithm based on the method of reference planes using the values of the conjugacy indices.. Statement of

In this paper we will present an Detection and Tracking of Moving Objects (DATMO) algorithm featuring an object- type classification based on the belief theory.. This algorithm

Scheunders, “Wavelet-based colour texture retrieval using the Kullback-Leibler divergence between bivari- ate generalized Gaussian models,” in Image Processing, IEEE

Deterministic Dynamic Programming is frequently used to solve the management problem of hybrid vehicles (choice of mode and power sharing between thermal and electric

After preparing and preprocessing the data using the C5 decision tree algorithm in this paper, the classification model has been constructed and the credit rating of