Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Graph-based semisupervised learning.

Mark Culp1, George Michailidis

  • 1Department of Statistics, West Virginia University, Morgantown, WV 26506, USA. culpm@umich.edu

IEEE Transactions on Pattern Analysis and Machine Intelligence
|November 15, 2007
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

DNEA: an R package for fast and versatile data-driven network analysis of metabolomics data.

BMC bioinformatics·2024
Same author

Novel biomarkers derived from the Maintenance of Wakefulness Test as predictors of sleepiness and response to treatment.

Sleep·2024
Same author

Returners and explorers dichotomy in the face of natural hazards.

Scientific reports·2024
Same author

Retraction: Tobacco-specific Carcinogens Induce Hypermethylation, DNA Adducts, and DNA Damage in Bladder Cancer.

Cancer prevention research (Philadelphia, Pa.)·2024
Same author

Role of adenosine deaminase in prostate cancer progression.

American journal of clinical and experimental urology·2023
Same author

CorrelationCalculator and Filigree: Tools for Data-Driven Network Analysis of Metabolomics Data.

Journal of visualized experiments : JoVE·2023
Same journal

Benchmarking the Robustness of Autonomous Driving to Environmental Illusions: A Lane Perception Perspective.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Learning Topology-Aware Representations via Test-Time Adaptation for Anomaly Segmentation.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

TraGraph-GS: Trajectory Graph-based Gaussian Splatting for Arbitrary Large-Scale Scene Rendering.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

SWIFT: A Small-World Interaction Framework for Flow-Aware Trajectory Prediction in Autonomous Driving.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

HardFlow: Hard-Constrained Sampling for Flow-Matching Models Via Trajectory Optimization.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Industrial Brain: Self-Evolving Neuro-Symbolic Autonomy with Causal Resilience for Cyber-Physical Systems.

IEEE transactions on pattern analysis and machine intelligence·2026
See all related articles

This study introduces a novel graph classifier using kernel smoothing for classification tasks. The semi-supervised learning approach demonstrates strong performance, particularly when labeled data is scarce.

Area of Science:

  • Machine Learning
  • Data Science
  • Computer Science

Background:

  • Graph-based learning is effective for classification.
  • The relationship between labeled and unlabeled data is crucial for classifier performance.
  • Semi-supervised learning frameworks are essential when labeled data is limited.

Purpose of the Study:

  • To propose a novel graph classifier utilizing kernel smoothing.
  • To introduce a regularization framework for the proposed classifier.
  • To demonstrate the classifier's ability to optimize specific loss functions.

Main Methods:

  • Developed a graph classifier based on kernel smoothing techniques.
  • Incorporated a regularization framework to enhance classifier performance.

Related Experiment Videos

  • Evaluated the classifier on synthetic and real-world benchmark datasets.

    • Main Results:

    • The proposed graph classifier achieved good results across various datasets.
    • Performance was notably strong in semi-supervised settings with limited labeled data.
    • The classifier was shown to effectively optimize defined loss functions.

    Conclusions:

    • The kernel smoothing-based graph classifier is a viable and effective approach for classification tasks.
    • This method shows particular promise for scenarios with scarce labeled data.
    • The regularization framework contributes to the classifier's optimized performance.