On-line outer bounding ellipsoid algorithm for clustering of hyperplanes in the presence of bounded noise.

Autor: Goudjil, Abdelhak, Pouliquen, Mathieu, Pigeon, Eric, Gehan, Olivier
Předmět:
Zdroj: Cluster Computing; Feb2024, Vol. 27 Issue 1, p575-587, 13p
Abstrakt: In this paper, we consider the matter of on-line clustering of hyperplanes within the presence of bounded noise. This is often a challenging problem that involves the segmentation of the data and the estimation of the hyperplanes parameters. The proposed algorithm consists in two successive steps. At whenever, the first step allows to assign the current data point to the most appropriate hyperplane and therefore the second step realizes an update of the parameters of the hyperplane that contains the data point. The second step springs from an Outer Bounding Ellipsoid type algorithm suitable for on-line parameters estimation within the presence of bounded noise. The performance of our algorithm is proven using synthetic and real data. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index
Externí odkaz: