The following pages link to (Q3444817):
Displaying 25 items.
- On the added value of bootstrap analysis for \(K\)-means clustering (Q269548) (← links)
- Wind farm portfolio optimization under network capacity constraints (Q320033) (← links)
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function (Q386486) (← links)
- Strategic and tactical design of competing decentralized supply chain networks with risk-averse participants for markets with uncertain demand (Q410350) (← links)
- Interpretation and optimization of the \(k\)-means algorithm. (Q464720) (← links)
- A steepest descent-like method for variable order vector optimization problems (Q467437) (← links)
- Mean field analysis of a spatial stochastic model of a gene regulatory network (Q500347) (← links)
- Enhancing principal direction divisive clustering (Q991947) (← 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)
- One-dimensional center-based l 1-clustering method (Q1936788) (← links)
- Random walk distances in data clustering and applications (Q1947049) (← links)
- Incremental method for multiple line detection problem -- iterative reweighted approach (Q1998212) (← links)
- A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem (Q2036141) (← 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)
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems (Q2416961) (← 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)
- A Simple Distribution-Free Algorithm for Generating Simulated High-Dimensional Correlated Data with an Autoregressive Structure (Q2905721) (← links)
- Data clustering for circle detection (Q2966424) (← links)
- Topological pattern recognition for point cloud data (Q4683915) (← links)
- A steepest descent-like method for vector optimization problems with variable domination structure (Q5052577) (← links)
- Data Clustering with Actuarial Applications (Q5139809) (← 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)
- A method for searching for a globally optimal \(k\)-partition of higher-dimensional datasets (Q6568951) (← links)
- Comparison between classification algorithms using a multiple correspondence analysis with Python (Q6596797) (← links)
