Two-level \(k\)-means clustering algorithm for \(k\)-\(\tau \) relationship establishment and linear-time classification

DOI10.1016/j.patcog.2009.09.019zbMath1187.68439OpenAlexW1967259944MaRDI QIDQ2654244

M. Narasimha Murty, Radha Chitta

Publication date: 15 January 2010

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2009.09.019

zbMATH Keywords

classificationclusteringsupport vector machines\(k\)-meanslinear-time complexity\(k\)-nearest neighbor classifier

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (1)

Scalable density-based clustering with quality guarantees using random projections

Uses Software

• SVMlight

Cites Work

• Least squares quantization in PCM
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two-level \(k\)-means clustering algorithm for \(k\)-\(\tau \) relationship establishment and linear-time classification