Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: l₁-clustering

Sortuj według:

Ogranicz wyniki do:

Center-based l₁-clustering method

100%

Sabo K.

International Journal of Applied Mathematics and Computer Science

2014

tom 24

nr 1

151-163

In this paper, we consider the l₁-clustering problem for a finite data-point set which should be partitioned into k disjoint nonempty subsets. In that case, the objective function does not have to be either convex or differentiable, and generally it may have many local or global minima. Therefore, it becomes a complex global optimization problem. A method of searching for a locally optimal solution is proposed in the paper, the convergence of the corresponding iterative process is proved and the corresponding algorithm is given. The method is illustrated by and compared with some other clustering methods, especially with the l₂-clustering method, which is also known in the literature as a smooth k-means method, on a few typical situations, such as the presence of outliers among the data and the clustering of incomplete data. Numerical experiments show in this case that the proposed l₁-clustering algorithm is faster and gives significantly better results than the l₂-clustering algorithm.

Ograniczanie wyników

1 International Journal of Applied Mathematics and Computer Science

1 Sabo K.

1 2014

Wyniki wyszukiwania

Center-based l₁-clustering method