6 Result(s)
-
Article
Open AccessEvolutionary Active Constrained Clustering for Obstructive Sleep Apnea Analysis
We introduce a novel interactive framework to handle both instance-level and temporal smoothness constraints for clustering large longitudinal data and for tracking the cluster evolutions over time. It consist...
-
Chapter and Conference Paper
Scalable Active Constrained Clustering for Temporal Data
In this paper, we introduce a novel interactive framework to handle both instance-level and temporal smoothness constraints for clustering large temporal data. It consists of a constrained clustering algorithm...
-
Chapter
Interactive Exploration of Subspace Clusters on Multicore Processors
The PreDeCon clustering algorithm finds arbitrarily shaped clusters in high-dimensional feature spaces, which remains an active research topic with many potential applications. However, it suffers from poor ru...
-
Chapter and Conference Paper
Interactive Exploration of Subspace Clusters for High Dimensional Data
PreDeCon is a fundamental clustering algorithm for finding arbitrarily shaped clusters hidden in high-dimensional feature spaces of data, which is an important research topic and has many potential application...
-
Chapter and Conference Paper
Anytime OPTICS: An Efficient Approach for Hierarchical Density-Based Clustering
OPTICS is a fundamental data clustering technique that has been widely applied in many fields. However, it suffers from performance degradation when faced with large datasets and expensive distance measures be...
-
Article
Anytime density-based clustering of complex data
Many clustering algorithms suffer from scalability problems on massive datasets and do not support any user interaction during runtime. To tackle these problems, anytime clustering algorithms are proposed. The...
