Block seriation problems: A unified approach. Reply to the problem of H. Garcia and J. M. Proth (Applied Stochastic Models and Data Analysis, 1, (1), 25–34 (1985))
From MaRDI portal
Publication:3026727
Recommendations
- scientific article; zbMATH DE number 1789844
- A note on the NP-hardness of the consecutive block minimization problem
- scientific article; zbMATH DE number 3817719
- scientific article; zbMATH DE number 3431966
- scientific article; zbMATH DE number 510064
- scientific article; zbMATH DE number 3915089
- scientific article; zbMATH DE number 3958110
- scientific article; zbMATH DE number 3924508
- Block Stanley decompositions. II: Greedy algorithms, applications, and open problems
- On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems
Cites work
Cited in
(12)- Two-mode clustering methods: astructuredoverview
- A multi-scale seriation algorithm for clustering sparse imbalanced data: application to spike sorting
- A close neighbour algorithm for designing cellular manufacturing systems
- Mutual information, phi-squared and model-based co-clustering for contingency tables
- Relational analysis and dictionaries
- Eliminating switching components in binary matrices by 0-1 flips and column permutations
- scientific article; zbMATH DE number 2209403 (Why is no real title available?)
- Diagonal latent block model for binary data
- scientific article; zbMATH DE number 2040674 (Why is no real title available?)
- Seriation and matrix reordering methods: An historical overview
- Block clustering with Bernoulli mixture models: comparison of different approaches
- A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices
This page was built for publication: Block seriation problems: A unified approach. Reply to the problem of H. Garcia and J. M. Proth (Applied Stochastic Models and Data Analysis, 1, (1), 25–34 (1985))
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3026727)