scientific article

From MaRDI portal
Publication:3444817

zbMath1183.62106MaRDI QIDQ3444817

Jacob Kogan

Publication date: 5 June 2007


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

On the added value of bootstrap analysis for \(K\)-means clusteringA steepest descent-like method for vector optimization problems with variable domination structureA Simple Distribution-Free Algorithm for Generating Simulated High-Dimensional Correlated Data with an Autoregressive StructureWind farm portfolio optimization under network capacity constraintsA new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional setA modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric functionNonsmooth DC programming approach to the minimum sum-of-squares clustering problemsOne-dimensional center-based l 1-clustering methodStrategic and tactical design of competing decentralized supply chain networks with risk-averse participants for markets with uncertain demandApplication 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 problemData clustering for circle detectionRandom walk distances in data clustering and applicationsInterpretation and optimization of the \(k\)-means algorithm.A steepest descent-like method for variable order vector optimization problemsData Clustering with Actuarial ApplicationsSearching for an Optimal Partition of Incomplete Data with Application in Modeling Energy Efficiency of Public BuildingsMean field analysis of a spatial stochastic model of a gene regulatory networkIncremental method for multiple line detection problem -- iterative reweighted approachTopological pattern recognition for point cloud dataEnhancing principal direction divisive clusteringThe 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 problemCenter-based l1–clustering method




This page was built for publication: