In the context of time-critical applications there exists the need of clustering data streams so as to provide approximated solutions in the shortest possible time, in order to capture in real-time the evolution of physical or social phenomena. In this work, a nature-inspired algorithm for clustering of evolving big data stream is presented, which is designed to be executed on many-core GPU architectures.
A nature-inspired, anytime and parallel algorithm for data stream clustering
2017
Abstract
In the context of time-critical applications there exists the need of clustering data streams so as to provide approximated solutions in the shortest possible time, in order to capture in real-time the evolution of physical or social phenomena. In this work, a nature-inspired algorithm for clustering of evolving big data stream is presented, which is designed to be executed on many-core GPU architectures.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
