A general framework for efficient clustering of large datasets based on activity detection

DOI10.1002/SAM.10097MaRDI QIDQ4969747zbMATH OpenOpenAlexFDO

Authors

Publication date 14 October 2020

Published in Statistical Analysis and Data Mining: The ASA Data Science Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/sam.10097

zbMATH Keywords

clusteringK-meanshierarchical clusteringKd-treeactivity detection

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 3567782 (Why is no real title available?)
• scientific article; zbMATH DE number 2205355 (Why is no real title available?)
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• 10.1162/153244303321897735
• A fast VQ codebook generation algorithm using codeword displacement
• A local search approximation algorithm for \(k\)-means clustering
• Clustering with Bregman divergences.
• Data mining. Concepts and techniques
• Finding Groups in Data
• Graph Clustering and Minimum Cut Trees
• Initializing \(K\)-means batch clustering: A critical evaluation of several techniques
• Least squares quantization in PCM
• Locality-sensitive hashing scheme based on \(p\)-stable distributions
• Multidimensional divide-and-conquer
• Principal component analysis.

Describes a project that uses

Uses Software

• ROCK

This page was built for publication: A general framework for efficient clustering of large datasets based on activity detection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969747)