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

Quantifying and Rejecting Outliers: The Grubbs Test01:02

Quantifying and Rejecting Outliers: The Grubbs Test

Sometimes, a data set can have a recorded numerical observation that greatly  deviates from the rest of the data. Assuming that the data is normally distributed, a statistical method called the Grubbs test can be used to determine whether the observation is truly an outlier.  To perform a two-tailed Grubbs test, first, calculate the absolute difference between the outlier and the mean. Then, calculate the ratio between this difference and the standard deviation of the sample. This number is...
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...
Classification of Systems-I01:26

Classification of Systems-I

Linearity is a system property characterized by a direct input-output relationship, combining homogeneity and additivity.
Homogeneity dictates that if an input x(t) is multiplied by a constant c, the output y(t) is multiplied by the same constant. Mathematically, this is expressed as:
Classification of Systems-II01:31

Classification of Systems-II

Continuous-time systems have continuous input and output signals, with time measured continuously. These systems are generally defined by differential or algebraic equations. For instance, in an RC circuit, the relationship between input and output voltage is expressed through a differential equation derived from Ohm's law and the capacitor relation,
Survival Tree01:19

Survival Tree

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 survival tree begins...
Propagation of Uncertainty from Random Error00:59

Propagation of Uncertainty from Random Error

An experiment often consists of more than a single step. In this case, measurements at each step give rise to uncertainty. Because the measurements occur in successive steps, the uncertainty in one step necessarily contributes to that in the subsequent step. As we perform statistical analysis on these types of experiments, we must learn to account for the propagation of uncertainty from one step to the next. The propagation of uncertainty depends on the type of arithmetic operation performed on...

You might also read

Related Articles

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

Sort by
Same author

Building Multiple Classifier Systems Using Linear Combinations of Reduced Graphs.

SN computer science·2023
Same author

Approximate Graph Edit Distance in Quadratic Time.

IEEE/ACM transactions on computational biology and bioinformatics·2015
Same author

A novel word spotting method based on recurrent neural networks.

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

Graph classification by means of Lipschitz embedding.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2009
Same author

A novel connectionist system for unconstrained handwriting recognition.

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

Offline recognition of unconstrained handwritten texts using HMMs and statistical language models.

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

Comment on 'angle illusion on a picture's surface' by Hammad et al. (2008).

Spatial vision·2009
Same journal

Feature-based attentional modulation increases with stimulus separation in divided-attention tasks.

Spatial vision·2009
Same journal

Spatial distance between target and irrelevant patch modulates detection in a texture segmentation task.

Spatial vision·2009
Same journal

Inhibition related impairments of coherent motion perception in the attention-induced motion blindness paradigm.

Spatial vision·2009
Same journal

Recognition units in reading: backward masking experiments.

Spatial vision·2009
Same journal

Spatial-temporal modeling of interactive image interpretation.

Spatial vision·2009
See all related articles

Related Experiment Videos

Novel kernels for error-tolerant graph classification.

Michel Neuhaus1, Kaspar Riesen, Horst Bunke

  • 1Institute of Computer Science, University of Bern, Neubrückstrasse 10, CH-3012 Bern, Switzerland.

Spatial Vision
|October 10, 2009
PubMed
Summary
This summary is machine-generated.

This study introduces novel error-tolerant graph kernels for graph classification, enhancing pattern recognition. These kernels demonstrate superior performance across diverse datasets when combined with support vector machines.

Related Experiment Videos

Area of Science:

  • Machine Learning
  • Graph Theory
  • Pattern Recognition

Background:

  • Graph classification faces challenges due to the lack of inherent mathematical structure in graph spaces.
  • Kernel machines offer a solution by mapping graphs to feature spaces for pattern recognition.

Purpose of the Study:

  • To propose three novel error-tolerant graph kernels: diffusion, convolution, and random walk kernels.
  • To enhance graph classification by addressing limitations in existing mathematical structures.

Main Methods:

  • Developed three novel graph kernels: diffusion, convolution, and random walk kernels.
  • Kernels are designed to be closely related to graph edit distance for broad applicability.
  • Utilized support vector machines (SVMs) for classification tasks.

Main Results:

  • The proposed kernels exhibit high robustness against various types of distortion.
  • Demonstrated superior performance of the novel kernels compared to standard methods in experimental evaluations.
  • Successfully classified diverse data types including line drawings, images, diatoms, fingerprints, and molecules.

Conclusions:

  • The novel error-tolerant graph kernels provide an effective solution for graph classification.
  • These kernels offer flexibility and robustness, outperforming existing methods on complex datasets.
  • The approach advances pattern recognition in graph-based data analysis.