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

DOI10.1002/SAM.10097OpenAlexW2064001834MaRDI QIDQ4969747FDOQ4969747

Author name not available (Why is that?)

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

• Finding Groups in Data
• Principal component analysis.
• Title not available (Why is that?)
• Least squares quantization in PCM
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 10.1162/153244303321897735
• Multidimensional divide-and-conquer
• Initializing \(K\)-means batch clustering: A critical evaluation of several techniques
• Data mining. Concepts and techniques
• Graph Clustering and Minimum Cut Trees
• Locality-sensitive hashing scheme based on p-stable distributions
• A local search approximation algorithm for k-means clustering
• A fast VQ codebook generation algorithm using codeword displacement

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)