Disentangling relationships in symptom networks using matrix permutation methods

DOI10.1007/S11336-021-09760-7MaRDI QIDQ2141642zbMATH OpenOpenAlexFDO

Authors Michael J. Brusco, Douglas Steinley, Ashley L. Watts

Publication date 25 May 2022

Published in Psychometrika (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11336-021-09760-7

zbMATH Keywords

dynamic programmingmatrix permutationnetwork matricesdominance indexRobinson indexsymptom networks

Mathematics Subject Classification ID

Applications of statistics to psychology (62P15)

Recommendations

• Periodic reordering
• Best permutation analysis
• ConNEcT: a novel network approach for investigating the co-occurrence of binary psychopathological symptoms over time
• Permutation Tests for Infection Graphs
• Local Monotonicity in Probabilistic Networks

Cites work

• scientific article; zbMATH DE number 4022343 (Why is no real title available?)
• scientific article; zbMATH DE number 2231543 (Why is no real title available?)
• A Cutting Plane Algorithm for the Linear Ordering Problem
• A Dynamic Programming Approach to Sequencing Problems
• A branch and bound algorithm for maximum likelihood paired comparison ranking
• A branch search algorithm for maximum likelihood paired comparison ranking
• A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices
• An interactive multiobjective programming approach to combinatorial data analysis
• Combinatorial data analysis. Optimization by dynamic programming
• Finite-State Processes and Dynamic Programming
• Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
• High-dimensional graphs and variable selection with the Lasso
• Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming
• Majority Rule Under Transitivity Constraints
• Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation
• Maximum likelihood paired comparison ranking by linear programming
• Note—A Note on Majority Rule under Transitivity Constraints
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming
• Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal
• QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
• SERIATION USING ASYMMETRIC PROXIMITY MEASURES
• SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
• The quadratic assignment problem
• Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.

Cited in

(4)

• ConNEcT: a novel network approach for investigating the co-occurrence of binary psychopathological symptoms over time
• Guest editors' introduction to the special issue ``Network psychometrics in action: methodological innovations inspired by empirical problems
• Possible futures for network psychometrics
• Integer programming in psychology: a review and directions for future research

Describes a project that uses

Uses Software

• IsingFit
• qgraph
• bnlearn
• relaimpo
• R
• Matlab

This page was built for publication: Disentangling relationships in symptom networks using matrix permutation methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2141642)