Probabilistic d-clustering

DOI10.1007/s00357-008-9002-zzbMath1260.62039OpenAlexW2056305270MaRDI QIDQ734358

Adi Ben-Israel, Cem Iyigun

Publication date: 13 October 2009

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00357-008-9002-z

zbMATH Keywords

harmonic meanWeiszfeld methodMahalanobis distancesimilarity matrixjoint distance function

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Related Items

A PROBABILISTIC ℓ₁ METHOD FOR CLUSTERING HIGH-DIMENSIONAL DATA, A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances, Factor probabilistic distance clustering (FPDC): a new clustering method, Boosted-oriented probabilistic smoothing-spline clustering of series, One-dimensional center-based l 1-clustering method, The planar hub location problem: a probabilistic clustering approach, A Parametric Version of Probabilistic Distance Clustering, \(k\)-means, Ward and probabilistic distance-based clustering methods with contiguity constraint, On the construction of an aggregated measure of the development of interval data, A generalized Weiszfeld method for the multi-facility location problem, Quantile-based clustering, Probabilistic d-clustering, Adjusted concordance index: an extensionl of the adjusted rand index to fuzzy partitions, Contour approximation of data: a duality theory, The \(\delta \)-machine: classification based on distances towards prototypes, The importance of being clustered: uncluttering the trends of statistics from 1970 to 2015, Classification of multivariate objects using interval quantile classes

Cites Work

• Probabilistic d-clustering
• A generalized Weiszfeld method for the multi-facility location problem
• Contour approximation of data: a duality theory
• Geometric representation of association between categories
• Contour approximation of data and the harmonic mean
• PROBABILISTIC DISTANCE CLUSTERING ADJUSTED FOR CLUSTER SIZE
• On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
• A note on Fermat's problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item