Anytime parallel density-based clustering

DOI10.1007/s10618-018-0562-1zbMath1416.62351OpenAlexW2797642099WikidataQ130007240 ScholiaQ130007240MaRDI QIDQ1741415

Martin Storgaard Dieu, Ira Assent, Son T. Mai, Jon Jacobsen

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-018-0562-1

zbMATH Keywords

parallel processingdensity-based clusteringmulticore processorsactive clusteringanytime clustering

Mathematics Subject Classification ID

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

Related Items (3)

An exemplar-based clustering using efficient variational message passing ⋮ Mining weighted subgraphs in a single large graph ⋮ AnyDBC

Uses Software

• DBSCAN
• ADvaNCE
• HPDBSCAN
• MR-DBSCAN

Cites Work

• Multidimensional binary search trees used for associative searching
• On the Hardness and Approximation of Euclidean DBSCAN
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Anytime parallel density-based clustering