Disentangling relationships in symptom networks using matrix permutation methods
From MaRDI portal
Publication:2141642
DOI10.1007/s11336-021-09760-7zbMath1486.62301OpenAlexW3186023809MaRDI QIDQ2141642
Ashley L. Watts, Douglas Steinley, Michael J. Brusco
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
Related Items
Guest editors' introduction to the special issue ``Network psychometrics in action: methodological innovations inspired by empirical problems, Possible futures for network psychometrics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
- Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal
- Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation
- Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.
- Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming
- Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming
- High-dimensional graphs and variable selection with the Lasso
- An interactive multiobjective programming approach to combinatorial data analysis
- Combinatorial Data Analysis
- The Quadratic Assignment Problem
- A Cutting Plane Algorithm for the Linear Ordering Problem
- A Dynamic Programming Approach to Sequencing Problems
- A branch search algorithm for maximum likelihood paired comparison ranking
- SERIATION USING ASYMMETRIC PROXIMITY MEASURES
- QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
- Note—A Note on Majority Rule under Transitivity Constraints
- Majority Rule Under Transitivity Constraints
- SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
- Finite-State Processes and Dynamic Programming
- Maximum likelihood paired comparison ranking by linear programming
- A branch and bound algorithm for maximum likelihood paired comparison ranking
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
