Pages that link to "Item:Q5754037"

The following pages link to Data Clustering: Theory, Algorithms, and Applications (Q5754037):

Displaying 50 items.

• Group contingency test for two or several independent samples (Q301010) (← links)
• Interpretable clustering using unsupervised binary trees (Q354178) (← links)
• Handwritten data clustering using agents competition in networks (Q385325) (← links)
• A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function (Q386486) (← links)
• Hierarchical data organization, clustering and denoising via localized diffusion folders (Q427062) (← links)
• A fast and recursive algorithm for clustering large datasets with \(k\)-medians (Q434902) (← links)
• Interpretation and optimization of the \(k\)-means algorithm. (Q464720) (← links)
• Fuzzy partition based soft subspace clustering and its applications in high dimensional data (Q497283) (← links)
• A new measure for comparing biomedical regions of interest in segmentation of digital images (Q499376) (← links)
• Improvements in retinal vessel clustering techniques: Towards the automatic computation of the arterio venous ratio (Q605051) (← links)
• SpectralCAT: categorical spectral clustering of numerical and nominal data (Q645872) (← links)
• High-dimensional disjoint factor analysis with its EM algorithm version (Q825338) (← links)
• Communicability graph and community structures in complex networks (Q833142) (← links)
• Finding cluster centers and sizes via multinomial parameterization (Q905340) (← links)
• Sparsest factor analysis for clustering variables: a matrix decomposition approach (Q1630876) (← links)
• Supplementary projections for the acceleration of Kaczmarz algorithm (Q1646081) (← links)
• Distance metric learning for soft subspace clustering in composite kernel space (Q1669787) (← links)
• Data filtering for cluster analysis by \(\ell _0\)-norm regularization (Q1686543) (← links)
• Properties of the sample estimators used for statistical normalization of feature vectors (Q1715923) (← links)
• Time series clustering via community detection in networks (Q1750414) (← links)
• Fast, linear time, \(m\)-adic hierarchical clustering for search and retrieval using the Baire metric, with linkages to generalized ultrametrics, hashing, formal concept analysis, and precision of data measurement (Q1760308) (← links)
• An equi-biased \(k\)-prototypes algorithm for clustering mixed-type data (Q1789116) (← links)
• One-dimensional center-based l 1-clustering method (Q1936788) (← links)
• Random walk distances in data clustering and applications (Q1947049) (← links)
• Application of data clustering and machine learning in variable annuity valuation (Q2015648) (← links)
• Analysis of communities of countries with similar dynamics of the COVID-19 pandemic evolution (Q2068815) (← links)
• Nonparametric bagging clustering methods to identify latent structures from a sequence of dependent categorical data (Q2084068) (← links)
• Neighborhood density information in clustering (Q2163854) (← links)
• A proposal to compare the similarity between musical products. One more step for automated plagiarism detection? (Q2165157) (← links)
• Clustered common factor exploration in factor analysis (Q2177741) (← links)
• \(k\)-means clustering of extremes (Q2180059) (← links)
• Reverse engineering of CAD models via clustering and approximate implicitization (Q2187364) (← links)
• On the properties of subsethood measures (Q2215032) (← links)
• Multi-way sparsest cut problem on trees with a control on the number of parts and outliers (Q2217481) (← links)
• Metacluster-based projective clustering ensembles (Q2260925) (← links)
• Tensor complementarity problems. III: Applications (Q2278880) (← links)
• Clustering video sequences by the method of harmonic \(k\)-means (Q2320254) (← links)
• A class of Laplacian multiwavelets bases for high-dimensional data (Q2343249) (← links)
• Valuation of large variable annuity portfolios under nested simulation: a functional data approach (Q2347065) (← links)
• Projective clustering ensembles (Q2377272) (← links)
• Density-ratio based clustering for discovering clusters with varying densities (Q2417842) (← links)
• A new biplot procedure with joint classification of objects and variables by fuzzy \(c\)-means clustering (Q2418397) (← links)
• James-Stein shrinkage to improve \(k\)-means cluster analysis (Q2445666) (← links)
• A convergence theorem for the fuzzy subspace clustering (FSC) algorithm (Q2476951) (← links)
• Two clustering methods based on the Ward's method and dendrograms with interval-valued dissimilarities for interval-valued data (Q2658038) (← links)
• Tverberg-type theorems with altered intersection patterns (nerves) (Q2664116) (← links)
• A quantization based codebook formation method of vector quantization algorithm to improve the compression ratio while preserving the visual quality of the decompressed image (Q2688017) (← links)
• On the parameterized complexity of clustering problems for incomplete data (Q2689366) (← links)
• Summarization and Search Over Geometric Spaces (Q2807067) (← links)
• MANOVA, LDA, and FA criteria in clusters parameter estimation (Q2813506) (← links)