International audienceUsually, incremental algorithms for data streams clustering not only suffer from sensitive initialization parameters, but also incorrectly represent large classes by many cluster representatives, which leads to decrease the computational efficiency over time. We propose in this paper an incremental clustering algorithm based on "growing neural gas" (GNG), which addresses this issue by using a parameter-free adaptive threshold to produce representatives and a distance-based probabilistic criterion to eventually condense them. Experiments show that the proposed algorithm is competitive with existing algorithms of the same family, while maintaining fewer representatives and being independent of sensitive parameters
For clustering accuracy, on influx of data, the parameter-free incremental clustering research is es...
Part 1: AlgorithmsInternational audienceThe size, complexity and dimensionality of data collections ...
Part 7: AlgorithmsInternational audienceThe paper deals with the high dimensional data clustering pr...
International audienceWe propose an unsupervised online learning method based on the "growing neural...
AbstractIn dynamic information environments such as the web, the amount of information is rapidly in...
Clustering algorithms belong to major topics in big data analysis. Their main goal is to separate an...
Le travail de recherche exposé dans cette thèse concerne le développement d'approches à base de grow...
The research outlined in this thesis concerns the development of approaches based on growing neural ...
Challenges for clustering streaming data are getting continuously more sophisticated. This trend is ...
International audienceIncremental learning refers to learning from streaming data, which arrive over...
Clustering is a fundamental task in many vision applications. To date, most clustering algorithms w...
In the era of big data, considerable research focus is being put on designing efficient algorithms c...
AbstractIn recent years, the data stream clustering problem has gained considerable attention in the...
The presence of very large data sets poses new problems to standard neural clustering and visualizat...
We introduce a set of clustering algorithms whose performance function is such that the algorithms o...
For clustering accuracy, on influx of data, the parameter-free incremental clustering research is es...
Part 1: AlgorithmsInternational audienceThe size, complexity and dimensionality of data collections ...
Part 7: AlgorithmsInternational audienceThe paper deals with the high dimensional data clustering pr...
International audienceWe propose an unsupervised online learning method based on the "growing neural...
AbstractIn dynamic information environments such as the web, the amount of information is rapidly in...
Clustering algorithms belong to major topics in big data analysis. Their main goal is to separate an...
Le travail de recherche exposé dans cette thèse concerne le développement d'approches à base de grow...
The research outlined in this thesis concerns the development of approaches based on growing neural ...
Challenges for clustering streaming data are getting continuously more sophisticated. This trend is ...
International audienceIncremental learning refers to learning from streaming data, which arrive over...
Clustering is a fundamental task in many vision applications. To date, most clustering algorithms w...
In the era of big data, considerable research focus is being put on designing efficient algorithms c...
AbstractIn recent years, the data stream clustering problem has gained considerable attention in the...
The presence of very large data sets poses new problems to standard neural clustering and visualizat...
We introduce a set of clustering algorithms whose performance function is such that the algorithms o...
For clustering accuracy, on influx of data, the parameter-free incremental clustering research is es...
Part 1: AlgorithmsInternational audienceThe size, complexity and dimensionality of data collections ...
Part 7: AlgorithmsInternational audienceThe paper deals with the high dimensional data clustering pr...