Continuation methods for approximate large scale object sequencing
From MaRDI portal
Publication:669313
DOI10.1007/s10994-018-5764-7zbMath1485.90109OpenAlexW2897138161MaRDI QIDQ669313
Xenophon Evangelopoulos, John Y. Goulermas, Tingting Mu, Austin J. Brockmeier
Publication date: 15 March 2019
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-018-5764-7
Related Items (3)
The seriation problem in the presence of a double Fiedler value ⋮ Continuation methods for approximate large scale object sequencing ⋮ An Optimal Algorithm for Strict Circular Seriation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A second-order method for strongly convex \(\ell _1\)-regularization problems
- Continuation methods for approximate large scale object sequencing
- Smallest compact formulation for the permutahedron
- A survey for the quadratic assignment problem
- Metric methods for analyzing partially ranked data
- Optimal linear labelings and eigenvalues of graphs
- The quadratic assignment problem. Theory and algorithms
- Recent advances in the solution of quadratic assignment problems
- Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.
- An experimental comparison of seriation methods for one-mode two-way data
- The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
- Incidence matrices and interval graphs
- Compact integer-programming models for extracting subsets of stimuli from confusion matrices
- An efficient continuation method for quadratic assignment problems
- The university of Florida sparse matrix collection
- Convex Relaxations for Permutation Problems
- On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
- Laplace eigenvalues and bandwidth‐type invariants of graphs
- A Spectral Algorithm for Seriation and the Consecutive Ones Problem
- An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems
- An Exact Algorithm for the Quadratic Assignment Problem on a Tree
- Multiple View Geometry in Computer Vision
- A spectral algorithm for envelope reduction of sparse matrices
- A spectral approach to bandwidth and separator problems in graphs
- Seriation and matrix reordering methods: An historical overview
- Abundance matrices and seriation in archaeology
This page was built for publication: Continuation methods for approximate large scale object sequencing
