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 Video

Updated: Dec 24, 2025

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

7.2K

Large Margin Gaussian Mixture Classifier With a Gabriel Graph Geometric Representation of Data Set Structure.

Luiz C B Torres, Cristiano L Castro, Frederico Coelho

    IEEE Transactions on Neural Networks and Learning Systems
    |April 15, 2020
    PubMed
    Summary
    This summary is machine-generated.

    Related Concept Videos

    Vector Algebra: Graphical Method01:10

    Vector Algebra: Graphical Method

    16.5K
    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...
    16.5K
    Gauss's Law: Planar Symmetry01:27

    Gauss's Law: Planar Symmetry

    9.2K
    A planar symmetry of charge density is obtained when charges are uniformly spread over a large flat surface. In planar symmetry, all points in a plane parallel to the plane of charge are identical with respect to the charges. Suppose the plane of the charge distribution is the xy-plane, and the electric field at a space point P with coordinates (x, y, z) is to be determined. Since the charge density is the same at all (x, y) - coordinates in the z = 0 plane, by symmetry, the electric field at P...
    9.2K
    Gauss's Law01:07

    Gauss's Law

    9.2K
    If a closed surface does not have any charge inside where an electric field line can terminate, then the electric field line entering the surface at one point must necessarily exit at some other point of the surface. Therefore, if a closed surface does not have any charges inside the enclosed volume, then the electric flux through the surface is zero. What happens to the electric flux if there are some charges inside the enclosed volume? Gauss's law gives a quantitative answer to this question.
    9.2K
    Gauss's Law: Problem-Solving01:10

    Gauss's Law: Problem-Solving

    2.5K
    Gauss's law helps determine electric fields even though the law is not directly about electric fields but electric flux. In situations with certain symmetries (spherical, cylindrical, or planar) in the charge distribution, the electric field can be deduced based on the knowledge of the electric flux. In these systems, we can find a Gaussian surface S over which the electric field has a constant magnitude. Furthermore, suppose the electric field is parallel (or antiparallel) to the area vector...
    2.5K
    Graphical Representation of Inequalities01:28

    Graphical Representation of Inequalities

    114
    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...
    114
    Probability Histograms01:17

    Probability Histograms

    13.1K
    A probability histogram is a visual representation of a probability distribution. Similar a typical histogram, the probability histogram consists of contiguous (adjoining) boxes. It has both a horizontal axis and a vertical axis. The horizontal axis is labeled with what the data represents. The vertical axis is labeled with probability. Each rectangular bar in the histogram is 1 unit wide, which suggests that the area under each bar equals the probability, P(x), where x is 1, 2, 3, and so on.
    13.1K

    You might also read

    Related Articles

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

    Sort by
    Same author

    Locally Linear Continual Learning for Time Series Based on VC-Theoretical Generalization Bounds.

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

    Validity and reliability of GAITWell portable modular system for gait analysis.

    Scientific reports·2025
    Same author

    Multiclass Graph-Based Large Margin Classifiers: Unified Approach for Support Vectors and Neural Networks.

    IEEE transactions on neural networks and learning systems·2024
    Same author

    Improved Design for Hardware Implementation of Graph-Based Large Margin Classifiers for Embedded Edge Computing.

    IEEE transactions on neural networks and learning systems·2022
    Same author

    Neural Networks Multiobjective Learning With Spherical Representation of Weights.

    IEEE transactions on neural networks and learning systems·2020
    Same author

    Computing molecular signatures as optima of a bi-objective function: method and application to prediction in oncogenomics.

    Cancer informatics·2015
    Same journal

    Granular Ball-Based Noise-Resistant Fuzzy Multineighborhood Feature Selection via Label Enhancement and Feature Graph.

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

    Fighting Evolving Spam With ARTMAP Models: A Noise-Resilient Online Detection Framework.

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

    HyperSAT: Unsupervised Hypergraph Neural Networks for Weighted MaxSAT Problems.

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

    Negation of Basic Belief Assignment in Multisource Information Fusion on Dempster-Shafer Theory With Applications in Pattern Classification.

    IEEE transactions on neural networks and learning systems·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
    See all related articles

    This study introduces a novel geometrical approach for creating large margin classifiers by analyzing data structures with Gabriel graphs. The method yields results comparable to Support Vector Machines (SVMs) without requiring complex optimization.

    Area of Science:

    • Machine Learning
    • Computational Geometry
    • Pattern Recognition

    Background:

    • Large margin classifiers are crucial for robust pattern recognition.
    • Traditional methods like Support Vector Machines (SVMs) often involve complex optimization.
    • Exploring geometrical properties of data offers alternative classification strategies.

    Purpose of the Study:

    • To present a geometrical approach for deriving large margin classifiers.
    • To leverage Gabriel graphs and geometrical support vectors for classification.
    • To offer an optimization-free alternative to existing methods.

    Main Methods:

    • Constructing a Gabriel graph to represent data set geometrical properties based on a distance metric.
    • Identifying geometrical support vectors (SVs) from the graph structure.

    More Related Videos

    Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
    13:44

    Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

    Published on: August 30, 2013

    43.5K
    Author Spotlight: Impact of Intergenic Interactions on Disease-Identifying Dark Biomarkers
    03:37

    Author Spotlight: Impact of Intergenic Interactions on Disease-Identifying Dark Biomarkers

    Published on: March 1, 2024

    1.2K

    Related Experiment Videos

    Last Updated: Dec 24, 2025

    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

    7.2K
    Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
    13:44

    Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

    Published on: August 30, 2013

    43.5K
    Author Spotlight: Impact of Intergenic Interactions on Disease-Identifying Dark Biomarkers
    03:37

    Author Spotlight: Impact of Intergenic Interactions on Disease-Identifying Dark Biomarkers

    Published on: March 1, 2024

    1.2K
  • Utilizing a Gaussian mixture model to obtain the final large margin classifier.

    • Main Results:

    • The proposed geometrical method achieves statistically equivalent results to Support Vector Machines (SVMs) across 20 data sets.
    • The method does not necessitate an optimization process, simplifying implementation.
    • The approach is scalable to large data sets, drawing parallels with the cascade SVM concept.

    Conclusions:

    • A novel geometrical approach provides an effective alternative for large margin classification.
    • The method's lack of optimization and scalability make it a promising technique.
    • Further exploration into geometrical classifier properties can enhance machine learning algorithms.