One-dimensional center-based l 1-clustering method
From MaRDI portal
Publication:1936788
DOI10.1007/S11590-011-0389-9zbMATH Open1283.90034OpenAlexW2088086447MaRDI QIDQ1936788FDOQ1936788
Authors: Kristian Sabo, Rudolf Scitovski, Ivan Vazler 
Publication date: 7 February 2013
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0389-9
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
- A toolbox for \(K\)-centroids cluster analysis
- Title not available (Why is that?)
- Clustering with Bregman divergences.
- Probabilistic d-clustering
- Title not available (Why is that?)
- Lipschitzian optimization without the Lipschitz constant
- A generalized Weiszfeld method for the multi-facility location problem
- Introduction to clustering large and high-dimensional data.
- Title not available (Why is that?)
- A review of recent advances in global optimization
- Solution methods for thep-median problem: An annotated bibliography
- Generalized Gradients and Applications
- The big cube small cube solution method for multidimensional facility location problems
- Weighted Median of the Data in Solving Least Absolute Deviations Problems
- Title not available (Why is that?)
- Data Clustering: Theory, Algorithms, and Applications
- The best least absolute deviations line -- properties and two efficient methods for its derivation
- Three points method for searching the best least absolute deviations plane
- Title not available (Why is that?)
- On solving the planar \(k\)-centrum problem with Euclidean distances
- A global minimization algorithm for Lipschitz functions
- Title not available (Why is that?)
- Additive scaling and the \texttt{DIRECT} algorithm
- 10.1162/153244303322753661
- Criteria for unconstrained global optimization
- Robust Hausdorff distance measure for face recognition
- Two unconstrained optimization approaches for the Euclidean \(\kappa \)-centrum location problem
- 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
- Title not available (Why is that?)
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
Uses Software
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)
