The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Data-driven graph construction and graph learning: A review
Open accessAbstract
A graph is one of important mathematical tools to describe ubiquitous relations. In the classical graph theory and some applications, graphs are generally provided in advance, or can at least be defined clearly. Thus, the main focus is to measure/analyze the graphs for mining informative patterns. However, for many real-world scenarios, the graph is often uncertain due to the fact that data associated with the vertices in the graph are high-dimensional, noisy, differently distributed, and even no clear definition. As a result, one needs to design or learn graphs from data prior to any analysis, which in turn affects the subsequent tasks. Therefore, constructing a high-quality graph has become an increasingly hot research problem, which inspired many graph construction methods being proposed in the past years. Since there has been no systematic summary on this topic, in this paper, we review the main-stream graph construction/learning methods involved in both general machine learning algorithms (including semi-supervised learning, clustering, manifold learning, and spectral kernel learning, etc.) and some specific applications (especially, the modeling and analysis of functional brain connectivity). Additionally, we introduce a matrix-regularized graph learning framework that can benefit to unify some existing graph construction models and develop new graph learning algorithms. Finally, we discuss several related topics and some promising research directions in this field.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
High-dimensional graphs and variable selection with the Lasso
Meinshausen, N., & Bühlmann, P. (2006) · The Annals of Statistics · doi:10.1214/009053606000000281 · Cited by 2,521
Face Recognition with Local Binary Patterns
Ahonen, T., Hadid, A., & Pietikäinen, M. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24670-1_36 · Cited by 2,462
Similarity network fusion for aggregating data types on a genomic scale
Wang, B., Mezlini, A. M., Demir, F., Fiume, M., Tu, Z., Brudno, M., Haibe-Kains, B., & Goldenberg, A. (2014) · Nature Methods · doi:10.1038/nmeth.2810 · Cited by 2,036
Network modelling methods for FMRI
Smith, S. M., Miller, K. L., Salimi-Khorshidi, G., Webster, M., Beckmann, C. F., Nichols, T. E., Ramsey, J. D., & Woolrich, M. W. (2011) · NeuroImage · doi:10.1016/j.neuroimage.2010.08.063 · Cited by 1,878
The connectomics of brain disorders
Fornito, A., Zalesky, A., & Breakspear, M. (2015) · Nature Reviews Neuroscience · doi:10.1038/nrn3901 · Cited by 1,734
Functional connectomics from resting-state fMRI
Smith, S. M., Vidaurre, D., Beckmann, C. F., Glasser, M. F., Jenkinson, M., Miller, K. L., Nichols, T. E., Robinson, E. C., Salimi-Khorshidi, G., Woolrich, M. W., et al. (2013) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2013.09.016 · Cited by 952
Graph analysis of the human connectome: Promise, progress, and pitfalls
Fornito, A., Zalesky, A., & Breakspear, M. (2013) · NeuroImage · doi:10.1016/j.neuroimage.2013.04.087 · Cited by 743
Metadata
- Authors
- Qiao, L., Zhang, L., Chen, S., & Shen, D.
- Venue
- Neurocomputing
- Publisher
- Elsevier BV
- Published
- 2018-10
- Volume
- 312
- Pages
- 336-351
- ISSN
- 0925-2312 (ISSN-L)
- OpenAlex
- W2807150694
- Cited by
- 160
- References
- 7
- FWCI
- 7.36
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Data-driven graph construction and graph learning: A review. https://app.cochat.ai/papers/10.1016/j.neucom.2018.05.084
- The paper
- Qiao, L., Zhang, L., Chen, S., & Shen, D. (2018). Data-driven graph construction and graph learning: A review. Neurocomputing. https://doi.org/10.1016/j.neucom.2018.05.084
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.