Heterogeneous distributed big data clustering on sparse grids
From MaRDI portal
Recommendations
- Elephant against Goliath: performance of big data versus high-performance computing DBSCAN clustering implementations
- A distributed framework for trimmed kernel \(k\)-means clustering
- scientific article; zbMATH DE number 5540352
- DGDCT: A Distributed Grid-Density Based Algorithm for Intrinsic Cluster Detection over Massive Spatial Data
- The fast clustering algorithm for the big data based on K-means
Cites work
- A local search approximation algorithm for \(k\)-means clustering
- A new subspace-based algorithm for efficient spatially adaptive sparse grid regression, classification and multi-evaluation
- Finite element thin plate splines in density estimation
- From data to uncertainty: an efficient integrated data-driven sparse grid approach to propagate uncertainty
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 3168214 (Why is no real title available?)
- Locality-sensitive hashing scheme based on p-stable distributions
- Spatially adaptive sparse grids for high-dimensional data-driven problems
Cited in
(4)- A distributed framework for trimmed kernel \(k\)-means clustering
- Fast sparse grid operations using the unidirectional principle: a generalized and unified framework
- UP-DPC: ultra-scalable parallel density peak clustering
- Deep FC-IIWO fuzzy clustering: an optimized fuzzy clustering approach for big data clustering
This page was built for publication: Heterogeneous distributed big data clustering on sparse grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2312425)