{"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/a-constrained-weighted-l1-minimization","title":"A Constrained, Weighted-L1 Minimization Approach for Joint Discovery of Heterogeneous Neural Connectivity Graphs","arxiv_id":"1709.04090","date":"2017-09-13","proceeding":"arXiv 2017 9","authors":["Chandan Singh","Beilun Wang","Yanjun Qi"],"abstract":"Determining functional brain connectivity is crucial to understanding the\nbrain and neural differences underlying disorders such as autism. Recent\nstudies have used Gaussian graphical models to learn brain connectivity via\nstatistical dependencies across brain regions from neuroimaging. However,\nprevious studies often fail to properly incorporate priors tailored to\nneuroscience, such as preferring shorter connections. To remedy this problem,\nthe paper here introduces a novel, weighted-$\\ell_1$, multi-task graphical\nmodel (W-SIMULE). This model elegantly incorporates a flexible prior, along\nwith a parallelizable formulation. Additionally, W-SIMULE extends the\noften-used Gaussian assumption, leading to considerable performance increases.\nHere, applications to fMRI data show that W-SIMULE succeeds in determining\nfunctional connectivity in terms of (1) log-likelihood, (2) finding edges that\ndifferentiate groups, and (3) classifying different groups based on their\nconnectivity, achieving 58.6\\% accuracy on the ABIDE dataset. Having\nestablished W-SIMULE's effectiveness, it links four key areas to autism, all of\nwhich are consistent with the literature. Due to its elegant domain adaptivity,\nW-SIMULE can be readily applied to various data types to effectively estimate\nconnectivity.","url_abs":"http://arxiv.org/abs/1709.04090v2","url_pdf":"http://arxiv.org/pdf/1709.04090v2.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":"a-constrained-weighted-l1-minimization","repo_url":"https://github.com/QData/SIMULE","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"a-constrained-weighted-l1-minimization","repo_url":"https://github.com/QData/JointNets","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"connectivity-estimation","task_name":"Connectivity Estimation"},{"task_slug":null,"task_name":"Functional Connectivity"}],"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":"QData/SIMULE","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"QData/JointNets","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":"02d54d13d2e0733f84925d218a57e42233257ef14ddcf04e24afd6fa76e27e50","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}