Boolean Matrix Factorization on apb
-7BMF ErrorTree BMF
Evaluation Results
| Method | Links | |
|---|---|---|
| Tree BMFRank (r)=5, Time limit=5 minutes2025.12 | -7 | |
| Greedy TreeBMFRank (r)=5, Time limit=30 seconds2025.12 | -7 | |
| MS-Comb-AORank (r)=10, Time limit=5 minutes2025.12 | -7 | |
| Tree BMFRank (r)=10, Time limit=30 seconds2025.12 | -7 | |
| Tree BMFRank (r)=10, Time limit=5 minutes2025.12 | -7 | |
| MS-AORank (r)=5, Time limit=5 minutes2025.12 | -6 | |
| MS-Comb-AORank (r)=5, Time limit=5 minutes2025.12 | -6 | |
| Tree BMFRank (r)=5, Time limit=30 seconds2025.12 | -6 | |
| Greedy CombRank (r)=5, Time limit=30 seconds2025.12 | -6 | |
| Greedy CombRank (r)=5, Time limit=5 minutes2025.12 | -6 | |
| Greedy TreeBMFRank (r)=5, Time limit=5 minutes2025.12 | -6 | |
| Greedy TreeBMFRank (r)=10, Time limit=5 minutes2025.12 | -4 | |
| Greedy CombRank (r)=10, Time limit=5 minutes2025.12 | -2 | |
| Greedy TreeBMFRank (r)=10, Time limit=30 seconds2025.12 | -2 | |
| MS-Comb-AORank (r)=5, Time limit=30 seconds2025.12 | -1 | |
| Greedy CombRank (r)=10, Time limit=30 seconds2025.12 | -1 | |
| MS-AORank (r)=2, Time limit=30 seconds2025.12 | 0 | |
| MS-AORank (r)=2, Time limit=5 minutes2025.12 | 0 | |
| MS-Comb-AORank (r)=2, Time limit=30 seconds2025.12 | 0 | |
| MS-Comb-AORank (r)=2, Time limit=5 minutes2025.12 | 0 | |
| Tree BMFRank (r)=2, Time limit=30 seconds2025.12 | 0 | |
| Tree BMFRank (r)=2, Time limit=5 minutes2025.12 | 0 | |
| Greedy CombRank (r)=2, Time limit=30 seconds2025.12 | 0 | |
| Greedy CombRank (r)=2, Time limit=5 minutes2025.12 | 0 | |
| Greedy TreeBMFRank (r)=2, Time limit=30 seconds2025.12 | 0 | |
| Greedy TreeBMFRank (r)=2, Time limit=5 minutes2025.12 | 0 | |
| MS-AORank (r)=10, Time limit=5 minutes2025.12 | 2 | |
| MS-Comb-AORank (r)=10, Time limit=30 seconds2025.12 | 2 | |
| MS-AORank (r)=10, Time limit=30 seconds2025.12 | 4 | |
| MS-AORank (r)=5, Time limit=30 seconds2025.12 | 6 |