J-MEANS

swMATH2649MaRDI QIDQ15188FDOQ15188

Author name not available (Why is that?)

Described by source

• J-MEANS: A new local search heuristic for minimum sum of squares clustering

Cited In (73)

• \(k\)-means genetic algorithms with greedy genetic operators
• VNSOptClust: A Variable Neighborhood Search Based Approach for Unsupervised Anomaly Detection
• Title not available (Why is that?)
• On the Optimization Models for Automatic Grouping of Industrial Products by Homogeneous Production Batches
• On strategies to fix degenerate \(k\)-means solutions
• A derivative-free algorithm for refining numerical microaggregation solutions
• Unsupervised minor prototype detection using an adaptive population partitioning algorithm
• Improving fuzzy c-means clustering via quantum-enhanced weighted superposition attraction algorithm
• An Investigation on Compound Neighborhoods for VRPTW
• Degeneracy on \(K\)-means clustering
• Developing a feature weight self-adjustment mechanism for a K-means clustering algorithm
• Investigation of a new GRASP-based clustering algorithm applied to biological data
• Intelligent choice of the number of clusters in \(K\)-means clustering: an experimental study with different cluster spreads
• Categorical data fuzzy clustering: an analysis of local search heuristics
• A scatter search approach for the minimum sum-of-squares clustering problem
• Solving the wire-harness design problem at a European car manufacturer
• New heuristic for harmonic means clustering
• A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
• Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
• A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
• Sequential combination methods for data clustering analysis
• Title not available (Why is that?)
• Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem
• A cluster validity index for fuzzy clustering
• Improving dynamic programming strategies for partitioning
• Variable neighborhood search for harmonic means clustering
• Variable neighbourhood search: Methods and applications
• Variable neighborhood search: Principles and applications
• K-medoids inverse regression
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices
• Title not available (Why is that?)
• Variable neighbourhood search: methods and applications
• THRESHOLD ACCEPTING BASED FUZZY CLUSTERING ALGORITHMS
• Candidate groups search for K-harmonic means data clustering
• An improved column generation algorithm for minimum sum-of-squares clustering
• Norm statistics and the complexity of clustering problems
• A reactive GRASP with path relinking for capacitated clustering
• A cluster validity index for fuzzy clustering
• Evaluation and decision models with multiple criteria. Stepping stones for the analyst.
• SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
• Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
• K-means clustering via a nonconvex optimization approach
• Arbitrary-norm hyperplane separation by variable neighbourhood search
• An algorithm for minimizing clustering functions
• A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks
• Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
• Local optimization method with global multidimensional search
• Optimization of multiple covering of a bounded set with circles
• Improving a centroid-based clustering by using suitable centroids from another clustering
• Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
• An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems
• Title not available (Why is that?)
• GAPS: A clustering method using a new point symmetry-based distance measure
• A survey of data mining techniques applied to agriculture
• Partitioning hard clustering algorithms based on multiple dissimilarity matrices
• Clustering approach in maintenance of capillary railway network
• Grouping cities based of their socio-economic indicators
• \(K\)-harmonic means data clustering with simulated annealing heuristic
• \(K\)-harmonic means data clustering with tabu-search method
• Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
• Application of the cross-entropy method to clustering and vector quantization
• A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
• Design of hybrids for the minimum sum-of-squares clustering problem
• Fuzzy J-means: a new heuristic for fuzzy clustering
• A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data
• Variable neighborhood search for minimum sum-of-squares clustering on networks
• FUZZY C-MEANS CLUSTERING MODELS FOR MULTIVARIATE TIME-VARYING DATA: DIFFERENT APPROACHES
• Clustering cities based on their development dynamics and variable neigborhood search
• J-means and I-means for minimum sum-of-squares clustering on networks
• Variable neighbourhood search for redundancy allocation problems
• Variable neighbourhood search for colour image quantization

This page was built for software: J-MEANS