An algorithm is developed for solving clustering problems with the similarity measure defined using the L1and L∞ norms. It is based on an incremental approach and applies nonsmooth optimization methods to find cluster centers. Computational results on 12 data sets are reported and the proposed algorithm is compared with the X-means algorithm.
Advances in recent techniques for scientific data collection in the era of big data allow for the sy...
International audienceWe propose a meta-heuristic algorithm for clustering objects that are describe...
The aim of this paper is to design an algorithm based on nonsmooth optimization techniques to solve ...
An algorithm is developed for solving clustering problems with the similarity measure defined using ...
Cluster analysis deals with the problem of organization of a collection of objects into clusters bas...
WOS: 000351906500010Clustering is an important problem in data mining. It can be formulated as a non...
Cluster analysis deals with the problem of organization of a collection of patterns into clusters ba...
Data mining is about solving problems by analyzing data that present in databases. Supervised and un...
Clustering is one of an interesting data mining topics that can be applied in many fields. Recently,...
The minimum sum-of-squares clustering problem is formulated as a problem of nonsmooth, nonconvex opt...
The problem of cluster analysis is formulated as a problem of non-smooth, non-convex optimization, a...
Standard clustering methods such as K-means, Gaussian mixture models, and hierarchical clustering, a...
This paper introduces non-Euclidean c-means clustering algorithms. These algorithms rely on weighted...
The problem of cluster analysis is formulated as a problem of nonsmooth, nonconvex optimization. An ...
Clusterwise linear regression consists of finding a number of linear regression functions each appro...
Advances in recent techniques for scientific data collection in the era of big data allow for the sy...
International audienceWe propose a meta-heuristic algorithm for clustering objects that are describe...
The aim of this paper is to design an algorithm based on nonsmooth optimization techniques to solve ...
An algorithm is developed for solving clustering problems with the similarity measure defined using ...
Cluster analysis deals with the problem of organization of a collection of objects into clusters bas...
WOS: 000351906500010Clustering is an important problem in data mining. It can be formulated as a non...
Cluster analysis deals with the problem of organization of a collection of patterns into clusters ba...
Data mining is about solving problems by analyzing data that present in databases. Supervised and un...
Clustering is one of an interesting data mining topics that can be applied in many fields. Recently,...
The minimum sum-of-squares clustering problem is formulated as a problem of nonsmooth, nonconvex opt...
The problem of cluster analysis is formulated as a problem of non-smooth, non-convex optimization, a...
Standard clustering methods such as K-means, Gaussian mixture models, and hierarchical clustering, a...
This paper introduces non-Euclidean c-means clustering algorithms. These algorithms rely on weighted...
The problem of cluster analysis is formulated as a problem of nonsmooth, nonconvex optimization. An ...
Clusterwise linear regression consists of finding a number of linear regression functions each appro...
Advances in recent techniques for scientific data collection in the era of big data allow for the sy...
International audienceWe propose a meta-heuristic algorithm for clustering objects that are describe...
The aim of this paper is to design an algorithm based on nonsmooth optimization techniques to solve ...