One-dimensional center-based l 1-clustering method
From MaRDI portal
Recommendations
- Center-based \(l_1\)-clustering method
- A clustering method based on the \(L_ 1\)-norm
- L\({}_ 1\)-norm based fuzzy clustering
- Center-based clustering under perturbation stability
- Clustering and classification based on the L\(_{1}\) data depth
- scientific article; zbMATH DE number 5957421
- A density-based and grid-based cluster centers determination clustering algorithm
- Deterministic \(o(1)\)-approximation algorithms to 1-center clustering with outliers
Cites work
- scientific article; zbMATH DE number 5957421 (Why is no real title available?)
- scientific article; zbMATH DE number 3852234 (Why is no real title available?)
- scientific article; zbMATH DE number 5277890 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 2035082 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3395303 (Why is no real title available?)
- 10.1162/153244303322753661
- A generalized Weiszfeld method for the multi-facility location problem
- A global minimization algorithm for Lipschitz functions
- A review of recent advances in global optimization
- A toolbox for \(K\)-centroids cluster analysis
- Additive scaling and the \texttt{DIRECT} algorithm
- Clustering with Bregman divergences.
- Criteria for unconstrained global optimization
- Data Clustering: Theory, Algorithms, and Applications
- Generalized Gradients and Applications
- Introduction to clustering large and high-dimensional data.
- Lipschitzian optimization without the Lipschitz constant
- On solving the planar \(k\)-centrum problem with Euclidean distances
- Probabilistic d-clustering
- Robust Hausdorff distance measure for face recognition
- 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
- Solution methods for thep-median problem: An annotated bibliography
- The best least absolute deviations line -- properties and two efficient methods for its derivation
- The big cube small cube solution method for multidimensional facility location problems
- Three points method for searching the best least absolute deviations plane
- Two unconstrained optimization approaches for the Euclidean \(\kappa \)-centrum location problem
- Weighted Median of the Data in Solving Least Absolute Deviations Problems
Cited in
(13)- Incremental method for multiple line detection problem -- iterative reweighted approach
- Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1]
- 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
- A clustering method based on the \(L_ 1\)-norm
- An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms
- A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem
- Interpretation and optimization of the \(k\)-means algorithm.
- 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.
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
- 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
- Searching for an optimal partition of incomplete data with application in modeling energy efficiency of public buildings
- Center-based \(l_1\)-clustering method
- Clustering and maximum likelihood search for efficient statistical classification with medium-sized databases
This page was built for publication: One-dimensional center-based l 1-clustering method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1936788)
