"walktrap" meaning in English

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "walk",
        "3": "trap"
      },
      "expansion": "walk + trap",
      "name": "compound"
    }
  ],
  "etymology_text": "From walk + trap.",
  "head_templates": [
    {
      "args": {},
      "expansion": "walktrap",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "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:",
          "text": "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.",
          "type": "quote"
        }
      ],
      "glosses": [
        "An algorithm for identifying communities in large networks using random walks."
      ],
      "id": "en-walktrap-en-name-jPwLJZ4H",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "communities",
          "community"
        ],
        [
          "network",
          "network"
        ],
        [
          "random walk",
          "random walk"
        ]
      ],
      "raw_glosses": [
        "(graph theory) An algorithm for identifying communities in large networks using random walks."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "walktrap"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "walk",
        "3": "trap"
      },
      "expansion": "walk + trap",
      "name": "compound"
    }
  ],
  "etymology_text": "From walk + trap.",
  "head_templates": [
    {
      "args": {},
      "expansion": "walktrap",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English compound terms",
        "English entries with incorrect language header",
        "English lemmas",
        "English proper nouns",
        "English terms with quotations",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Graph theory"
      ],
      "examples": [
        {
          "ref": "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:",
          "text": "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.",
          "type": "quote"
        }
      ],
      "glosses": [
        "An algorithm for identifying communities in large networks using random walks."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "communities",
          "community"
        ],
        [
          "network",
          "network"
        ],
        [
          "random walk",
          "random walk"
        ]
      ],
      "raw_glosses": [
        "(graph theory) An algorithm for identifying communities in large networks using random walks."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "walktrap"
}