From: PQR sort: using PQR trees for binary matrix reorganization
Experiment: Rectnoise | Matrix sizes and noise ratios | |||||||||
---|---|---|---|---|---|---|---|---|---|---|
100 × 100 | 1,000 × 1,000 | |||||||||
Evaluator | Coefficient | Algorithm | 0.01 | 0.02 | 0.05 | 0.1 | 0.01 | 0.02 | 0.05 | 0.1 |
Anti-Robinson | Jaccard | 2D sort | × | ∘ | ∘ | ∙ | ∙ | ∙ | ∙ | ∙ |
Sugiyama | ∙ | ∙ | ∙ | ∙ | × | ∘ | × | × | ||
PQR sort | × | × | × | × | ∘ | × | ∘ | ∘ | ||
Simple matching | 2D sort | ∙ | ∙ | ∙ | ∙ | ∘ | ∙ | ∘ | ∘ | |
Sugiyama | × | ∘ | ∘ | ∙ | ∙ | ∙ | ∙ | ∙ | ||
PQR sort | × | × | × | × | × | × | × | × | ||
Minimal Span | Jaccard | 2D sort | × | × | × | × | ∘ | ∙ | ∙ | ∘ |
Sugiyama | ∘ | × | × | × | × | × | × | ∙ | ||
PQR sort | ∙ | ∙ | ∙ | ∙ | ∙ | ∙ | × | × | ||
Simple matching | 2D sort | ∘ | ∘ | ∘ | ∙ | ∘ | ∙ | ∙ | ∙ | |
Sugiyama | × | × | × | × | × | × | × | ∙ | ||
PQR sort | ∙ | ∙ | ∙ | ∙ | ∙ | ∙ | ∘ | × | ||
Execution time | 2D sort | ∙ | ∙ | ∙ | ∘ | ∘ | ∘ | ∘ | ∘ | |
Sugiyama | × | × | × | × | × | × | × | × | ||
PQR sort | ∙ | ∙ | ∙ | ∙ | ∙ | ∙ | ∙ | ∙ |