scientific article; zbMATH DE number 3800808

MaRDI QIDQ4745160zbMATH OpenFDO

Authors

Publication date 1981

zbMATH Keywords

analyses of three real data setsautomated methodscollection of clustering proceduresgeneral algorithmgeometrical classification methodshierarchical methodspartitioning methods of cluster analysis

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to statistics (62-01) Research exposition (monographs, survey articles) pertaining to statistics (62-02) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cited in

(44)

• An algorithm for the recognition of levels of congestion in road traffic problems
• Parsimonious trees
• Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data
• Measuring the influence of individual data points in a cluster analysis.
• Minimizing deviations from the group mean: A new linear programming approach for the two-group classification problem
• A Monte Carlo evaluation of the moving method, \(k\)-means and two self-organising neural networks
• On the number of clusters
• A survey of constrained classification
• Cluster differences scaling with a within-clusters loss component and a fuzzy successive approximation strategy to avoid local minima
• Cluster analysis and mathematical programming
• Clustering on trees
• Latent profile analysis with nonnormal mixtures: a Monte Carlo examination of model selection using fit indices
• Clustering approach in maintenance of capillary railway network
• Web document clustering using hyperlink structures
• Weighting and selection of variables for cluster analysis
• The Kohonen self-organizing map method: An assessment
• Multi-threshold accelerated failure time model
• Detecting multiple outliers in linear regression using a cluster method combined with graphical visualization
• On fractionally-supervised classification: weight selection and extension to the multivariate t-distribution
• Espaliers: A generalization of dendrograms
• Optimization on Lie manifolds and pattern recognition
• Model-based clustering
• Hierarchical means clustering
• The lattices of Moore families and closure operators on a finite set: A survey
• The generic subspace clustering model
• Sequential clustering with radius and split criteria
• Maximum likelihood estimation of a multi-dimensional log-concave density. With discussion and authors' reply
• On mathematical modelling of synthetic measures
• Ultrametricity of dissimilarity spaces and its significance for data mining
• Minimum sum of diameters clustering
• Maximum sum-of-splits clustering
• Identifying genuine clusters in a classification
• Variable neighborhood search: Principles and applications
• A projection pursuit approach to variable selection.
• Approaches to visualization in bioinformatics: From dendrograms to space explorer
• Distance Metrics and Clustering Methods for Mixed‐type Data
• The first subquadratic algorithm for complete linkage clustering
• An experimental evaluation of neural networks for classification
• A graphical chain model for inferring regulatory system networks from gene expression profiles
• Beyond preference information based multiple criteria decision making
• Set partition by globally optimized cluster seed points
• Ordinal and percentile clustering
• Arrangements of minimal variance -- multidimensional scaling in the symmetrical case
• Experiments in projection and clustering by simulated annealing

This page was built for publication:

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