OSCR

Coupled cross-sectional and longitudinal non-negative matrix factorization reveals dominant brain aging trajectories in 48,949 individuals.

Code ↔ Paper

1 match between paragraphs of the paper and lines of its authors' code, computed by the harvester (lexical-v1). Click a colored paragraph or line to see its counterpart.

The 1 match
  1. [1] § Methods › Normative modeling for estimating the cross-sectional deviation map (C-map) ↔ ccl_nmf/aa.py, lines 150–201 · score 0.64 · cyclical learning rate, Adam, cycle, gradient, optimizer, batch

Paper

Loaded from Europe PMC by your browser, not stored by OSCR: doi.org · Europe PMC

The paper is loaded when this pane is shown.

The authors' code

Python · 403 lines · 15 KB · MIT · 1 match

  1. from __future__ import annotations
  2. import argparse
  3. import random
  4. from dataclasses import dataclass
  5. from pathlib import Path
  6. from typing import Tuple
  7. import numpy as np
  8. import pandas as pd
  9. import tensorflow as tf
  10. from tensorflow import keras
  11. import joblib
  12. from sklearn.model_selection import StratifiedShuffleSplit
  13. from sklearn.preprocessing import StandardScaler
  14. # Project-local imports (must exist in your repo)
  15. from models import (
  16. make_encoder_model_v1,
  17. make_decoder_model_v1,
  18. make_discriminator_model_v1,
  19. )
  20. # ------------------------- Minimal determinism helpers -------------------------
  21. def set_global_seeds(seed: int) -> None:
  22. """Seed Python, NumPy, and TensorFlow RNGs."""
  23. random.seed(seed)
  24. np.random.seed(seed)
  25. tf.keras.utils.set_random_seed(seed)
  26. def set_tf_verbosity(quiet: bool = True) -> None:
  27. if not quiet:
  28. return
  29. import logging, warnings # noqa
  30. warnings.simplefilter(action="ignore", category=FutureWarning)
  31. warnings.simplefilter(action="ignore", category=Warning)
  32. tf.get_logger().setLevel(logging.ERROR)
  33. def feature_cols_from_csv(path: Path) -> list[str]:
  34. cols = pd.read_csv(path, nrows=0).columns.tolist()
  35. return sorted(c for c in cols if c != "participant_id")
  36. def load_and_merge(features_csv: Path, covariates_csv: Path) -> pd.DataFrame:
  37. features = pd.read_csv(features_csv)
  38. covars = pd.read_csv(covariates_csv)
  39. df = covars.merge(features, on="participant_id").reset_index(drop=True)
  40. return df
  41. def stratify_key(df: pd.DataFrame, n_bins: int) -> pd.Series:
  42. """
  43. Equal-width age bins over the observed [min(Age), max(Age)].
  44. Assumes 'Age' has no NaNs (drop earlier if needed).
  45. """
  46. ages = df["Age"].to_numpy()
  47. min_age = float(np.nanmin(ages))
  48. max_age = float(np.nanmax(ages))
  49. if not np.isfinite(min_age) or not np.isfinite(max_age):
  50. raise ValueError("Age contains no finite values for stratification.")
  51. if max_age <= min_age:
  52. return pd.Series(["bin0"] * len(df), index=df.index)
  53. # Equal-width bins
  54. edges = np.linspace(min_age, max_age, num=n_bins + 1)
  55. labels = [f"bin{i}" for i in range(n_bins)]
  56. out = pd.cut(df["Age"], bins=edges, labels=labels,
  57. include_lowest=True, right=False, duplicates="drop")
  58. # If duplicates dropped (rare), fallback: label NaNs as last bin
  59. out = out.astype("object")
  60. mask_nan = pd.isna(out.values)
  61. if mask_nan.any():
  62. out[mask_nan] = labels[-1]
  63. return pd.Series(out)
  64. # ------------------------- Config -------------------------
  65. @dataclass
  66. class TrainConfig:
  67. project_root: Path
  68. features_csv: Path
  69. covariates_csv: Path
  70. outdir: Path
  71. # Splits
  72. valheldout_size: float = 0.35
  73. heldout_frac_within_val: float = 0.40
  74. age_bins: int = 5 # choose 4 or 5
  75. # Training
  76. batch_size: int = 200
  77. epochs: int = 1000
  78. patience: int = 50
  79. z_dim: int = 20
  80. h_dim: Tuple[int, int] = (110, 110)
  81. seed: int = 0
  82. # CLR
  83. base_lr: float = 1e-4
  84. max_lr: float = 5e-3
  85. gamma: float = 0.98
  86. step_size: int | None = None
  87. # ------------------------- Train -------------------------
  88. def train(cfg: TrainConfig) -> Path:
  89. set_global_seeds(cfg.seed)
  90. set_tf_verbosity(quiet=True)
  91. # Load & prepare
  92. df = load_and_merge(cfg.features_csv, cfg.covariates_csv)
  93. feature_cols = feature_cols_from_csv(cfg.features_csv)
  94. # Drop rows with missing Age before stratification
  95. if df["Age"].isna().any():
  96. dropped = int(df["Age"].isna().sum())
  97. print(f"[INFO] Dropping {dropped} rows with missing Age before stratified split.")
  98. df = df[df["Age"].notna()].reset_index(drop=True)
  99. df_split = pd.DataFrame({"participant_id": df["participant_id"], "Age": df["Age"]})
  100. strat = stratify_key(df_split, cfg.age_bins)
  101. # Split TRAIN vs (VAL+HELDOUT)
  102. sss = StratifiedShuffleSplit(
  103. n_splits=1, test_size=cfg.valheldout_size, random_state=cfg.seed)
  104. train_idx, valheld_idx = next(sss.split(df_split["participant_id"], strat))
  105. df_train = df.iloc[train_idx].copy()
  106. df_valheld = df.iloc[valheld_idx].copy()
  107. # Split (VAL+HELDOUT) into VAL and HELDOUT
  108. sss2 = StratifiedShuffleSplit(
  109. n_splits=1, test_size=cfg.heldout_frac_within_val, random_state=cfg.seed)
  110. strat2 = stratify_key(df_valheld[["Age"]].assign(participant_id=df_valheld["participant_id"]), cfg.age_bins)
  111. val_idx, held_idx = next(sss2.split(df_valheld["participant_id"], strat2))
  112. # Smaller subset becomes validation, remainder heldout (consistent naming)
  113. df_val = df_valheld.iloc[held_idx].copy()
  114. df_held = df_valheld.iloc[val_idx].copy()
  115. # Save split manifests
  116. cfg.outdir.mkdir(parents=True, exist_ok=True)
  117. df_train[["participant_id"]].to_csv(cfg.outdir / "train_participants.csv", index=False)
  118. df_val[["participant_id"]].to_csv(cfg.outdir / "val_participants.csv", index=False)
  119. df_held[["participant_id"]].to_csv(cfg.outdir / "heldout_participants.csv", index=False)
  120. df_train[["participant_id"] + feature_cols].to_csv(cfg.outdir / "train_features.csv", index=False)
  121. df_val [["participant_id"] + feature_cols].to_csv(cfg.outdir / "val_features.csv", index=False)
  122. df_held [["participant_id"] + feature_cols].to_csv(cfg.outdir / "heldout_features.csv", index=False)
  123. # Scale
  124. scaler = StandardScaler()
  125. X_train = scaler.fit_transform(df_train[feature_cols].values).astype("float32")
  126. X_val = scaler.transform(df_val[feature_cols].values).astype("float32")
  127. # Build models
  128. n_features = X_train.shape[1]
  129. encoder = make_encoder_model_v1(n_features, list(cfg.h_dim), cfg.z_dim)
  130. decoder = make_decoder_model_v1(cfg.z_dim, n_features, list(cfg.h_dim)[::-1])
  131. discriminator = make_discriminator_model_v1(cfg.z_dim, list(cfg.h_dim)[::-1])
  132. # Losses
  133. bce = tf.keras.losses.BinaryCrossentropy(from_logits=True)
  134. mse = tf.keras.losses.MeanSquaredError()
  135. def d_loss(real_out, fake_out):
  136. return bce(tf.ones_like(real_out), real_out) + bce(tf.zeros_like(fake_out), fake_out)
  137. def g_loss(fake_out):
  138. return bce(tf.ones_like(fake_out), fake_out)
  139. # Optimizers (CLR-updated per step)
  140. ae_opt = keras.optimizers.Adam(learning_rate=cfg.base_lr)
  141. d_opt = keras.optimizers.Adam(learning_rate=cfg.base_lr)
  142. g_opt = keras.optimizers.Adam(learning_rate=cfg.base_lr)
  143. # tf.data pipeline (deterministic ordering and seeded shuffle)
  144. ds = tf.data.Dataset.from_tensor_slices(X_train)
  145. ds = ds.shuffle(buffer_size=len(df_train), seed=cfg.seed, reshuffle_each_iteration=True).batch(cfg.batch_size)
  146. options = tf.data.Options()
  147. options.experimental_deterministic = True
  148. ds = ds.with_options(options)
  149. # ---- Cyclical Learning Rate (CLR) setup ----
  150. n_samples = X_train.shape[0]
  151. step_size = cfg.step_size if cfg.step_size is not None else int(2 * np.ceil(n_samples / cfg.batch_size))
  152. def scale_fn(cycle):
  153. return cfg.gamma ** cycle
  154. global_step = 0
  155. @tf.function
  156. def train_step(xb, ae_lr, d_lr, g_lr):
  157. ae_opt.learning_rate.assign(tf.cast(ae_lr, tf.float32))
  158. d_opt.learning_rate.assign(tf.cast(d_lr, tf.float32))
  159. g_opt.learning_rate.assign(tf.cast(g_lr, tf.float32))
  160. # Autoencoder
  161. with tf.GradientTape() as t_ae:
  162. z = encoder(xb, training=True)
  163. xhat = decoder(z, training=True)
  164. ae_loss = mse(xb, xhat)
  165. ae_grads = t_ae.gradient(ae_loss, encoder.trainable_variables + decoder.trainable_variables)
  166. ae_opt.apply_gradients(zip(ae_grads, encoder.trainable_variables + decoder.trainable_variables))
  167. # Discriminator
  168. with tf.GradientTape() as t_d:
  169. z_real = tf.random.normal([tf.shape(xb)[0], cfg.z_dim])
  170. z_fake = encoder(xb, training=True)
  171. d_real = discriminator(z_real, training=True)
  172. d_fake = discriminator(z_fake, training=True)
  173. loss_d = d_loss(d_real, d_fake)
  174. d_grads = t_d.gradient(loss_d, discriminator.trainable_variables)
  175. d_opt.apply_gradients(zip(d_grads, discriminator.trainable_variables))
  176. # Generator/Encoder
  177. with tf.GradientTape() as t_g:
  178. z_fake = encoder(xb, training=True)
  179. d_fake = discriminator(z_fake, training=True)
  180. loss_g = g_loss(d_fake)
  181. g_grads = t_g.gradient(loss_g, encoder.trainable_variables)
  182. g_opt.apply_gradients(zip(g_grads, encoder.trainable_variables))
  183. return ae_loss, loss_d, loss_g
  184. # Training loop with EarlyStopping on val AE loss
  185. best_val = np.inf
  186. best_epoch = -1
  187. history = {"ae_loss": [], "d_loss": [], "g_loss": [], "val_ae_loss": []}
  188. for epoch in range(cfg.epochs):
  189. ae_epoch, d_epoch, g_epoch = [], [], []
  190. for xb in ds:
  191. global_step += 1
  192. cycle = np.floor(1 + global_step / (2 * step_size))
  193. x_lr = np.abs(global_step / step_size - 2 * cycle + 1)
  194. clr = cfg.base_lr + (cfg.max_lr - cfg.base_lr) * max(0.0, 1.0 - x_lr) * scale_fn(cycle)
  195. clr32 = tf.constant(clr, dtype=tf.float32)
  196. ae_l, d_l, g_l = train_step(xb, clr32, clr32, clr32)
  197. ae_epoch.append(float(ae_l.numpy()))
  198. d_epoch.append(float(d_l.numpy()))
  199. g_epoch.append(float(g_l.numpy()))
  200. # Validation AE loss
  201. z_val = encoder(X_val, training=False)
  202. xhat_val = decoder(z_val, training=False)
  203. val_loss = float(mse(X_val, xhat_val).numpy())
  204. history["ae_loss"].append(np.mean(ae_epoch))
  205. history["d_loss"].append(np.mean(d_epoch))
  206. history["g_loss"].append(np.mean(g_epoch))
  207. history["val_ae_loss"].append(val_loss)
  208. print(f"Epoch {epoch:04d} | AE {np.mean(ae_epoch):.4f} | D {np.mean(d_epoch):.4f} "
  209. f"| G {np.mean(g_epoch):.4f} | VAL {val_loss:.4f} | BEST {best_val:.4f} @ {best_epoch}")
  210. # Save best
  211. if val_loss < best_val:
  212. best_val = val_loss
  213. best_epoch = epoch
  214. encoder.save(cfg.outdir / "best_encoder.h5")
  215. decoder.save(cfg.outdir / "best_decoder.h5")
  216. discriminator.save(cfg.outdir / "best_discriminator.h5")
  217. if epoch - best_epoch >= cfg.patience:
  218. break
  219. # Save final artifacts
  220. encoder.save(cfg.outdir / "encoder.h5")
  221. decoder.save(cfg.outdir / "decoder.h5")
  222. discriminator.save(cfg.outdir / "discriminator.h5")
  223. joblib.dump(scaler, cfg.outdir / "scaler.joblib")
  224. pd.DataFrame(history).to_csv(cfg.outdir / "training_history.csv", index=False)
  225. print(f"Best VAL AE loss: {best_val:.6f} @ epoch {best_epoch}")
  226. return cfg.outdir
  227. # ------------------------- Inference -------------------------
  228. def infer(models_dir: Path, features_csv: Path, covariates_csv: Path, dataset_name: str = "test", seed: int = 0) -> Path:
  229. set_global_seeds(seed)
  230. set_tf_verbosity(quiet=True)
  231. outdir = Path(models_dir) / dataset_name
  232. outdir.mkdir(parents=True, exist_ok=True)
  233. df = load_and_merge(features_csv, covariates_csv)
  234. feature_cols = feature_cols_from_csv(features_csv)
  235. # Optional safety check:
  236. missing = [c for c in feature_cols if c not in df.columns]
  237. if missing:
  238. raise ValueError(f"Missing expected feature columns: {missing}")
  239. X = df[feature_cols].values.astype("float32")
  240. encoder = keras.models.load_model(Path(models_dir) / "best_encoder.h5", compile=False)
  241. decoder = keras.models.load_model(Path(models_dir) / "best_decoder.h5", compile=False)
  242. scaler = joblib.load(Path(models_dir) / "scaler.joblib")
  243. Xn = scaler.transform(X).astype("float32")
  244. Z = encoder(Xn, training=False)
  245. Xhat = decoder(Z, training=False)
  246. # normalized inputs
  247. norm_df = pd.DataFrame({"participant_id": df["participant_id"]})
  248. for i, c in enumerate(feature_cols):
  249. norm_df[c] = Xn[:, i]
  250. norm_df.to_csv(outdir / "normalized.csv", index=False)
  251. # reconstructions
  252. recon_df = pd.DataFrame({"participant_id": df["participant_id"]})
  253. xhat_np = Xhat.numpy()
  254. for i, c in enumerate(feature_cols):
  255. recon_df[c] = xhat_np[:, i]
  256. recon_df.to_csv(outdir / "reconstruction.csv", index=False)
  257. # latent codes
  258. enc_df = pd.DataFrame({"participant_id": df["participant_id"]})
  259. z_np = Z.numpy()
  260. for i in range(z_np.shape[1]):
  261. enc_df[f"z{i:02d}"] = z_np[:, i]
  262. enc_df.to_csv(outdir / "encoded.csv", index=False)
  263. # reconstruction error (per-subject MSE)
  264. rec_err = np.mean((Xn - xhat_np) ** 2, axis=1)
  265. pd.DataFrame({
  266. "participant_id": df["participant_id"],
  267. "Reconstruction error": rec_err}).to_csv(outdir / "reconstruction_error.csv", index=False)
  268. print(f"Wrote outputs to {outdir}")
  269. return outdir
  270. # ------------------------- CLI -------------------------
  271. def build_parser() -> argparse.ArgumentParser:
  272. p = argparse.ArgumentParser(description="AAE pipeline (train + infer) — NO-SEX condition (minimal deterministic)")
  273. sub = p.add_subparsers(dest="cmd", required=True)
  274. pt = sub.add_parser("train", help="Train models")
  275. pt.add_argument("--features_csv", required=True, type=Path)
  276. pt.add_argument("--covariates_csv", required=True, type=Path)
  277. pt.add_argument("--outdir", required=True, type=Path)
  278. pt.add_argument("--z_dim", type=int, default=20)
  279. pt.add_argument("--h_dim", type=int, nargs=2, default=[110, 110])
  280. pt.add_argument("--epochs", type=int, default=1000)
  281. pt.add_argument("--patience", type=int, default=50)
  282. pt.add_argument("--batch_size", type=int, default=200)
  283. pt.add_argument("--seed", type=int, default=0)
  284. pt.add_argument("--valheldout_size", type=float, default=0.35)
  285. pt.add_argument("--heldout_frac_within_val", type=float, default=0.40)
  286. # CLR
  287. pt.add_argument("--base_lr", type=float, default=1e-4)
  288. pt.add_argument("--max_lr", type=float, default=5e-3)
  289. pt.add_argument("--gamma", type=float, default=0.98)
  290. pt.add_argument("--step_size", type=int, default=0, help="0=auto (2 * ceil(N/batch))")
  291. # Age-bin choice
  292. pt.add_argument("--age_bins", type=int, choices=[4, 5], default=5)
  293. pi = sub.add_parser("infer", help="Run inference with trained models")
  294. pi.add_argument("--models_dir", required=True, type=Path)
  295. pi.add_argument("--features_csv", required=True, type=Path)
  296. pi.add_argument("--covariates_csv", required=True, type=Path)
  297. pi.add_argument("--name", default="test", help="Output subfolder name (e.g., val/heldout/test)")
  298. pi.add_argument("--seed", type=int, default=0, help="Seed for deterministic inference")
  299. return p
  300. def main():
  301. parser = build_parser()
  302. args = parser.parse_args()
  303. if args.cmd == "train":
  304. cfg = TrainConfig(
  305. project_root=Path.cwd(),
  306. features_csv=args.features_csv,
  307. covariates_csv=args.covariates_csv,
  308. outdir=args.outdir,
  309. z_dim=args.z_dim,
  310. h_dim=(args.h_dim[0], args.h_dim[1]),
  311. epochs=args.epochs,
  312. patience=args.patience,
  313. batch_size=args.batch_size,
  314. seed=args.seed,
  315. valheldout_size=args.valheldout_size,
  316. heldout_frac_within_val=args.heldout_frac_within_val,
  317. base_lr=args.base_lr,
  318. max_lr=args.max_lr,
  319. gamma=args.gamma,
  320. step_size=(None if args.step_size == 0 else args.step_size),
  321. age_bins=args.age_bins)
  322. train(cfg)
  323. elif args.cmd == "infer":
  324. infer(
  325. models_dir=args.models_dir,
  326. features_csv=args.features_csv,
  327. covariates_csv=args.covariates_csv,
  328. dataset_name=args.name,
  329. seed=args.seed)
  330. if __name__ == "__main__":
  331. main()

aa.py at commit 76d8801, under MIT · at the source

Overview

  1. AI2D Center for AI and Data Science for Integrated Diagnostics, University of Pennsylvania,Philadelphia, PA USA
  2. School of Electrical and Computer Engineering, National Technical University of Athens,Athens, Greece
  3. Department of Radiology, University of Pennsylvania,Philadelphia, PA USA
  4. Laboratory of Behavioral Neuroscience, National Institute on Aging,Baltimore, MD USA
  5. Department of Biostatistics, Epidemiology, & Informatics, University of Pennsylvania,Philadelphia, PA USA
Journal: Nature communications, volume 17, issue 1, article 5709
Dates: received 21 April 2025; accepted 6 April 2026; published online 25 April 2026
Type: Research article · Language: English
License: CC BY-NC-ND
Identifiers: DOI 10.1038/s41467-026-72091-7 · PMID 42034902 · PMCID PMC13319776 · OpenAlex W7155606518
Open access: gold, a free copy (OpenAlex)
Status: code verified
Categories: structural MRI / diffusion (modality), human (organism), Alzheimer's / dementia (population)
Methods: Connectivity, Statistics, Machine learning, Preprocessing, fMRI & imaging
Keywords: Prognostic markers, Magnetic resonance imaging, Machine learning, Alzheimer's disease, Neurodegeneration
MeSH: Aging*, Brain*, Aged, Cognition, Cross-Sectional Studies, Female, Humans, Longitudinal Studies, Machine Learning, Magnetic Resonance Imaging, Male, Middle Aged, Neuroimaging (* major topic)
Topic: Functional Brain Connectivity Studies (Cognitive Neuroscience, Neuroscience), according to OpenAlex
Citations: not cited yet (Europe PMC); 64 references in the paper

Abstract

The abstract is not reproduced here: the paper's license (CC BY-NC-ND) does not allow it. Read it in the paper, at the publisher or on Europe PMC.

Repositories

Its files are read in the Code ↔ Paper reader above, with 1 match between paragraphs and lines of code.

cbica/ccl_nmf_prediction

License: MIT
State: the link answers, verified on 30 September 2026
Evidence: files inventoried
Commit: ec021b5aafc9ddf7ed08f0bca1ce4b673e3bfc4f, 28 April 2025
Languages: Python (4), Shell (1)
Size: 41 files, 5 scripts
Software Heritage: archived
Found in: “Code availability”
Holds: README, license file, environment (requirements.txt, setup.cfg, setup.py), tests
Not found: CITATION.cff, continuous integration, documentation
Tools: NumPy (2 files), pandas (2 files), scikit-learn (2 files)
Availability: 1 check, the latest on 30 September 2026: the link answers
  • 30 September 2026: the link answers
7 files

IoannaSkampardoni/CCL-NMF

License: MIT
State: the link answers, verified on 30 September 2026
Evidence: files inventoried
Commit: 76d8801e3f9bf821e8a46ebf5f4c6d05349cc487, 19 September 2025
Languages: Python (6)
Size: 22 files, 6 scripts
Software Heritage: not archived
Found in: “Code availability”
Holds: README, license file, environment (pyproject.toml, requirements.txt)
Not found: CITATION.cff, tests, continuous integration, documentation
Tools: NumPy (5 files), pandas (4 files), Keras (2 files), scikit-learn (2 files), TensorFlow (2 files), statsmodels (1 file)
Availability: 1 check, the latest on 30 September 2026: the link answers
  • 30 September 2026: the link answers
8 files

Code availability statement

The paper has a code availability statement. Its license (CC BY-NC-ND) does not allow reproducing it here; in short, from what the harvester recognized in it:

Read it in the paper: doi.org/10.1038/s41467-026-72091-7.

Tracing map

Proposed by the machine: these links were found in the paper and verified at the source, without human review. The map will receive a Zenodo DOI once one of the paper's authors has validated it with their ORCID.

What the map holds:

  • 2 repositories of the authors' code, each at its verified commit, with its license and how the link was found in the paper;
  • 11 scripts, each with its path and the digest of its content;
  • 1 match between paragraphs of the paper and lines of the code (method lexical-v1);
  • neither the text of the paper nor the code itself.

Its JSON (tracing-map.json) is deposited on Zenodo with its DOI once the map is validated.

Data

Datasets cited

Data availability statement

The paper has a data availability statement. Its license (CC BY-NC-ND) does not allow reproducing it here; in short, from what the harvester recognized in it:

  • it points to a dataset: Zenodo 18850194
  • it says that the data are available on request

Read it in the paper: doi.org/10.1038/s41467-026-72091-7.

Versions

The history of this record: each version stored by the harvester or made by a correction of its authors or of the maintainers of its code, and what changed in its facts. The texts of the paper (its abstract, its availability statements) are not part of it; versions that changed only those are not listed.

Version 1, 30 September 2026: the first record

Recorded: type, language, journal, volume, issue, pages, dates, 14 authors, 5 keywords, 13 MeSH terms, 1 funder, 58 references.

Cite

This paper

Skampardoni, I., Erus, G., Nasrallah, I. M., Yang, Z., Duggan, M. R., Walker, K. A., Getka, A., Baik, K., Melhem, R., Govindarajan, S. T., Resnick, S. M., Shou, H., Nikita, K., & Davatzikos, C. (2026). Coupled cross-sectional and longitudinal non-negative matrix factorization reveals dominant brain aging trajectories in 48,949 individuals. Nature communications, 17(1), 5709. https://doi.org/10.1038/s41467-026-72091-7

BibTeX

@article{skampardoni2026coupled,
author = {Skampardoni, Ioanna and Erus, Guray and Nasrallah, Ilya M. and Yang, Zhijian and Duggan, Michael R. and Walker, Keenan A. and Getka, Alexander and Baik, Kyunglok and Melhem, Randa and Govindarajan, Sindhuja T. and Resnick, Susan M. and Shou, Haochang and Nikita, Konstantina and Davatzikos, Christos},
title = {{Coupled cross-sectional and longitudinal non-negative matrix factorization reveals dominant brain aging trajectories in 48,949 individuals}},
journal = {Nature communications},
year = {2026},
month = apr,
volume = {17},
number = {1},
pages = {5709},
publisher = {Nature Publishing Group},
issn = {2041-1723},
doi = {10.1038/s41467-026-72091-7},
url = {https://doi.org/10.1038/s41467-026-72091-7},
pmid = {42034902},
pmcid = {PMC13319776}
}

RIS

TY - JOUR
AU - Skampardoni, Ioanna
AU - Erus, Guray
AU - Nasrallah, Ilya M.
AU - Yang, Zhijian
AU - Duggan, Michael R.
AU - Walker, Keenan A.
AU - Getka, Alexander
AU - Baik, Kyunglok
AU - Melhem, Randa
AU - Govindarajan, Sindhuja T.
AU - Resnick, Susan M.
AU - Shou, Haochang
AU - Nikita, Konstantina
AU - Davatzikos, Christos
TI - Coupled cross-sectional and longitudinal non-negative matrix factorization reveals dominant brain aging trajectories in 48,949 individuals
T2 - Nature communications
J2 - Nat Commun
PY - 2026
DA - 2026/04/25
VL - 17
IS - 1
SP - 5709
SN - 2041-1723
PB - Nature Publishing Group
DO - 10.1038/s41467-026-72091-7
UR - https://doi.org/10.1038/s41467-026-72091-7
LA - en
ER -

CSL-JSON

{
"id": "10.1038/s41467-026-72091-7",
"type": "article-journal",
"title": "Coupled cross-sectional and longitudinal non-negative matrix factorization reveals dominant brain aging trajectories in 48,949 individuals",
"container-title": "Nature communications",
"author": [
{
"family": "Skampardoni",
"given": "Ioanna"
},
{
"family": "Erus",
"given": "Guray"
},
{
"family": "Nasrallah",
"given": "Ilya M."
},
{
"family": "Yang",
"given": "Zhijian"
},
{
"family": "Duggan",
"given": "Michael R."
},
{
"family": "Walker",
"given": "Keenan A."
},
{
"family": "Getka",
"given": "Alexander"
},
{
"family": "Baik",
"given": "Kyunglok"
},
{
"family": "Melhem",
"given": "Randa"
},
{
"family": "Govindarajan",
"given": "Sindhuja T."
},
{
"family": "Resnick",
"given": "Susan M."
},
{
"family": "Shou",
"given": "Haochang"
},
{
"family": "Nikita",
"given": "Konstantina"
},
{
"family": "Davatzikos",
"given": "Christos"
}
],
"container-title-short": "Nat Commun",
"volume": "17",
"issue": "1",
"page": "5709",
"DOI": "10.1038/s41467-026-72091-7",
"PMID": "42034902",
"PMCID": "PMC13319776",
"ISSN": "2041-1723",
"publisher": "Nature Publishing Group",
"URL": "https://doi.org/10.1038/s41467-026-72091-7",
"language": "en",
"issued": {
"date-parts": [
[
2026,
4,
25
]
]
}
}

The tracing map gets a citation of its own once an author has validated it and it has a DOI.

Similar papers

The papers with a page that share the most with this one: the tools found in their code, their categories, datasets, cited references and authors, the rarest counting most.

[1] doi:10.3390/bioengineering13070844 [code]
Mapping Neuroanatomical Heterogeneity of Brain Aging Within a Clinically Defined Aging Reference Cohort.
Journal: Bioengineering (Basel, Switzerland)
In common: scikit-learn, pandas, NumPy, structural MRI / diffusion, 7 references
[2] doi:10.1162/imag.a.1355 [code]
Taming dimensionality in big neuroimaging data: Efficient orthonormal projective NMF via stochastic learning and data compression.
Journal: Imaging neuroscience (Cambridge, Mass.)
In common: scikit-learn, pandas, NumPy, structural MRI / diffusion, 7 references
[3] doi:10.1038/s41467-026-74515-w [code]
Advancing fair and explainable machine learning for neuroimaging dementia pattern classification in multi-racial and multi-ethnic populations.
Journal: Nature communications
In common: scikit-learn, pandas, NumPy, Alzheimer's / dementia, structural MRI / diffusion, 3 references, author Christos Davatzikos
[4] doi:10.1186/s12974-026-03800-8
CMV titer associations with cognition and the plasma proteome implicate FLT1 and neurovascular mechanisms as potential moderators.
Journal: Journal of neuroinflammation
In common: Alzheimer's / dementia, 3 references, author Michael R. Duggan
[5] doi:10.1038/s41467-026-73072-6 [code]
Mapping the spatiotemporal continuum of structural connectivity development across the human connectome in youth.
Journal: Nature communications
In common: statsmodels, pandas, NumPy, structural MRI / diffusion, 2 references, author Haochang Shou
[6] doi:10.21203/rs.3.rs-9499814/v1 [code]
Plasma proteomics link menopause timing to brain aging and dementia risk
Journal: Research Square (preprint)
In common: Alzheimer's / dementia, 2 authors
[7] doi:10.1038/s41398-026-04081-8 [code]
Functional system-specific brain aging across the Alzheimer's disease continuum.
Journal: Translational psychiatry
In common: Keras, TensorFlow, statsmodels, 3 other tools, Alzheimer's / dementia, structural MRI / diffusion, 1 reference
[8] doi:10.1162/imag.a.1164 [code]
Bias and generalizability of brain age prediction models: A multi-cohort evaluation with anatomical and interpretability insights.
Journal: Imaging neuroscience (Cambridge, Mass.)
In common: Keras, TensorFlow, statsmodels, 3 other tools, Alzheimer's / dementia, structural MRI / diffusion
[9] doi:10.1177/13872877261453512 [code]
Fluorescence spectroscopy and machine learning methods for detection of Alzheimer's disease from circulating white blood cells.
Journal: Journal of Alzheimer's disease : JAD
In common: Keras, TensorFlow, statsmodels, 3 other tools, Alzheimer's / dementia
[10] doi:10.1002/ana.78203 [code]
AI-Driven Mapping of Seizure Spread Patterns.
Journal: Annals of neurology
In common: Keras, TensorFlow, statsmodels, 3 other tools, structural MRI / diffusion

Contribute

The authors of this paper can claim it, correct its record and validate its tracing map, and the maintainers of its code (its owner, or a public member of its organization) correct what it says of their repository; anyone signed in can ask for its removal. Every request goes to OSCR's own machine, which answers it; your account page follows them.

Sign in with ORCID to claim this paper as one of its authors, correct its record or validate its tracing map: when the paper's metadata lists your ORCID iD, you are recognized at once. Maintainers of its code: sign in with GitHub, then claim the repository on your account page.

Request its removal

To ask OSCR to remove this record, the copies of its authors' scripts or its tracing map, use the removal request page: signed in, you say who you are, what to remove and why, then review and confirm the request. Published rules decide every request (how).

Discussion, reproductions, activity

Discussion: questions and error reports about this paper and its code, from signed-in readers and its authors. It opens with sign-in.

Reproductions: reports from readers who ran the authors' code: what they reproduced, with which environment, commit and data. It opens with sign-in.

Activity: what happens around this paper: new versions of its record, its map's validation, discussions and reproductions. It opens with sign-in.