Probabilistic d-clustering

DOI10.1007/S00357-008-9002-ZzbMATH Open1260.62039OpenAlexW2056305270MaRDI QIDQ734358FDOQ734358

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

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

zbMATH Keywords

Mahalanobis distanceharmonic meanWeiszfeld methodsimilarity matrixjoint distance function

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (25)

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

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)