The following pages link to J-MEANS (Q15188):
Displaying 50 items.
- Intelligent choice of the number of clusters in \(K\)-means clustering: an experimental study with different cluster spreads (Q263223) (← links)
- J-means and I-means for minimum sum-of-squares clustering on networks (Q526420) (← links)
- A reactive GRASP with path relinking for capacitated clustering (Q535394) (← links)
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering (Q628745) (← links)
- Variable neighborhood search for harmonic means clustering (Q636511) (← links)
- Partitioning hard clustering algorithms based on multiple dissimilarity matrices (Q645877) (← links)
- An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
- Improving a centroid-based clustering by using suitable centroids from another clustering (Q779041) (← links)
- Improving dynamic programming strategies for partitioning (Q818974) (← links)
- Evaluation and decision models with multiple criteria. Stepping stones for the analyst. (Q820231) (← links)
- Application of the cross-entropy method to clustering and vector quantization (Q868638) (← links)
- \(K\)-harmonic means data clustering with simulated annealing heuristic (Q879469) (← links)
- New heuristic for harmonic means clustering (Q887198) (← links)
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search (Q933803) (← links)
- \(K\)-harmonic means data clustering with tabu-search method (Q949929) (← links)
- Design of hybrids for the minimum sum-of-squares clustering problem (Q951921) (← links)
- Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem (Q953320) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- GAPS: A clustering method using a new point symmetry-based distance measure (Q996422) (← links)
- Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal (Q998835) (← links)
- Developing a feature weight self-adjustment mechanism for a K-means clustering algorithm (Q1023820) (← links)
- Norm statistics and the complexity of clustering problems (Q1026145) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- A survey of data mining techniques applied to agriculture (Q1032611) (← links)
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem (Q1048651) (← links)
- Sequential combination methods for data clustering analysis (Q1613232) (← links)
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem (Q1677297) (← links)
- Grouping cities based of their socio-economic indicators (Q1687686) (← links)
- Clustering approach in maintenance of capillary railway network (Q1687690) (← links)
- Candidate groups search for K-harmonic means data clustering (Q1792370) (← links)
- Fuzzy J-means: a new heuristic for fuzzy clustering (Q1860175) (← links)
- Solving the wire-harness design problem at a European car manufacturer (Q1991185) (← links)
- A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks (Q2053830) (← links)
- A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data (Q2070120) (← links)
- K-means clustering via a nonconvex optimization approach (Q2117651) (← links)
- An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems (Q2185527) (← links)
- \(k\)-means genetic algorithms with greedy genetic operators (Q2217036) (← links)
- Variable neighborhood search for minimum sum-of-squares clustering on networks (Q2355953) (← links)
- Investigation of a new GRASP-based clustering algorithm applied to biological data (Q2379645) (← links)
- On strategies to fix degenerate \(k\)-means solutions (Q2403298) (← links)
- Categorical data fuzzy clustering: an analysis of local search heuristics (Q2456635) (← links)
- A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices (Q2462311) (← links)
- A scatter search approach for the minimum sum-of-squares clustering problem (Q2485180) (← links)
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning (Q2517895) (← links)
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems (Q2572256) (← links)
- Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem (Q2576247) (← links)
- Local optimization method with global multidimensional search (Q2576444) (← links)
- Clustering cities based on their development dynamics and variable neigborhood search (Q2631267) (← links)
- Unsupervised minor prototype detection using an adaptive population partitioning algorithm (Q2643901) (← links)
- A derivative-free algorithm for refining numerical microaggregation solutions (Q2794680) (← links)
