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

Hyperbolas01:30

Hyperbolas

514
A hyperbola is a conic section produced when a double-napped cone is intersected by a plane at an angle steeper than the slope of the cone, such that it cuts through both nappes. This intersection yields two separate, mirror-image curves known as branches, which open away from each other along the transverse axis. The nearest points on each branch to the hyperbola’s center are termed vertices, and the distance from the center to a vertex is denoted by a. Perpendicular to the transverse...
514
Geometry of Hyperbolas01:30

Geometry of Hyperbolas

580
A hyperbola consists of all points where the absolute difference of distances to two fixed points, called foci, remains constant. The standard equation isEach branch extends infinitely and approaches two asymptotes, which guide the curve’s behavior. The parameters a and b define key features: a measures the distance from the center to each vertex along the transverse axis, while b influences the slopes of the asymptotes. The asymptotes have equationsA rectangle centered at the origin with...
580
Cluster Sampling Method01:20

Cluster Sampling Method

15.4K
Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
15.4K
Mohr's Circle for Plane Strain01:18

Mohr's Circle for Plane Strain

1.3K
Mohr's circle is a crucial graphical method used to analyze plane strain by plotting strain on a set of cartesian coordinates, where the abscissa is normal strain ∈ and the ordinate is shear strain γ. Similarly to Mohr’s circle for plane stress, two points X and Y are plotted. Their coordinates are (∈x, -γXY) and (∈Y, γXY), respectively.
Mohr's circle visually represents the strain states under various conditions, which is essential for...
1.3K
Optimization Problems01:26

Optimization Problems

123
Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...
123
Gaussian Elimination: Problem Solving01:30

Gaussian Elimination: Problem Solving

262
Systems of linear equations in several variables are pivotal in modeling complex scenarios involving multiple unknowns and constraints. Such systems are widely used in various fields to represent relationships where several conditions must be simultaneously satisfied. Each variable in the system corresponds to an unknown quantity, while each equation imposes a linear constraint, leading to a structured approach for analyzing and solving real-world problems.A system of three equations with three...
262

You might also read

Related Articles

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

Sort by
Same author

Fast Exact Evaluation of Univariate Kernel Sums.

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

Related Experiment Video

Updated: Mar 14, 2026

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
05:12

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

12.0K

Clustering by Minimum Cut Hyperplanes.

David P Hofmeyr

    IEEE Transactions on Pattern Analysis and Machine Intelligence
    |September 23, 2016
    PubMed
    Summary

    This study introduces a new method for learning hyperplane separators to minimize graph cuts in unlabeled data partitioning. The efficient log-linear time algorithm achieves high-quality clustering comparable to state-of-the-art methods.

    Area of Science:

    • Machine Learning
    • Data Mining
    • Computational Geometry

    Background:

    • Minimum normalized graph cuts are effective for partitioning unlabeled data.
    • Spectral clustering popularized graph cut-based data partitioning.
    • Existing methods face challenges in efficiently learning optimal hyperplane separators.

    Purpose of the Study:

    • To develop a novel method for learning hyperplane separators that minimize graph cut objectives.
    • To enable efficient optimization through a sequence of univariate subproblems.
    • To analyze the asymptotic properties of the minimum cut hyperplane.

    Main Methods:

    • Formulating the optimization problem as a sequence of univariate subproblems.
    • Solving subproblems in log-linear time by exploiting exponential function factorization.

    More Related Videos

    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.4K
    Determination of Aggregate Surface Morphology at the Interfacial Transition Zone ITZ
    08:59

    Determination of Aggregate Surface Morphology at the Interfacial Transition Zone ITZ

    Published on: December 16, 2019

    8.8K

    Related Experiment Videos

    Last Updated: Mar 14, 2026

    ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
    05:12

    ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

    Published on: January 16, 2019

    12.0K
    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.4K
    Determination of Aggregate Surface Morphology at the Interfacial Transition Zone ITZ
    08:59

    Determination of Aggregate Surface Morphology at the Interfacial Transition Zone ITZ

    Published on: December 16, 2019

    8.8K
  • Analyzing asymptotic properties for finite and increasing data samples.

    • Main Results:

    • The proposed method solves subproblems in log-linear time.
    • Empirical runtime is also log-linear with respect to the number of data points.
    • The minimum cut hyperplane converges to the maximum margin hyperplane as a scaling parameter reduces to zero.
    • The methodology produces high-quality clustering models, outperforming state-of-the-art algorithms on benchmark datasets.

    Conclusions:

    • The novel method efficiently learns hyperplane separators for graph cut minimization.
    • The algorithm demonstrates competitive performance against existing clustering techniques.
    • The approach offers a robust and scalable solution for unlabeled data partitioning.