{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/inhomogeneous-hypergraph-clustering-with","title":"Inhomogeneous Hypergraph Clustering with Applications","arxiv_id":"1709.01249","date":"2017-09-05","proceeding":"NeurIPS 2017 12","authors":["Pan Li","Olgica Milenkovic"],"abstract":"Hypergraph partitioning is an important problem in machine learning, computer\nvision and network analytics. A widely used method for hypergraph partitioning\nrelies on minimizing a normalized sum of the costs of partitioning hyperedges\nacross clusters. Algorithmic solutions based on this approach assume that\ndifferent partitions of a hyperedge incur the same cost. However, this\nassumption fails to leverage the fact that different subsets of vertices within\nthe same hyperedge may have different structural importance. We hence propose a\nnew hypergraph clustering technique, termed inhomogeneous hypergraph\npartitioning, which assigns different costs to different hyperedge cuts. We\nprove that inhomogeneous partitioning produces a quadratic approximation to the\noptimal solution if the inhomogeneous costs satisfy submodularity constraints.\nMoreover, we demonstrate that inhomogenous partitioning offers significant\nperformance improvements in applications such as structure learning of\nrankings, subspace segmentation and motif clustering.","url_abs":"http://arxiv.org/abs/1709.01249v4","url_pdf":"http://arxiv.org/pdf/1709.01249v4.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"inhomogeneous-hypergraph-clustering-with","repo_url":"https://github.com/lipan00123/InHclustering","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"hypergraph-partitioning","task_name":"hypergraph partitioning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1709.01249","atlas_url":"https://app.syntology.ai/?focus=1709.01249","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1709.01249"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1709.01249\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1709.01249"},"call":"get_concepts_for_paper(arxiv_id=\"1709.01249\")"}],"by_repo":[{"repo":"lipan00123/InHclustering","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"0fc3da1165fccb1421fd79fcb90f5f4992a40d86b1f55fe22fddd58e7c43e56f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}