Introduction to clustering large and high-dimensional data.
From MaRDI portal
Recommendations
Cited in
(39)- High-dimensional data clustering
- A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set
- One-dimensional center-based l 1-clustering method
- Random walk distances in data clustering and applications
- Incremental method for multiple line detection problem -- iterative reweighted approach
- A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem
- The adaptation of the \(k\)-means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm.
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem
- On the added value of bootstrap analysis for K-means clustering
- Clustering large unstructured document sets
- Clustering large number of extragalactic spectra of galaxies and quasars through canopies
- A simple distribution-free algorithm for generating simulated high-dimensional correlated data with an autoregressive structure
- Data clustering for circle detection
- Wind farm portfolio optimization under network capacity constraints
- The challenges of clustering high dimensional data
- Grouping Multidimensional Data
- Cluster analysis for data mining and system identification.
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
- Strategic and tactical design of competing decentralized supply chain networks with risk-averse participants for markets with uncertain demand
- scientific article; zbMATH DE number 2010440 (Why is no real title available?)
- scientific article; zbMATH DE number 2069435 (Why is no real title available?)
- scientific article; zbMATH DE number 1792110 (Why is no real title available?)
- Modern algorithms of cluster analysis
- Interpretation and optimization of the \(k\)-means algorithm.
- A steepest descent-like method for variable order vector optimization problems
- Topological pattern recognition for point cloud data
- Clustering. Theoretical and practical aspects
- Mean field analysis of a spatial stochastic model of a gene regulatory network
- A steepest descent-like method for vector optimization problems with variable domination structure
- Data clustering with actuarial applications
- Searching for an optimal partition of incomplete data with application in modeling energy efficiency of public buildings
- Partitional clustering algorithms
- scientific article; zbMATH DE number 2205355 (Why is no real title available?)
- Center-based l₁-clustering method
- Fast cluster tendency assessment for big, high-dimensional data
- A method for searching for a globally optimal \(k\)-partition of higher-dimensional datasets
- Comparison between classification algorithms using a multiple correspondence analysis with Python
- Enhancing principal direction divisive clustering
This page was built for publication: Introduction to clustering large and high-dimensional data.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3444817)
