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 Concept Videos

Survival Tree01:19

Survival Tree

50
Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
 Building a Survival Tree
Constructing a...
50

You might also read

Related Articles

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

Sort by
Same author

Unsupervised feature selection via row-sparse local preserving projection.

Neural networks : the official journal of the International Neural Network Society·2026
Same author

A Unified Framework for Pseudo-Supervised Clustering via Weighted Sample Aggregation.

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

Projection with mixed-size anchor graphs.

Neural networks : the official journal of the International Neural Network Society·2026
Same author

SimMTC: Simple Multi-View Tensor Clustering.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same author

Unsupervised fine-tuning of vision-language models by fusing classifier tuning and visual prompt tuning.

Neural networks : the official journal of the International Neural Network Society·2026
Same author

IB2MC: Information Bottleneck Inspired Balanced Multiview Clustering.

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

Relation DETR+: Exploring Explicit Position Relation Prior for Dense Prediction.

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

RBF++: Quantifying and Optimizing Reasoning Boundaries across Measurable and Unmeasurable Capabilities for Chain-of-Thought Reasoning.

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

CAFE: Cross-View Adaptive Fusion and Cluster Center Enhancement for Robust Multi-View Clustering.

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

DIVER: Reinforced Diffusion Breaks Imitation Bottlenecks in End-to-End Autonomous Driving.

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

Ethics-Aware Safe Reinforcement Learning for Rare-Event Risk Control in Interactive Urban Driving.

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

Learning Shape Anchors for Holistic Indoor Scene Understanding.

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

Related Experiment Video

Updated: May 24, 2025

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

5.2K

Fast Semi-Supervised Learning on Large Graphs: An Improved Green-Function Method.

Feiping Nie, Yitao Song, Wei Chang

    IEEE Transactions on Pattern Analysis and Machine Intelligence
    |March 3, 2025
    PubMed
    Summary
    This summary is machine-generated.

    The Green-function method for graph-based semi-supervised learning is unstable on large, sparse graphs. A novel optimization-based approach offers improved stability and efficiency, especially with acceleration techniques.

    More Related Videos

    Author Spotlight: Advancing Large-Scale Neural Dynamics Through HD-MEA Technology
    09:44

    Author Spotlight: Advancing Large-Scale Neural Dynamics Through HD-MEA Technology

    Published on: March 8, 2024

    4.6K
    Author Spotlight: Enhancement of Salient Object Detection for Smart Grid Applications
    03:31

    Author Spotlight: Enhancement of Salient Object Detection for Smart Grid Applications

    Published on: December 15, 2023

    451

    Related Experiment Videos

    Last Updated: May 24, 2025

    Generating Strictly Controlled Stimuli for Figure Recognition Experiments
    05:39

    Generating Strictly Controlled Stimuli for Figure Recognition Experiments

    Published on: March 18, 2019

    5.2K
    Author Spotlight: Advancing Large-Scale Neural Dynamics Through HD-MEA Technology
    09:44

    Author Spotlight: Advancing Large-Scale Neural Dynamics Through HD-MEA Technology

    Published on: March 8, 2024

    4.6K
    Author Spotlight: Enhancement of Salient Object Detection for Smart Grid Applications
    03:31

    Author Spotlight: Enhancement of Salient Object Detection for Smart Grid Applications

    Published on: December 15, 2023

    451

    Area of Science:

    • Machine Learning
    • Graph Theory
    • Numerical Analysis

    Background:

    • Graph-based semi-supervised learning utilizes the Green-function method for computation.
    • The Green-function method exhibits instability and poor performance on large, sparse graphs.

    Purpose of the Study:

    • To analyze the limitations of the Green-function method on large, sparse graphs.
    • To propose a novel, optimization-based method for improved performance.
    • To enhance the proposed method for greater efficiency and stability.

    Main Methods:

    • Analysis of the Green-function method's behavior on different graph structures.
    • Development of a new optimization-based approach.
    • Integration of acceleration techniques: Gaussian Elimination and Anchored Graphs.

    Main Results:

    • The proposed method provides an alternative interpretation of the Green-function method on fully connected graphs.
    • The new approach explains the instability of the Green-function method on large sparse graphs.
    • The improved method demonstrates enhanced efficiency, accuracy, and stability on large graphs.

    Conclusions:

    • The novel optimization-based method offers a stable and efficient alternative for graph-based semi-supervised learning.
    • Acceleration techniques significantly improve the scalability of the proposed method.
    • The improved Green's function method is robust for large-scale graph analysis.