We present a novel algorithm for clustering streams of multidimensional points based on kernel density estimates of the data. The algorithm requires only one pass over each data point and a constant amount of space, which depends only on the accuracy of clustering. The algorithm recognizes clusters of nonspherical shapes and handles both inserted and deleted objects in the input stream. Querying the membership of a point in a cluster can be answered in constant time.
Stream Clustering Based on Kernel Density Estimation / S. Lodi; G. Moro; C. Sartori. - STAMPA. - 141:(2006), pp. 799-800. (Intervento presentato al convegno The 17th European Conference on Artificial Intelligence tenutosi a Riva del Garda, Italy nel 29 Agosto - 1 Settembre 2006).
Stream Clustering Based on Kernel Density Estimation
LODI, STEFANO;MORO, GIANLUCA;SARTORI, CLAUDIO
2006
Abstract
We present a novel algorithm for clustering streams of multidimensional points based on kernel density estimates of the data. The algorithm requires only one pass over each data point and a constant amount of space, which depends only on the accuracy of clustering. The algorithm recognizes clusters of nonspherical shapes and handles both inserted and deleted objects in the input stream. Querying the membership of a point in a cluster can be answered in constant time.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
