Meanings
- graph theoryAn algorithm for identifying communities in large networks using random walks.
We show that fastgreedy and walktrap community detection methods on weighted label co-occurence^([sic]) graphs are 85-92% more likely to yield better F1 scores than random partitioning.
2016, Piotr Szymański, Tomasz Kajdanowicz, Kristian Kersting, “How is a data-driven approach better than random choice in label space division for multi-label classification?”, in arXiv
Origin
Cite this entry
walktrap. (n.d.). In WatkinsX Dictionary. Retrieved November 3, 2026, from https://dictionary.watkinsx.com/word/walktrap
“walktrap.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/walktrap. Accessed November 3, 2026.
WatkinsX Dictionary, s.v. “walktrap,” accessed November 3, 2026, https://dictionary.watkinsx.com/word/walktrap.
Source: walktrap on Wiktionary, CC BY-SA 4.0.