On Grouping for Maximum Homogeneity

From MaRDI portal
Publication:3252986

DOI10.2307/2281952zbMath0084.35904OpenAlexW4236708806MaRDI QIDQ3252986

Walter D. Fisher

Publication date: 1958

Full work available at URL: https://doi.org/10.2307/2281952




Related Items (61)

A shortest-route approach for optimum aggregation of data with an application to income dataDetecting clusters in the data from variance decompositions of its projectionsParsimonious treesApproximation by pseudo-linear operatorsPolynomial approximation schemes and exact algorithms for optimum curve segmentation problemsA survey of constrained classificationGroup adaptive stein estimation of normal meansMODL: a Bayes optimal discretization method for continuous attributesCluster differences scaling with a within-clusters loss component and a fuzzy successive approximation strategy to avoid local minimaPartitioning of sequentially ordered systems using linear programmingA data driven binning strategy for the construction of insurance tariff classesNonparametric K-means algorithm with applications in economic and functional dataLocalizing combinatorial properties of partitionsOptimal partitionsClustering on treesGlobal testing method for clustering means in ANOVAOn the complexity of redescription miningA combined hierarchical and steepest-descent clustering algorithmPTAS for \(p\)-means \(q\)-medoids \(r\)-given clustering problemMoving Up the Cluster Tree with the Gradient FlowOptimal change-point detection and localizationMinimax and adaptive tests for detecting abrupt and possibly transitory changes in a Poisson processOn the complexity of clustering with relaxed size constraints in fixed dimensionConsistent change-point detection with kernelsAnalyzing social media data having discontinuous underlying dynamicsDetecting multiple mean breaks at unknown points in official time seriesData Clustering with Actuarial ApplicationsOptimal Partitioning Which Maximizes the Weighted Sum of ProductsAlgorithms for the boundary selection problemAtheoretical regression trees for classifying risky financial institutionsWeak limit theorems for univariate \(k\)-mean clustering under a nonregular conditionAn optimal method for solving the (generalized) multi-Weber problemSphere-separable partitions of multi-parameter elementsUsing clustering to improve sales forecasts in retail merchandisingTaxicab correspondence analysisA Kernel Multiple Change-point Algorithm via Model SelectionFrequency-based views to pattern collectionsOptimal stratification and grouping by dynamic programmingA mixed-integer programming approach to the clustering problem with an application in customer segmentationUnnamed ItemA direct method for cluster analysisOrder-constrained solutions in \(K\)-means clustering: even better than being globally optimalFuzzy partition models for fitting a set of partitionsTree-structured modelling of categorical predictors in generalized additive regressionTree-Structured Clustering in Fixed Effects ModelsTime series modeling by a regression approach based on a latent processValidating clusters with the lower bound for sum-of-squares errorCluster generation and grouping using mathematical programmingRelating Amino Acid Sequence to Phenotype: Analysis of Peptide-Binding DataEasy NP-hardness Proofs of Some Subset Choice ProblemsClustering data with measurement errorsTree-structured scale effects in binary and ordinal regressionA higher order Hopfield network for vector quantisationNorm statistics and the complexity of clustering problemsOn the Complexity of Clustering with Relaxed Size ConstraintsK-means method for rough classification of R&D employees' performance evaluationA global algorithm to estimate the expectations of the components of an observed univariate mixtureAsymptotics for trimmed \(k\)-means and associated tolerance zones.Clustering to minimize the maximum intercluster distanceDynamic programming and convex clusteringVector dissimilarity and clustering




This page was built for publication: On Grouping for Maximum Homogeneity