scientific article

Publication date: 18 December 2014

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

k-POD: A Method for k-Means Clustering of Missing Data, FCA2VEC: Embedding Techniques for Formal Concept Analysis, Unnamed Item, Unnamed Item, Unnamed Item, Improving K-means method via shrinkage estimation and LVQ algorithm, One-pass additive-error subset selection for $\ell_p$ subspace approximation and $(k, p)$-clustering, Approximation Algorithms for Matroid and Knapsack Means Problems, Approximation Algorithms for Spherical k-Means Problem with Penalties Using Local Search Techniques, PC-GAIN: pseudo-label conditional generative adversarial imputation networks for incomplete data, Modeling and solving the endpoint cutting problem, A competitive optimization approach for data clustering and orthogonal non-negative matrix factorization, Determinantal consensus clustering, GROUPED VARIATION IN FACTOR SHARES: AN APPLICATION TO MISALLOCATION, Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND, Clustering High-Dimensional Data via Feature Selection, The provably good parallel seeding algorithms for the k‐means problem with penalties, SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering, Semi-supervised k-means++, Deflation techniques applied on mixed model equations, Stress-related topology optimization with multilevel smoothed isogeometric densities and Bézier elements, Band depth based initialization of K-means for functional data clustering, A framework for the generation of complex scenario instances in the Urban Transit Routing Problem, Topics in robust statistical learning, On the discrepancy between Kleinberg's clustering axioms and $k$-means clustering algorithm behavior, Also for $k$-means: more data does not imply better performance, Clustering directional data through depth functions, Strategic oscillation for the balanced minimum sum-of-squares clustering problem, Efficient Error and Variance Estimation for Randomized Matrix Computations, DDCAL: evenly distributing data into low variance clusters based on iterative feature scaling, Gaussian mixture models for clustering and calibration of ensemble weather forecasts, A novel optimization approach towards improving separability of clusters, A Spectral Method for Joint Community Detection and Orthogonal Group Synchronization, Clustering multivariate count data via Dirichlet-multinomial network fusion, Approximation schemes for $k$-facility location, A rank-size approach to analyse soccer competitions and teams: the case of the Italian football league ``Serie A, A comparison of methods for clustering longitudinal data with slowly changing trends, A fast epigraph and hypograph-based approach for clustering functional data, Structured filtering, Community structure recovery and interaction probability estimation for gossip opinion dynamics, Decision support for the technician routing and scheduling problem, A semi brute-force search approach for (balanced) clustering, GLIMG: global and local item graphs for top-N recommender systems, Quantum clustering with $k$-means: a hybrid approach, Testing for Unobserved Heterogeneity via k-means Clustering, Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms, Tensor envelope mixture model for simultaneous clustering and multiway dimension reduction, An Initialization Method Based on Hybrid Distance for k-Means Algorithm, A Nonparametric Clustering Algorithm with a Quantile-Based Likelihood Estimator, Efficient Simulation Designs for Valuation of Large Variable Annuity Portfolios, Noisy, Greedy and Not so Greedy k-Means++, The Parallel Seeding Algorithm for k-Means Problem with Penalties, The fast clustering algorithm for the big data based on K-means, A Kernel Embedding–Based Approach for Nonstationary Causal Model Inference, A unified framework of FPT approximation algorithms for clustering problems, Core–periphery structure in directed networks, FPT Approximation for Constrained Metric k-Median/Means, The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems, Partitioning Well-Clustered Graphs: Spectral Clustering Works!, On coresets for support vector machines, Unnamed Item, Metric for attractor overlap, Unnamed Item, Cessation and reversals of large-scale structures in square Rayleigh–Bénard cells, Failure Probability Estimation of Linear Time Varying Systems by Progressive Refinement of Reduced Order Models, Unnamed Item, Mean-field theory of graph neural networks in graph partitioning, Unnamed Item, A Dimension Reduction Technique for Large-Scale Structured Sparse Optimization Problems with Application to Convex Clustering, Spherical k-Means++ Clustering, Robust Bregman clustering, Point clustering via voting maximization, A refined approximation for Euclidean $k$-means, Quantum annealing for combinatorial clustering, Tight lower bound instances for $k$-means++ in two dimensions, Stable estimation of a covariance matrix guided by nuclear norm penalties, Unsupervised image segmentation with Gaussian pairwise Markov fields, Generalized $k$-means in GLMs with applications to the outbreak of COVID-19 in the United States, Equi-Clustream: a framework for clustering time evolving mixed data, Stochastic backward Euler: an implicit gradient descent algorithm for $k$-means clustering, Consolidating home meal delivery with limited operational disruption, Pro-active real-time routing in applications with multiple request patterns, A method for K-means seeds generation applied to text mining, Strategyproof facility location for concave cost functions, Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design, Comparison of internal clustering validation indices for prototype-based clustering, A simple approach to sparse clustering, Angle-based models for ranking data, A spectral algorithm with additive clustering for the recovery of overlapping communities in networks, Probably certifiably correct $k$-means clustering, A bad instance for \texttt{k-means++}, A quantization framework for smoothed analysis of Euclidean optimization problems, Texture segmentation using independent-scale component-wise Riemannian-covariance Gaussian mixture model in KL measure based multi-scale nonlinear structure tensor space, Maximum likelihood estimation of Gaussian mixture models using stochastic search, Analysing microarray expression data through effective clustering, The planar $k$-means problem is NP-hard, Orphan-free anisotropic Voronoi diagrams, Simplification and hierarchical representations of mixtures of exponential families, SpectralCAT: categorical spectral clustering of numerical and nominal data, Size matters: choosing the most informative set of window lengths for mining patterns in event sequences, Solution path clustering with adaptive concave penalty, Adaptive initialization method based on spatial local information for $k$-means algorithm, An overview of multiple sequence alignments and cloud computing in bioinformatics, Applied harmonic analysis and data processing. Abstracts from the workshop held March 25--31, 2018, A simple $D^2$-sampling based PTAS for $k$-means and other clustering problems, Two-stage portfolio optimization with higher-order conditional measures of risk, Approximation algorithms for fuzzy $C$-means problem based on seeding method, Graph summarization with quality guarantees, Discovering recurring activity in temporal networks, An efficient $K$-means clustering algorithm for tall data, A clustering method for data in cylindrical coordinates, Variational image restoration and segmentation with Rician noise, Distributed consensus-based $K$-means algorithm in switching multi-agent networks, Clustering stability-based evolutionary K-means, An approximation ratio for biclustering, Cross-entropy clustering, An improved Bregman $k$-means++ algorithm via local search, Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design, Non-local spatially varying finite mixture models for image segmentation, Minimax and Minimax Projection Designs Using Clustering, Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs, The spherical $k$-means++ algorithm via local search, Local search algorithm for the spherical $k$-means problem with outliers, A bi-criteria analysis for fuzzy $C$-means problem, Clustering of measures via mean measure quantization, NP-hardness of Euclidean sum-of-squares clustering, Interpretable clustering: an optimization approach, Bayesian optimization with approximate set kernels, Quick-means: accelerating inference for K-means by learning fast transforms, Convex programming based spectral clustering, Big data time series forecasting based on pattern sequence similarity and its application to the electricity demand, Extreme clustering -- a clustering method via density extreme points, Data clustering via cooperative games: a novel approach and comparative study, Differential algebra-based multiple Gaussian particle filter for orbit determination, Objective function-based rough membership C-means clustering, Compositional convolutional neural networks: a robust and interpretable model for object recognition under occlusion, Distance preserving model order reduction of graph-Laplacians and cluster analysis, Learning quantities of interest from dynamical systems for observation-consistent inversion, A review on suppressed fuzzy c-means clustering models, k-means++, Three kinds of discrete approximations of statistical multivariate distributions and their applications, Implicit consensus clustering from multiple graphs, A Riemannian Newton trust-region method for fitting Gaussian mixture models, Joint optimization of an autoencoder for clustering and embedding, An empirical comparison between stochastic and deterministic centroid initialisation for K-means variations, K-bMOM: A robust Lloyd-type clustering algorithm based on bootstrap median-of-means, Phase distribution and properties identification of heterogeneous materials: a data-driven approach, A multiscale environment for learning by diffusion, The approximation algorithm based on seeding method for functional $k$-means problem, Clustering on the torus by conformal prediction, Binary whale optimization algorithm and binary moth flame optimization with clustering algorithms for clinical breast cancer diagnoses, Improving a centroid-based clustering by using suitable centroids from another clustering, An ensemble feature ranking algorithm for clustering analysis, Deep learning and k-means clustering in heterotic string vacua with line bundles, An efficient $k$-means clustering filtering algorithm using density based initial cluster centers, The bi-criteria seeding algorithms for two variants of $k$-means problem, An approximation algorithm for the uniform capacitated $k$-means problem, The seeding algorithm for spherical $k$-means clustering with penalties, Scalable Bayesian preference learning for crowds, The spherical $k$-means++ algorithm via local search scheme, An approximation algorithm for the spherical $k$-means problem with outliers by local search, Improved local search algorithms for Bregman $k$-means and its variants, Data-driven modeling of the temporal evolution of breakers' states in the French electrical transmission grid, An extension of K-means for least-squares community detection in feature-rich networks, Dissecting graph measure performance for node clustering in LFR parameter space, Approximation algorithm for spherical $k$-means problem with penalty, Clustering by quantum annealing on the three-level quantum elements qutrits, Improved approximation algorithms for solving the squared metric $k$-facility location problem, K-means clustering via a nonconvex optimization approach, Learning 3D semantic scene graphs with instance embeddings, Experimental data-based reduced-order model for analysis and prediction of flame transition in gas turbine combustors, Fast indefinite multi-point (IMP) clustering, Automated knowledge-assisted mitosis cells detection framework in breast histopathology images, Iterative algorithm for discrete structure recovery, Efficient binary embedding of categorical data using BinSketch, An improved primal-dual approximation algorithm for the k-means problem with penalties, Local Versions of Sum-of-Norms Clustering, Model-based hierarchical clustering with Bregman divergences and Fishers mixture model: application to depth image analysis, Clustering with or without the approximation, Using expert's rules as background knowledge in the ClusDM methodology, An improved approximation algorithm for squared metric $k$-facility location, Strategyproof facility location in perturbation stable instances, A novel heuristic algorithm to solve penalized regression-based clustering model, Approximation algorithms for two variants of correlation clustering problem, A new initialization and performance measure for the rough $k$-means clustering, A novel prediction method of complex univariate time series based on $k$-means clustering, Fuzzy clustering: more than just fuzzification, Unnamed Item, Unnamed Item, An exemplar-based clustering using efficient variational message passing, On strategies to fix degenerate $k$-means solutions, Compressive statistical learning with random feature moments, Statistical learning guarantees for compressive clustering and compressive mixture modeling, Model assisted variable clustering: minimax-optimal recovery and algorithms, A matheuristic for large-scale capacitated clustering, A learning based algorithm for drone routing, On the $k$-means/median cost function, Lagrange dual bound computation for stochastic service network design, Functional data clustering via hypothesis testing $k$-means, Dense traffic flow patterns mining in bi-directional road networks using density based trajectory clustering, An exact algorithm for semi-supervised minimum sum-of-squares clustering, An alternative to EM for Gaussian mixture models: batch and stochastic Riemannian optimization, Emulation of high-performance correlation-based quantum clustering algorithm for two-dimensional data on FPGA, A rough-and-ready cluster-based approach for extracting finite-time coherent sets from sparse and incomplete trajectory data, Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering, Hierarchical means clustering, Landmark diffusion maps (L-dMaps): accelerated manifold learning out-of-sample extension, Improved PTAS for the constrained $k$-means problem, Unnamed Item, Efficient, certifiably optimal clustering with applications to latent variable graphical models, Unsupervised learning by cluster quality optimization, Global optimality in $k$-means clustering, Bayesian nonparametric priors for hidden Markov random fields, Modifications of the two-stage transportation problem and their applications, Unnamed Item, Improvement of the fast clustering algorithm improved by $K$-means in the big data, Consensus rate-based label propagation for semi-supervised classification, Unnamed Item, Realization of multi-input/multi-output switched linear systems from Markov parameters, Fast construction of correcting ensembles for legacy artificial intelligence systems: algorithms and a case study, Reduction of multivariate mixtures and its applications, $k$-means genetic algorithms with greedy genetic operators, Embedding-based silhouette community detection, Switching behaviour in vascular smooth muscle cell-matrix adhesion during oscillatory loading, Model-free inference of diffusion networks using RKHS embeddings, A constant FPT approximation algorithm for hard-capacitated $k$-means, Approximation algorithms for spherical $k$-means problem using local search scheme, Approximate Clustering with Same-Cluster Queries, Sampling-based dimension reduction for subspace approximation with outliers, Analytical and Numerical Evaluation of the Suppressed Fuzzy C-Means Algorithm, A Clustering Approach to Constrained Binary Matrix Factorization, A Streaming Algorithm for k-Means with Approximate Coreset, Kantorovich–Rubinstein Distance Minimization: Application to Location Problems, A Family of Unsupervised Sampling Algorithms, Approximating Spectral Clustering via Sampling: A Review, Local Search Yields a PTAS for $k$-Means in Doubling Metrics, Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization, Sparse convex hull coverage, Non-convex clustering via proximal alternating linearized minimization method, Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering, Initializing $k$-means clustering by bootstrap and data depth, A Bad Instance for k-Means++, Curve approximation by $G^1$ arc splines with a limited number of types of curvature and length, Unnamed Item, An incremental nonsmooth optimization algorithm for clustering using $L_1$ and $L_\infty$ norms, Learning what is where from unlabeled images: joint localization and clustering of foreground objects, A framework to uncover multiple alternative clusterings, Unnamed Item, On semi-supervised active clustering of stable instances with oracles, The Planar k-Means Problem is NP-Hard, Hybrid Wasserstein distance and fast distribution clustering, The seeding algorithm for $k$-means problem with penalties, Decomposition/Aggregation K-means for Big Data, Topology: a theory of a pseudometric-based clustering model and its application in content-based image retrieval, Clustered exact Daum-Huang particle flow filter, Clustering in Hilbert’s Projective Geometry: The Case Studies of the Probability Simplex and the Elliptope of Correlation Matrices, A unified framework for clustering constrained data without locality property, Randomization methods for assessing data analysis results on real‐valued matrices, An efficient k‐means‐type algorithm for clustering datasets with incomplete records, The seeding algorithms for spherical $k$-means clustering, Heterogeneous distributed big data clustering on sparse grids, Analysis of spectral clustering algorithms for community detection: the general bipartite setting, Approximation Algorithms for Tensor Clustering, Partial recovery bounds for clustering with the relaxed $K$-means, A self-organizing predictive map for non-life insurance, Optimizing MSE for clustering with balanced size constraints, Unnamed Item, Unnamed Item, $k$-means++ under approximation stability, Cluster-based hierarchical network model of the fluidic pinball – cartographing transient and post-transient, multi-frequency, multi-attractor behaviour