Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems (Q2416961): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Adil M. Bagirov / rank
Normal rank
 
Property / author
 
Property / author: Adil M. Bagirov / rank
 
Normal rank
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.2015.11.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2182320210 / 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: New and efficient DCA based algorithms for minimum sum-of-squares clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact penalty and error bounds in DC programming / 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: Introduction to Nonsmooth Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An incremental clustering algorithm based on hyperbolic smoothing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for minimizing clustering functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast modified global \(k\)-means algorithm for incremental cluster construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast global \(k\)-means clustering based on local geometrical information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and nonsmooth analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method of truncated codifferential with application to some problems of cluster analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of a Branch and Bound Algorithm for Clustering / 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 decomposition search / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC programming: overview. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3444817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast global \(k\)-means clustering using cluster membership and inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic algorithm for solving the minimum sum-of-squares clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the nearest point in A polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hyperbolic smoothing clustering method / 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

Latest revision as of 09:08, 19 July 2024

scientific article
Language Label Description Also known as
English
Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
scientific article

    Statements

    Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems (English)
    0 references
    0 references
    0 references
    0 references
    27 May 2019
    0 references
    cluster analysis
    0 references
    non-smooth optimization
    0 references
    non-convex optimization
    0 references
    incremental clustering algorithms
    0 references
    0 references
    0 references
    0 references

    Identifiers