Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
Assefaw Hadish Gebremedhin, Fredrik Manne, Tom Woo...
This paper investigates an extension of classification trees to deal with uncertain information where uncertainty is encoded in possibility theory framework. Class labels in data s...
Ilyes Jenhani, Nahla Ben Amor, Salem Benferhat, Zi...
- Clustering of data is an important data mining application. One of the problems with traditional partitioning clustering methods is that they partition the data into hard bound n...
Abstract. In the last years, several papers have proposed to adopt multiobjective evolutionary algorithms (MOEAs) to generate Mamdani fuzzy rulebased systems with different trade-o...
Michela Antonelli, Pietro Ducange, Beatrice Lazzer...
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...