Pages that link to "Item:Q477965"
From MaRDI portal
The following pages link to Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis (Q477965):
Displaying 10 items.
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- Exemplar-based clustering via simulated annealing (Q1036142) (← links)
- An experimental comparison of seriation methods for one-mode two-way data (Q1752777) (← links)
- Disentangling relationships in symptom networks using matrix permutation methods (Q2141642) (← links)
- A multi-scale seriation algorithm for clustering sparse imbalanced data: application to spike sorting (Q2337510) (← links)
- An improved exact algorithm for least-squares unidimensional scaling (Q2375707) (← links)
- Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition (Q2445688) (← links)
- A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems (Q2905131) (← links)
- Residual analysis for unidimensional scaling in the <i>L</i><sub>2</sub>-norm (Q5087499) (← links)
