An experimental comparison of seriation methods for one-mode two-way data
From MaRDI portal
Publication:1752777
DOI10.1016/j.ejor.2016.08.066zbMath1394.90482OpenAlexW2512224663MaRDI QIDQ1752777
Publication date: 24 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.08.066
Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Applications of statistics to psychology (62P15)
Related Items (3)
On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps ⋮ Continuation methods for approximate large scale object sequencing ⋮ Seriation using tree-penalized path length
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hybrid genetic-variable neighborhood search algorithm for the cell formation problem based on grouping efficacy
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- A water flow-like algorithm for manufacturing cell formation problems
- Integer programming methods for seriation and unidimensional scaling of proximity matrices: A review and some extensions.
- The traveling salesman problem and its variations
- The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
- Optimal bivariate clustering and a genetic algorithm with an application in cellular manufacturing
- Machine-part cell formation using biclustering
- Machine-part cell formation in group technology using a modified ART1 method
- Operational research from Taylorism to terabytes: a research agenda for the analytics age
- Combinatorial Data Analysis
- QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
- A Spectral Algorithm for Seriation and the Consecutive Ones Problem
- An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems
- SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
- Seriation and matrix reordering methods: An historical overview
- Technical Note—Clustering a Data Array and the Traveling-Salesman Problem
- A pattern analysis of the second Rehnquist U.S. Supreme Court
- An Ordering Algorithm for Analysis of Data Arrays
- Problem Decomposition and Data Reorganization by a Clustering Technique
- A NEW MEASURE OF RANK CORRELATION
This page was built for publication: An experimental comparison of seriation methods for one-mode two-way data
