One-dimensional center-based l 1-clustering method

DOI10.1007/s11590-011-0389-9zbMath1283.90034OpenAlexW2088086447MaRDI QIDQ1936788

Ivan Vazler, Rudolf Scitovski, Kristian Sabo

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

zbMATH Keywords

optimizationclusteringdata miningweighted median problem

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Combinatorial optimization (90C27)

Related Items

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 ⋮ A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function ⋮ 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 ⋮ Interpretation and optimization of the \(k\)-means algorithm. ⋮ Searching for an Optimal Partition of Incomplete Data with Application in Modeling Energy Efficiency of Public Buildings ⋮ An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms ⋮ Clustering and maximum likelihood search for efficient statistical classification with medium-sized databases ⋮ Incremental method for multiple line detection problem -- iterative reweighted approach ⋮ Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1] ⋮ 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 combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem ⋮ Center-based l1–clustering method

Uses Software

• flexclust

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On solving the planar \(k\)-centrum problem with Euclidean distances
• 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
• The big cube small cube solution method for multidimensional facility location problems
• Probabilistic d-clustering
• Three points method for searching the best least absolute deviations plane
• A review of recent advances in global optimization
• Robust Hausdorff distance measure for face recognition
• Additive scaling and the \texttt{DIRECT} algorithm
• Criteria for unconstrained global optimization
• A generalized Weiszfeld method for the multi-facility location problem
• A toolbox for \(K\)-centroids cluster analysis
• Lipschitzian optimization without the Lipschitz constant
• Two unconstrained optimization approaches for the Euclidean \(\kappa \)-centrum location problem
• A global minimization algorithm for Lipschitz functions
• Weighted Median of the Data in Solving Least Absolute Deviations Problems
• Solution methods for thep-median problem: An annotated bibliography
• Generalized Gradients and Applications
• 10.1162/153244303322753661
• Data Clustering: Theory, Algorithms, and Applications
• THE BEST LEAST ABSOLUTE DEVIATIONS LINE – PROPERTIES AND TWO EFFICIENT METHODS FOR ITS DERIVATION