no-free-lunch theorem
A result establishing that no single community-detection method (or grouping) is universally best or 'true' across all networks, because there is no single optimal objective peak.
As defined in 301 | Tina Eliassi-Rad on Al, Networks, and Epistemic Instability
Where it comes up · 1
Most important claims · 1 of 1Search all claims for “no-free-lunch theorem” →
- Aaron Clauset, Leto Peel and colleagues proved a no-free-lunch theorem for community detection: there is no single grouping of nodes that constitutes the one true or best community structure, because no single objective-function peak exists, so a node cannot be definitively assigned to one community.301 | Tina Eliassi-Rad on Al, Networks, and Epistemic Instability