An experimental comparison of seriation methods for one-mode two-way data
type: Item
instance of: scholarly article
title: An experimental comparison of seriation methods for one-mode two-way data
zbMATH Open document ID: 1394.90482
author: Michael Hahsler
published in: European Journal of Operational Research
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 62P15
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6872915
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: heuristics
zbMATH Keywords: experimental study
describes a project that uses: UCI-ml
describes a project that uses: Concorde
describes a project that uses: TSP
describes a project that uses: PermutMatrix
describes a project that uses: SNAP
describes a project that uses: seriation
describes a project that uses: GAP
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.08.066
OpenAlex ID: W2512224663
cites work: Q4373474
cites work: A Spectral Algorithm for Seriation and the Consecutive Ones Problem
cites work: Machine-part cell formation using biclustering
cites work: Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
cites work: Q5706832
cites work: Integer programming methods for seriation and unidimensional scaling of proximity matrices: A review and some extensions.
cites work: A thermodynamically motivated simulation procedure for combinatorial optimization problems
cites work: Q4532835
cites work: Q4692885
cites work: An Ordering Algorithm for Analysis of Data Arrays
cites work: Q3686458
cites work: An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems
cites work: Q4692508
cites work: The traveling salesman problem and its variations
cites work: Combinatorial data analysis. Optimization by dynamic programming
cites work: QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
cites work: SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
cites work: Q4099076
cites work: A NEW MEASURE OF RANK CORRELATION
cites work: The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
cites work: Technical Note—Clustering a Data Array and the Traveling-Salesman Problem
cites work: Seriation and matrix reordering methods: An historical overview
cites work: Problem Decomposition and Data Reorganization by a Clustering Technique
cites work: Operational research from Taylorism to terabytes: a research agenda for the analytics age
cites work: A hybrid genetic-variable neighborhood search algorithm for the cell formation problem based on grouping efficacy
cites work: Optimal bivariate clustering and a genetic algorithm with an application in cellular manufacturing
cites work: A pattern analysis of the second Rehnquist U.S. Supreme Court
cites work: Q4138743
cites work: A water flow-like algorithm for manufacturing cell formation problems
cites work: Machine-part cell formation in group technology using a modified ART1 method
DOI: 10.1016/J.EJOR.2016.08.066
description: scientific article; zbMATH DE number 6872915