Scalable density-based clustering with quality guarantees using random projections

DOI10.1007/s10618-017-0498-xzbMath1411.62172OpenAlexW2592371352MaRDI QIDQ1741164

Xianqiang Yang

Publication date: 3 May 2019

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10618-017-0498-x

zbMATH Keywords

nearest neighborsdensity-based clusteringrandom projections

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Related Items (1)

A Detailed Study of the Distributed Rough Set Based Locality Sensitive Hashing Feature Selection Technique

Uses Software

• UCI-ml
• PROXIMUS
• DENCLUE

Cites Work

• Unnamed Item
• Two-level \(k\)-means clustering algorithm for \(k\)-\(\tau \) relationship establishment and linear-time classification
• Extensions of Lipschitz mappings into a Hilbert space
• Locality-sensitive hashing scheme based on p-stable distributions

This page was built for publication: Scalable density-based clustering with quality guarantees using random projections