scientific article; zbMATH DE number 2205355
From MaRDI portal
Publication:5316730
Recommendations
Cited in
(48)- DIVCLUS-T: a monothetic divisive hierarchical clustering method
- Symmetry in data mining and analysis: a unifying view based on hierarchy
- Variance-based cluster selection criteria in a \(K\)-means framework for one-mode dissimilarity data
- Properties of the sample estimators used for statistical normalization of feature vectors
- Monitoring threshold functions over distributed data streams with node dependent constraints
- Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression
- Candidate groups search for K-harmonic means data clustering
- Using projection-based clustering to find distance- and density-based clusters in high-dimensional data
- Biclustering meets triadic concept analysis
- The majority decision function for trees with 3 leaves
- Pattern analysis in parallel coordinates based on pairwise comparison of parameters
- Feature relevance in Ward's hierarchical clustering using the L_p norm
- A convergence theorem for the fuzzy subspace clustering (FSC) algorithm
- Intelligent choice of the number of clusters in K-means clustering: an experimental study with different cluster spreads
- On the parameterized complexity of clustering problems for incomplete data
- Degeneracy on \(K\)-means clustering
- Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization
- Advances in k-means clustering. A data mining thinking.
- On Operations Research and Statistics Techniques: Keys to Quantitative Data Mining
- Clustering. A data recovery approach.
- A method for K-means seeds generation applied to text mining
- Cluster analysis for data mining and system identification.
- scientific article; zbMATH DE number 5343759 (Why is no real title available?)
- VNSOptClust: A Variable Neighborhood Search Based Approach for Unsupervised Anomaly Detection
- Statistical measures of two dimensional point set uniformity
- Book review of: J. Kogan, Introduction to clustering large and high-dimensional data
- Improving spectral bounds for clustering problems by Lagrangian relaxation
- A general framework for efficient clustering of large datasets based on activity detection
- Unsupervised modelling of a transitional boundary layer
- Clustering and maximum likelihood search for efficient statistical classification with medium-sized databases
- Selecting the Minkowski exponent for intelligent K-means with feature weighting
- Thinking ultrametrically, thinking p-adically
- Qualitative modeling of dynamical systems employing continuous-time recurrent fuzzy systems
- Iterative denoising
- Complexity evaluation of benchmark instances for the \(p\)-median problem
- Variable neighborhood search for harmonic means clustering
- Distance-based clustering of mixed data
- A model-based approach for clustering of multivariate semicontinuous data with application to dietary pattern analysis and intervention
- Scalable Clustering: Large Scale Unsupervised Learning of Gaussian Mixture Models with Outliers
- From data completion to problems on hypercubes: a parameterized analysis of the independent set problem
- From data completion to problems on hypercubes: a parameterized analysis of the independent set problem
- Tunnel clustering method
- Leveraging big data and crowdsourced data as auxiliary variables and clustering analysis to enhance the quality of small area estimation models
- Swarm intelligence for self-organized clustering
- Finding cluster centers and sizes via multinomial parameterization
- A new clustering algorithm for coordinate-free data
- SEP/COP: an efficient method to find the best partition in hierarchical clustering based on a new cluster validity index
- Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal
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 Q5316730)
