{"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/non-linear-attributed-graph-clustering-by","title":"Non-linear Attributed Graph Clustering by Symmetric NMF with PU Learning","arxiv_id":"1810.00946","date":"2018-09-21","proceeding":null,"authors":["Seiji Maekawa","Koh Takeuch","Makoto Onizuka"],"abstract":"We consider the clustering problem of attributed graphs. Our challenge is how\nwe can design an effective and efficient clustering method that precisely\ncaptures the hidden relationship between the topology and the attributes in\nreal-world graphs. We propose Non-linear Attributed Graph Clustering by\nSymmetric Non-negative Matrix Factorization with Positive Unlabeled Learning.\nThe features of our method are three holds. 1) it learns a non-linear\nprojection function between the different cluster assignments of the topology\nand the attributes of graphs so as to capture the complicated relationship\nbetween the topology and the attributes in real-world graphs, 2) it leverages\nthe positive unlabeled learning to take the effect of partially observed\npositive edges into the cluster assignment, and 3) it achieves efficient\ncomputational complexity, $O((n^2+mn)kt)$, where $n$ is the vertex size, $m$ is\nthe attribute size, $k$ is the number of clusters, and $t$ is the number of\niterations for learning the cluster assignment. We conducted experiments\nextensively for various clustering methods with various real datasets to\nvalidate that our method outperforms the former clustering methods regarding\nthe clustering quality.","url_abs":"http://arxiv.org/abs/1810.00946v1","url_pdf":"http://arxiv.org/pdf/1810.00946v1.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":"non-linear-attributed-graph-clustering-by","repo_url":"https://github.com/seijimaekawa/NAGC","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"attribute","task_name":"Attribute"},{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"graph-clustering","task_name":"Graph Clustering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"seijimaekawa/NAGC","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":"699ba417e7a14182721d16376ab8394a91459795077e9083606bf72721908689","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}