Clustering of high dimensional data streams
Date
2012Sujet
Résumé
Clustering of data streams has become a task of great interest in the recent years as such data formats is are becoming increasingly ambiguous. In many cases, these data are also high dimensional and in result more complex for clustering. As such there is a growing need for algorithms that can be applied on streaming data and the at same time can cope with high dimensionality. To this end, here we design a streaming clustering approach by extending a recently proposed high dimensional clustering algorithm. © 2012 Springer-Verlag.
Collections
Related items
Showing items related by title, author, creator and subject.
-
Nonlinear dimensionality reduction for clustering
(2020)We introduce an approach to divisive hierarchical clustering that is capable of identifying clusters in nonlinear manifolds. This approach uses the isometric mapping (Isomap) to recursively embed (subsets of) the data in ... -
Improving Hierarchical Short Text Clustering through Dominant Feature Learning
(2022)This paper focuses on the popular problem of short text clustering. Since the short text documents typically exhibit high degrees of data sparseness and dimensionality, the problem in question is generally considered more ... -
Enhancing Clustering of Single-Cell RNA-Seq Data by Proximity Learning on Random Projected Spaces
(2019)We are in the era of single-cell RNA sequencing technology, which offers a great potential for uncovering cellular differences with a higher resolution, shedding light in various complex biological processes and complex ...