Boolean Matrix Factorization Completion on tumor missing entries from Table 3
68Objective Value ImprovementMS-AO
Evaluation results
| Method | Links | |
|---|---|---|
| MS-AORank (r)=10, Time Limit=30 seconds2025.12 | 68 | |
| MS-AORank (r)=10, Time Limit=5 minutes2025.12 | 18 | |
| MS-AORank (r)=5, Time Limit=30 seconds2025.12 | 17 | |
| Greedy CombRank (r)=10, Time Limit=30 seconds2025.12 | 15 | |
| Greedy CombRank (r)=10, Time Limit=5 minutes2025.12 | 8 | |
| Greedy TreeBMFRank (r)=10, Time Limit=30 seconds2025.12 | 3 | |
| Greedy TreeBMFRank (r)=10, Time Limit=5 minutes2025.12 | 3 | |
| MS-AORank (r)=2, Time Limit=30 seconds2025.12 | 2 | |
| MS-AORank (r)=2, Time Limit=5 minutes2025.12 | -1 | |
| MS-Comb-AORank (r)=2, Time Limit=30 seconds2025.12 | -1 | |
| MS-Comb-AORank (r)=2, Time Limit=5 minutes2025.12 | -1 | |
| Tree BMFRank (r)=2, Time Limit=30 seconds2025.12 | -1 | |
| Tree BMFRank (r)=2, Time Limit=5 minutes2025.12 | -1 | |
| Greedy CombRank (r)=2, Time Limit=30 seconds2025.12 | -1 | |
| Greedy CombRank (r)=2, Time Limit=5 minutes2025.12 | -1 | |
| Greedy TreeBMFRank (r)=2, Time Limit=30 seconds2025.12 | -1 | |
| Greedy TreeBMFRank (r)=2, Time Limit=5 minutes2025.12 | -1 | |
| Greedy TreeBMFRank (r)=5, Time Limit=30 seconds2025.12 | -1 | |
| MS-Comb-AORank (r)=10, Time Limit=30 seconds2025.12 | -2 | |
| Tree BMFRank (r)=10, Time Limit=5 minutes2025.12 | -2 | |
| MS-Comb-AORank (r)=5, Time Limit=30 seconds2025.12 | -3 | |
| MS-Comb-AORank (r)=10, Time Limit=5 minutes2025.12 | -4 | |
| Tree BMFRank (r)=10, Time Limit=30 seconds2025.12 | -4 | |
| Greedy CombRank (r)=5, Time Limit=30 seconds2025.12 | -5 | |
| MS-AORank (r)=5, Time Limit=5 minutes2025.12 | -7 | |
| MS-Comb-AORank (r)=5, Time Limit=5 minutes2025.12 | -10 | |
| Tree BMFRank (r)=5, Time Limit=5 minutes2025.12 | -10 | |
| Tree BMFRank (r)=5, Time Limit=30 seconds2025.12 | -11 | |
| Greedy CombRank (r)=5, Time Limit=5 minutes2025.12 | -19 | |
| Greedy TreeBMFRank (r)=5, Time Limit=5 minutes2025.12 | -19 |