{"url":"/method/mincutpool","slug":"mincutpool","name":"MinCutPool","full_name":"MinCut Pooling","full_name_withheld":false,"description_markdown":"MinCutPool is a trainable pooling operator for graphs that learns to map nodes into clusters.\r\nThe method is trained to approximate the minimum K-cut of the graph to ensure that the clusters are balanced, while also jointly optimizing the objective of the task at hand.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Spectral Clustering with Graph Neural Networks for Graph Pooling","paper":"/paper/mincut-pooling-in-graph-neural-networks","first_author":"Filippo Maria Bianchi","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/mincut-pooling-in-graph-neural-networks"},"source":{"url":"https://arxiv.org/abs/1907.00481v6","title":"Spectral Clustering with Graph Neural Networks for Graph Pooling","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Models","url":"/methods/category/graph-models","pwc_aliases":[]}],"n_papers_tagged":2,"archive_num_papers":2,"papers_newest_first":[{"paper":null,"title":"Tackling Oversmoothing in GNN via Graph Sparsification: A Truss-based Approach","date":"2024-07-16","arxiv_id":"2407.11928","n_code_links":0,"syntology":null},{"paper":"/paper/mincut-pooling-in-graph-neural-networks","title":"Spectral Clustering with Graph Neural Networks for Graph Pooling","date":"2019-06-30","arxiv_id":"1907.00481","n_code_links":4,"syntology":{"ran":0,"of":9,"unverified":9,"pointer_only":0}}],"papers_shown":2,"tasks":[{"task":"/task/graph-classification","name":"Graph Classification","papers":2},{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":2},{"task":"/task/clustering","name":"Clustering","papers":1},{"task":"/task/graph-clustering","name":"Graph Clustering","papers":1},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":1}],"tasks_shown":5,"n_tasks":5,"usage_by_year":[{"year":"2019","papers":1},{"year":"2024","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/mincutpool"},"syntology_read_at":"2026-09-24T18:15:14+00:00"}