Probabilistic d-clustering
From MaRDI portal
Publication:734358
DOI10.1007/s00357-008-9002-zzbMath1260.62039MaRDI QIDQ734358
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
62H30: Classification and discrimination; cluster analysis (statistical aspects)
Related Items
A PROBABILISTIC ℓ1 METHOD FOR CLUSTERING HIGH-DIMENSIONAL DATA, Boosted-oriented probabilistic smoothing-spline clustering of series, Quantile-based clustering, Classification of multivariate objects using interval quantile classes, A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances, Probabilistic d-clustering, A generalized Weiszfeld method for the multi-facility location problem, Contour approximation of data: a duality theory, One-dimensional center-based l 1-clustering method, Adjusted concordance index: an extensionl of the adjusted rand index to fuzzy partitions, \(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, The \(\delta \)-machine: classification based on distances towards prototypes, The importance of being clustered: uncluttering the trends of statistics from 1970 to 2015, Factor probabilistic distance clustering (FPDC): a new clustering method, The planar hub location problem: a probabilistic clustering approach, A Parametric Version of Probabilistic Distance Clustering
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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