Disentangling relationships in symptom networks using matrix permutation methods (Q2141642): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11336-021-09760-7 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: relaimpo / 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.1007/s11336-021-09760-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3186023809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—A Note on Majority Rule under Transitivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Majority Rule Under Transitivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interactive multiobjective programming approach to combinatorial data analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5706832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum likelihood paired comparison ranking by linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for maximum likelihood paired comparison ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch search algorithm for maximum likelihood paired comparison ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cutting Plane Algorithm for the Linear Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES / rank
 
Normal rank
Property / cites work
 
Property / cites work: SERIATION USING ASYMMETRIC PROXIMITY MEASURES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Data Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation / rank
 
Normal rank
Property / cites work
 
Property / cites work: QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-State Processes and Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-dimensional graphs and variable selection with the Lasso / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11336-021-09760-7 / rank
 
Normal rank

Latest revision as of 05:28, 17 December 2024

scientific article
Language Label Description Also known as
English
Disentangling relationships in symptom networks using matrix permutation methods
scientific article

    Statements

    Disentangling relationships in symptom networks using matrix permutation methods (English)
    0 references
    0 references
    0 references
    0 references
    25 May 2022
    0 references
    symptom networks
    0 references
    network matrices
    0 references
    matrix permutation
    0 references
    dynamic programming
    0 references
    dominance index
    0 references
    Robinson index
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers