{"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/graph-laplacian-regularized-graph","title":"Graph Laplacian Regularized Graph Convolutional Networks for Semi-supervised Learning","arxiv_id":"1809.09839","date":"2018-09-26","proceeding":null,"authors":["Bo Jiang","Doudou Lin"],"abstract":"Recently, graph convolutional network (GCN) has been widely used for\nsemi-supervised classification and deep feature representation on\ngraph-structured data. However, existing GCN generally fails to consider the\nlocal invariance constraint in learning and representation process. That is, if\ntwo data points Xi and Xj are close in the intrinsic geometry of the data\ndistribution, then their labels/representations should also be close to each\nother. This is known as local invariance assumption which plays an essential\nrole in the development of various kinds of traditional algorithms, such as\ndimensionality reduction and semi-supervised learning, in machine learning\narea. To overcome this limitation, we introduce a graph Laplacian GCN (gLGCN)\napproach for graph data representation and semi-supervised classification. The\nproposed gLGCN model is capable of encoding both graph structure and node\nfeatures together while maintains the local invariance constraint naturally for\nrobust data representation and semi-supervised classification. Experiments show\nthe benefit of the benefits the proposed gLGCN network.","url_abs":"http://arxiv.org/abs/1809.09839v1","url_pdf":"http://arxiv.org/pdf/1809.09839v1.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":"graph-laplacian-regularized-graph","repo_url":"https://github.com/abhilash1910/Deep-Graph-Learning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"graph-laplacian-regularized-graph","repo_url":"https://github.com/abhilash1910/SpectralEmbeddings","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"dimensionality-reduction","task_name":"Dimensionality Reduction"},{"task_slug":"classification","task_name":"General Classification"}],"methods":[{"method_slug":"gcn","method_name":"GCN"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1809.09839","atlas_url":"https://app.syntology.ai/?focus=1809.09839","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":"1809.09839"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1809.09839\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1809.09839"},"call":"get_concepts_for_paper(arxiv_id=\"1809.09839\")"}],"by_repo":[{"repo":"abhilash1910/Deep-Graph-Learning","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"abhilash1910/SpectralEmbeddings","kind":"listed","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":"2961c754caa12aff45798b6b5961c1e3072cc4711cd8c3f3d0a857f6cc0c17f9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}