Center-based l1–clustering method
From MaRDI portal
Publication:5494418
DOI10.2478/amcs-2014-0012zbMath1292.62097MaRDI QIDQ5494418
Publication date: 28 July 2014
Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/amcs-2014-0012
62H30: Classification and discrimination; cluster analysis (statistical aspects)
Related Items
The next‐generation K‐means algorithm, Uniform distribution width estimation from data observed with Laplace additive error, Data mining methods for gene selection on the basis of gene expression arrays, Building the library of RNA 3D nucleotide conformations using the clustering approach, Pattern layer reduction for a generalized regression neural network by using a self-organizing map
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
- A clustering method based on the \(L_ 1\)-norm
- Fast modified global \(k\)-means algorithm for incremental cluster construction
- Searching for a best least absolute deviations solution of an overdetermined system of linear equations motivated by searching for a best least absolute deviations hyperplane on the basis of given data
- Improve robustness of sparse PCA by \(L_{1}\)-norm maximization
- Three points method for searching the best least absolute deviations plane
- L\({}_ 1\)-norm based fuzzy clustering
- A review of recent advances in global optimization
- Additive scaling and the \texttt{DIRECT} algorithm
- Weighted median algorithms for \(L_ 1\) approximation
- A toolbox for \(K\)-centroids cluster analysis
- \(L_1\) cluster analysis
- Lipschitzian optimization without the Lipschitz constant
- Sufficient conditions for coincidence in \(\ell_ 1\)-minisum multifacility location problems
- Clustering and classification based on the L\(_{1}\) data depth
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- One-dimensional center-based l 1-clustering method
- Approximating surfaces by the moving least absolute deviations method
- Weighted Median of the Data in Solving Least Absolute Deviations Problems
- The multivariate L 1 -median and associated data depth
- An algorithm for minimizing clustering functions
- Neuro-rough-fuzzy approach for regression modelling from missing data
- Data Clustering: Theory, Algorithms, and Applications
- THE BEST LEAST ABSOLUTE DEVIATIONS LINE – PROPERTIES AND TWO EFFICIENT METHODS FOR ITS DERIVATION
- Robust Q-mode principal component analysis in \(L_{1}\)
