The max-out min-in problem: a tool for data analysis (Q6164596): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Computational aspects of algorithms for variable selection in the context of principal components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Clustering: Theory, Algorithms, and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in graphs: A survey and recent results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principal component analysis. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principal component analysis: a review and recent developments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The unconstrained binary quadratic programming problem: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the maxcut problem by the global equilibrium search / rank
 
Normal rank

Revision as of 14:10, 1 August 2024

scientific article; zbMATH DE number 7706726
Language Label Description Also known as
English
The max-out min-in problem: a tool for data analysis
scientific article; zbMATH DE number 7706726

    Statements

    The max-out min-in problem: a tool for data analysis (English)
    0 references
    0 references
    0 references
    0 references
    4 July 2023
    0 references
    combinatorial optimization
    0 references
    weighted graphs
    0 references
    quadratic programming
    0 references
    computational complexity
    0 references
    variable selection
    0 references
    cluster analysis
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references