Pages that link to "Item:Q1936788"

The following pages link to One-dimensional center-based l 1-clustering method (Q1936788):

Displaying 12 items.

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