An experimental comparison of seriation methods for one-mode two-way data
From MaRDI portal
Publication:1752777
Recommendations
- Seriation in combinatorial and statistical data analysis
- Inducing a blockmodel structure of two-mode binary data using seriation procedures
- Continuation methods for approximate large scale object sequencing
- The seriation problem in the presence of a double Fiedler value
- Integer programming methods for seriation and unidimensional scaling of proximity matrices: A review and some extensions.
Cites work
- A hybrid genetic-variable neighborhood search algorithm for the cell formation problem based on grouping efficacy
- A NEW MEASURE OF RANK CORRELATION
- A pattern analysis of the second Rehnquist U.S. Supreme Court
- A Spectral Algorithm for Seriation and the Consecutive Ones Problem
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- A water flow-like algorithm for manufacturing cell formation problems
- An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems
- An Ordering Algorithm for Analysis of Data Arrays
- Combinatorial data analysis. Optimization by dynamic programming
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
- scientific article; zbMATH DE number 3910164 (Why is no real title available?)
- scientific article; zbMATH DE number 3521374 (Why is no real title available?)
- scientific article; zbMATH DE number 3566863 (Why is no real title available?)
- scientific article; zbMATH DE number 1107546 (Why is no real title available?)
- scientific article; zbMATH DE number 1750179 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 194916 (Why is no real title available?)
- scientific article; zbMATH DE number 2231543 (Why is no real title available?)
- Integer programming methods for seriation and unidimensional scaling of proximity matrices: A review and some extensions.
- Machine-part cell formation in group technology using a modified ART1 method
- Machine-part cell formation using biclustering
- Operational research from Taylorism to terabytes: a research agenda for the analytics age
- Optimal bivariate clustering and a genetic algorithm with an application in cellular manufacturing
- Problem Decomposition and Data Reorganization by a Clustering Technique
- QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
- Seriation and matrix reordering methods: An historical overview
- SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
- Technical Note—Clustering a Data Array and the Traveling-Salesman Problem
- The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
- The traveling salesman problem and its variations
Cited in
(8)- Integer programming methods for seriation and unidimensional scaling of proximity matrices: A review and some extensions.
- On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps
- Two-way incremental seriation in the temporal domain with three-dimensional visualization: making sense of evolving high-dimensional datasets
- Seriation using tree-penalized path length
- The seriation problem in the presence of a double Fiedler value
- An Optimal Algorithm for Strict Circular Seriation
- Continuation methods for approximate large scale object sequencing
- Inducing a blockmodel structure of two-mode binary data using seriation procedures
This page was built for publication: An experimental comparison of seriation methods for one-mode two-way data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752777)
