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

152
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...
152
Improving Translational Accuracy02:07

Improving Translational Accuracy

11.8K
Base complementarity between the three base pairs of mRNA codon and the tRNA anticodon is not a failsafe mechanism. Inaccuracies can range from a single mismatch to no correct base pairing at all. The free energy difference between the correct and nearly correct base pairs can be as small as 3 kcal/ mol. With complementarity being the only proofreading step, the estimated error frequency would be one wrong amino acid in every 100 amino acids incorporated. However, error frequencies observed in...
11.8K
Conservation of Protein Domains Over Different Proteins02:26

Conservation of Protein Domains Over Different Proteins

11.2K
Protein domains are small structurally independent units that are part of a single amino acid chain.  Although these domains are often structurally independent, they may rely on synergistic effects to perform their functions as part of a larger protein. Protein domains may be conserved within the same organism, as well as across different organisms.
A limited set of protein domains often duplicate and recombine during evolution. These domains can be organized in different combinations to...
11.2K
Generalization, Discrimination, and Extinction01:24

Generalization, Discrimination, and Extinction

771
Generalization, discrimination, and extinction are key concepts in operant conditioning that influence how behaviors are learned and maintained.
Generalization occurs when a behavior reinforced in one context is performed in similar situations. For instance, a student who studies diligently for calculus and receives excellent grades might apply the same study habits to psychology and history, expecting similar results. Generalization shows how learning in one setting can influence behavior in...
771
Downsampling01:20

Downsampling

244
When considering a sampled sequence with zero values between sampling instants, one can replace it by taking every N-th value of the sequence. At these integer multiples of N, the original and sampled sequences coincide. This process, known as decimation, involves extracting every N-th sample from a sequence, thereby creating a more efficient sequence.
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
244
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

129
Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
129

You might also read

Related Articles

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

Sort by
Same author

GUSL: A novel and efficient machine learning model for prostate segmentation on MRI.

Computers in biology and medicine·2026
Same author

Open-Geometry PET: Quantifying the Trade-off Between Time-of-Flight Resolution and Angular Coverage.

Physics in medicine and biology·2026
Same author

A scoping review of traditional and artificial intelligence methods in malaria diagnostics.

NPJ digital medicine·2026
Same author

An Open Multi-Center Whole-Body FDG PET/CT Foundation Model for Tumor Segmentation.

ArXiv·2026
Same author

Influence of an AQP4 haplotype and sleep duration on early Alzheimer's disease.

Alzheimer's & dementia : the journal of the Alzheimer's Association·2026
Same author

CROSS-MODAL FINE-TUNING OF 3D CONVOLUTIONAL FOUNDATION MODELS FOR ADHD CLASSIFICATION WITH LOW-RANK ADAPTATION.

Proceedings. IEEE International Symposium on Biomedical Imaging·2026
Same journal

Intervention Feasible Region and Driver Risk Capacity Aware Human-Machine Collaborative Safe Trajectory Planning.

IEEE transactions on neural networks and learning systems·2026
Same journal

A Unified Differential Denoising Learning Framework With a Pre-Trained Model and Fuzzy Graph Networks for Drug-Drug Interaction Prediction.

IEEE transactions on neural networks and learning systems·2026
Same journal

Self-Supervised Continuous Dynamic Graph Representation Learning via Hawkes Processes.

IEEE transactions on neural networks and learning systems·2026
Same journal

cPU: Consistent Risk Estimator for Positive-Unlabeled Learning.

IEEE transactions on neural networks and learning systems·2026
Same journal

Tuning-Free Latent Diffusion Models for Ultrahigh-Resolution Image Editing.

IEEE transactions on neural networks and learning systems·2026
Same journal

Hidden Data Recovery and Forecasting via Next-Generation Reservoir Computing With Multiscale Delay Selection.

IEEE transactions on neural networks and learning systems·2026
See all related articles

Related Experiment Video

Updated: Sep 3, 2025

Augmenting Large Language Models via Vector Embeddings to Improve Domain-Specific Responsiveness
03:14

Augmenting Large Language Models via Vector Embeddings to Improve Domain-Specific Responsiveness

Published on: December 6, 2024

675

Subtype-Aware Dynamic Unsupervised Domain Adaptation.

Xiaofeng Liu, Fangxu Xing, Jane You

    IEEE Transactions on Neural Networks and Learning Systems
    |July 27, 2022
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces a novel subtype-aware unsupervised domain adaptation (UDA) method. It enhances knowledge transfer by aligning fine-grained subtypes, improving target domain performance without subtype labels.

    More Related Videos

    Author Spotlight: AI-Driven Trypanosome Species Detection from Microscopic Images
    08:20

    Author Spotlight: AI-Driven Trypanosome Species Detection from Microscopic Images

    Published on: October 27, 2023

    1.6K

    Related Experiment Videos

    Last Updated: Sep 3, 2025

    Augmenting Large Language Models via Vector Embeddings to Improve Domain-Specific Responsiveness
    03:14

    Augmenting Large Language Models via Vector Embeddings to Improve Domain-Specific Responsiveness

    Published on: December 6, 2024

    675
    Author Spotlight: AI-Driven Trypanosome Species Detection from Microscopic Images
    08:20

    Author Spotlight: AI-Driven Trypanosome Species Detection from Microscopic Images

    Published on: October 27, 2023

    1.6K

    Area of Science:

    • Computer Science
    • Machine Learning
    • Artificial Intelligence

    Background:

    • Unsupervised Domain Adaptation (UDA) transfers knowledge from labeled source to unlabeled target domains.
    • Transferable Prototypical Networks (TPNs) align class centers but overlook fine-grained subtype structures.
    • Cross-domain within-class compactness remains an underexplored area in UDA.

    Purpose of the Study:

    • To develop a fine-grained subtype-aware alignment approach for UDA.
    • To improve target domain performance by addressing unlabeled subtype structures.
    • To investigate UDA methods with and without prior knowledge of subtype numbers.

    Main Methods:

    • Proposed an adaptive, fine-grained subtype-aware alignment strategy.
    • Enforced subtype-wise compactness and class-wise separation using pseudo-labels.
    • Developed a dynamic queue framework for stable subtype cluster centroid evolution.

    Main Results:

    • Demonstrated improved performance in the target domain.
    • Validated the approach on multiview congenital heart disease data, VisDA, and DomainNet datasets.
    • Showcased the effectiveness compared to state-of-the-art UDA methods.

    Conclusions:

    • The proposed subtype-aware UDA effectively handles unlabeled subtypes.
    • The method improves cross-domain alignment by considering fine-grained structures.
    • This approach offers a robust solution for UDA challenges with complex data distributions.