Probabilistic d-clustering

DOI10.1007/S00357-008-9002-ZMaRDI QIDQ734358zbMATH OpenOpenAlexFDO

Authors 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

Mahalanobis distanceharmonic meanWeiszfeld methodsimilarity matrixjoint distance function

Mathematics Subject Classification ID

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

Recommendations

• PROBABILISTIC DISTANCE CLUSTERING ADJUSTED FOR CLUSTER SIZE
• scientific article; zbMATH DE number 1313702
• A new approach to clustering
• A probabilistic theory of clustering
• Probabilistic clustering via Pareto solutions and significance tests

Cites work

• scientific article; zbMATH DE number 5957421 (Why is no real title available?)
• scientific article; zbMATH DE number 3793445 (Why is no real title available?)
• scientific article; zbMATH DE number 41467 (Why is no real title available?)
• scientific article; zbMATH DE number 3579840 (Why is no real title available?)
• scientific article; zbMATH DE number 4123493 (Why is no real title available?)
• scientific article; zbMATH DE number 1385870 (Why is no real title available?)
• A generalized Weiszfeld method for the multi-facility location problem
• A note on Fermat's problem
• Contour approximation of data and the harmonic mean
• Contour approximation of data: a duality theory
• Geometric representation of association between categories
• On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
• PROBABILISTIC DISTANCE CLUSTERING ADJUSTED FOR CLUSTER SIZE
• Probabilistic d-clustering

Cited in

(25)

• The \(\delta \)-machine: classification based on distances towards prototypes
• \(k\)-means, Ward and probabilistic distance-based clustering methods with contiguity constraint
• A generalized Weiszfeld method for the multi-facility location problem
• The planar hub location problem: a probabilistic clustering approach
• Adjusted concordance index: an extensionl of the adjusted rand index to fuzzy partitions
• Advances in Intelligent Data Analysis VI
• Two-size probability-changing cluster algorithm
• The importance of being clustered: uncluttering the trends of statistics from 1970 to 2015
• Boosted-oriented probabilistic smoothing-spline clustering of series
• A parametric version of probabilistic distance clustering
• On the construction of an aggregated measure of the development of interval data
• Penalized Probabilistic Clustering
• A probabilistic clustering method for data elements with normal distributed attributes
• Contour approximation of data: a duality theory
• Quantile-based clustering
• Probabilistic clustering of time-evolving distance data
• Factor probabilistic distance clustering (FPDC): a new clustering method
• A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances
• PROBABILISTIC DISTANCE CLUSTERING ADJUSTED FOR CLUSTER SIZE
• Probabilistic clustering via Pareto solutions and significance tests
• Classification of multivariate objects using interval quantile classes
• One-dimensional center-based l 1-clustering method
• Probabilistic d-clustering
• PCT – a technique to probe cluster terrain
• A PROBABILISTIC ℓ₁ METHOD FOR CLUSTERING HIGH-DIMENSIONAL DATA

This page was built for publication: Probabilistic d-clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734358)