scientific article; zbMATH DE number 2205355
From MaRDI portal
Publication:5316730
zbMath1083.68099MaRDI QIDQ5316730
Publication date: 15 September 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30) Data structures (68P05)
Related Items (37)
Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization ⋮ On Operations Research and Statistics Techniques: Keys to Quantitative Data Mining ⋮ A method for K-means seeds generation applied to text mining ⋮ Qualitative modeling of dynamical systems employing continuous-time recurrent fuzzy systems ⋮ Iterative denoising ⋮ Variance-based cluster selection criteria in a \(K\)-means framework for one-mode dissimilarity data ⋮ On the parameterized complexity of clustering problems for incomplete data ⋮ Finding cluster centers and sizes via multinomial parameterization ⋮ Complexity evaluation of benchmark instances for the \(p\)-median problem ⋮ Variable neighborhood search for harmonic means clustering ⋮ Statistical measures of two dimensional point set uniformity ⋮ Properties of the sample estimators used for statistical normalization of feature vectors ⋮ Book review of: J. Kogan, Introduction to clustering large and high-dimensional data ⋮ Monitoring threshold functions over distributed data streams with node dependent constraints ⋮ Using projection-based clustering to find distance- and density-based clusters in high-dimensional data ⋮ Unsupervised modelling of a transitional boundary layer ⋮ Biclustering meets triadic concept analysis ⋮ A convergence theorem for the fuzzy subspace clustering (FSC) algorithm ⋮ Clustering and maximum likelihood search for efficient statistical classification with medium-sized databases ⋮ Improving spectral bounds for clustering problems by Lagrangian relaxation ⋮ A new clustering algorithm for coordinate-free data ⋮ Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression ⋮ Swarm intelligence for self-organized clustering ⋮ The majority decision function for trees with 3 leaves ⋮ SEP/COP: an efficient method to find the best partition in hierarchical clustering based on a new cluster validity index ⋮ Candidate groups search for K-harmonic means data clustering ⋮ Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal ⋮ Pattern analysis in parallel coordinates based on pairwise comparison of parameters ⋮ VNSOptClust: A Variable Neighborhood Search Based Approach for Unsupervised Anomaly Detection ⋮ A general framework for efficient clustering of large datasets based on activity detection ⋮ DIVCLUS-T: a monothetic divisive hierarchical clustering method ⋮ Degeneracy on K-means clustering ⋮ Symmetry in data mining and analysis: a unifying view based on hierarchy ⋮ Feature relevance in Ward's hierarchical clustering using the \(L_p\) norm ⋮ Selecting the Minkowski Exponent for Intelligent K-Means with Feature Weighting ⋮ Thinking Ultrametrically, Thinking p-Adically ⋮ Intelligent choice of the number of clusters in \(K\)-means clustering: an experimental study with different cluster spreads
Uses Software
This page was built for publication:
