It is well known that considering a non-Euclidean Minkowski metric in Multidimensional Scaling, either for the distance model or for the loss function, increases the computational problem of localâ€¦ (More)

Given a set of objects and a symmetric matrix of dissimilarities between them, Unidimensional Scaling is the problem of finding a representation by locating points on a continuum. Approximatingâ€¦ (More)

We use the heuristics known as ant colony optimization in the partitioning problem for improving solutions of k-means method. Each ant in the algorithm is associated to a partition, which is modifiedâ€¦ (More)