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

Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
Graphical Representation of Inequalities01:28

Graphical Representation of Inequalities

The graph of the equation where y equals x squared forms a curve known as a parabola. This curve acts as a boundary in the coordinate plane, dividing it into distinct regions based on the relative position of points.When the equality sign in the equation is replaced with an inequality—such as greater than, less than, greater than or equal to, or less than or equal to—the graphical representation changes from a single curve into a broader shaded area that signifies the set of all points...
Graphs of Equations in Two Variables01:30

Graphs of Equations in Two Variables

An equation with two variables, typically written in the form y = f(x) or Ax + By = C, describes a relationship between quantities represented by x and y. Each solution to such an equation is an ordered pair (x, y) that satisfies the equation when substituted. These pairs can be represented graphically to understand the variables' relationship visually.A common technique for constructing the graph of a two-variable equation is to create a value table. Begin by choosing several values for the...
Aggregates Classification01:29

Aggregates Classification

Aggregate classification is generally based on its size, petrographic characteristics, weight, and source. Size classification ranges from coarse to fine aggregates, defined by the size of the particles. Coarse aggregates are particles that do not pass through ASTM sieve No. 4, and aggregates that pass through the sieve are fine aggregates.
Petrographic classification groups aggregates based on common mineralogical characteristics. Some of the common mineral groups found in aggregates are...
Bar Graph01:07

Bar Graph

A bar graph is also called a bar chart and consists of bars that are separated from each other. It either uses horizontal or vertical bars to show comparisons among categories. The bars can be rectangles, or they can be rectangular boxes (used in three-dimensional plots). One axis of the graph represents the specific categories being compared, and the other axis shows a discrete value. In this graph, the length of the bar for each category is proportional to the number or percent of individuals...
Solving Inequalities Graphically01:24

Solving Inequalities Graphically

Solving inequalities graphically involves using a visual approach to determine where a mathematical expression meets a specific condition, such as being greater than or less than another value. By examining the position of a graph relative to the x-axis or another graph, it becomes possible to identify the range of x-values that satisfy the inequality. This method provides an intuitive understanding of solution intervals by showing where the inequality holds true.Graphical solutions to...

You might also read

Related Articles

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

Sort by
Same author

Structural equation modeling with factors and composites within the framework of the basic design.

Advances in data analysis and classification·2026
Same author

The inhibitory receptor NKG2A is expressed on T-cells during BKPyVANephropathy.

Frontiers in immunology·2026
Same author

covSTATIS: a multi-table technique for network neuroscience.

Aperture neuro·2026
Same author

Decoding cortical folding with deep learning: toward neurodevelopmental biomarkers of psychiatric disorders.

Journal of neural transmission (Vienna, Austria : 1996)·2026
Same author

Neurocognitive characterization of behaviour and mental illness through time-varying brain network analysis.

Nature communications·2026
Same author

Latent Functional PARAFAC for Modeling Multidimensional Longitudinal Data.

Psychometrika·2026

Related Experiment Video

Updated: May 28, 2026

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

Graph constrained discriminant analysis: a new method for the integration of a graph into a classification process.

Vincent Guillemot1, Arthur Tenenhaus, Laurent Le Brusquet

  • 1Laboratory of Functional Genomics-CEA, DSV, IRCM, Evry, France. Vincent.Guillemot@ibe.med.uni-muenchen.de

Plos One
|October 25, 2011
PubMed
Summary

This study introduces graph-constrained discriminant analysis (gCDA) for DNA microarray classification using gene regulatory networks (GRNs). The method demonstrates robustness to inaccurate GRN data and improves classification performance.

Related Experiment Videos

Last Updated: May 28, 2026

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Systems Biology

Background:

  • DNA microarrays generate high-dimensional data crucial for biological insights.
  • Integrating biological networks, like gene regulatory networks (GRNs), can enhance microarray data analysis.
  • Current classification methods may not fully leverage network information.

Purpose of the Study:

  • To develop a novel method, graph-constrained discriminant analysis (gCDA), for DNA microarray classification.
  • To integrate information from GRNs into the classification process.
  • To assess the performance and robustness of gCDA.

Main Methods:

  • Developed graph-constrained discriminant analysis (gCDA) to incorporate GRN data into classification.
  • Tested gCDA's performance with simulated and publicly available microarray datasets.
  • Evaluated robustness to erroneous information within integrated GRNs.

Main Results:

  • gCDA effectively integrates GRN information for improved microarray classification.
  • The method shows robustness to inaccuracies in the provided GRNs.
  • gCDA outperforms state-of-the-art classification methods on tested datasets.

Conclusions:

  • gCDA offers a powerful framework for DNA microarray classification by leveraging GRN data.
  • The approach enhances biological interpretability of classifiers.
  • gCDA is a robust and effective tool for bioinformatics analysis.