New and efficient DCA based algorithms for minimum sum-of-squares clustering (Q898299): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.patcog.2013.07.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989830207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical foundations of the potential function method in pattern recognition learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of Euclidean sum-of-squares clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning mixtures of arbitrary gaussians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A majorization-minimization approach to the sparse generalized eigenvalue problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Support-vector networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of kernel and spectral methods for clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster analysis and mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PAC-Bayesian margin bound for linear classifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization based DC programming and DCA for hierarchical clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new efficient algorithm based on DC programming and DCA for clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A DC programming approach for feature selection in support vector machines learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC Programming and DCA for General DC Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicategory <i>ψ</i>-Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5617409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior Point Algorithm for Minimum Sum-of-Squares Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ψ-Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization RLT-based approach for solving the hard clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Concave-Convex Procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and the Theory of Grouping / rank
 
Normal rank

Latest revision as of 03:57, 11 July 2024

scientific article
Language Label Description Also known as
English
New and efficient DCA based algorithms for minimum sum-of-squares clustering
scientific article

    Statements

    New and efficient DCA based algorithms for minimum sum-of-squares clustering (English)
    0 references
    0 references
    0 references
    0 references
    8 December 2015
    0 references
    clustering
    0 references
    MSSC
    0 references
    Gaussian kernel
    0 references
    combinatorial optimization
    0 references
    nonsmooth nonconvex programming
    0 references
    DC programming
    0 references
    DCA
    0 references
    exact penalty
    0 references
    0 references
    0 references
    0 references

    Identifiers