A PROBABILISTIC ℓ1 METHOD FOR CLUSTERING HIGH-DIMENSIONAL DATA

DOI10.1017/S0269964820000479MaRDI QIDQ5051179

Adi Ben-Israel, Tsvetan Asamov

Publication date: 22 November 2022

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.01294

zbMATH Keywords

clusteringcontinuous locationhigh-dimensional data\(\ell_1\)-norm

Mathematics Subject Classification ID

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

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matlab
• Probabilistic d-clustering
• A generalized Weiszfeld method for the multi-facility location problem
• Weiszfeld's method: old and new results
• On the Complexity of Some Common Geometric Location Problems
• Contour approximation of data and the harmonic mean
• PROBABILISTIC DISTANCE CLUSTERING ADJUSTED FOR CLUSTER SIZE
• Smooth interpolation of large sets of scattered data
• The Distribution of Distance in a Hypersphere

This page was built for publication: A PROBABILISTIC ℓ₁ METHOD FOR CLUSTERING HIGH-DIMENSIONAL DATA