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

Ranks01:02

Ranks

Unlike parametric methods, nonparametric statistics are ideal for nominal and ordinal data, requiring fewer assumptions about the population's nature or distribution. This makes nonparametric methods easier to apply and interpret, as they do not depend on parameters like mean or standard deviation. One common approach in nonparametric analysis is to sort data according to a specific criterion. For instance, we might arrange weather data from hottest to coldest days in a month or rank cities...
Friedman Two-way Analysis of Variance by Ranks01:21

Friedman Two-way Analysis of Variance by Ranks

Friedman's Two-Way Analysis of Variance by Ranks is a nonparametric test designed to identify differences across multiple test attempts when traditional assumptions of normality and equal variances do not apply. Unlike conventional ANOVA, which requires normally distributed data with equal variances, Friedman's test is ideal for ordinal or non-normally distributed data, making it particularly useful for analyzing dependent samples, such as matched subjects over time or repeated measures from...
Sieve Analysis and Grading Curves01:19

Sieve Analysis and Grading Curves

Sieve analysis is a method used to determine the particle size distribution of aggregate materials. This process involves the following steps:
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...
First Derivative Test: Problem Solving01:25

First Derivative Test: Problem Solving

Imagine an asset price that crashes to a low point, rebounds sharply as bargain-hunters step in, and then gradually declines. Such behavior can be modeled with a smooth function whose turning points represent locally overvalued and undervalued regions. A convenient example that captures rebound followed by decay is:The high and low points of this curve are identified using the first derivative test, which determines where the function changes from increasing to decreasing or vice versa. To...
Regression Toward the Mean01:52

Regression Toward the Mean

Regression toward the mean (“RTM”) is a phenomenon in which extremely high or low values—for example, and individual’s blood pressure at a particular moment—appear closer to a group’s average upon remeasuring. Although this statistical peculiarity is the result of random error and chance, it has been problematic across various medical, scientific, financial and psychological applications. In particular, RTM, if not taken into account, can interfere when researchers try to extrapolate results...

You might also read

Related Articles

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

Sort by
Same author

Embryonic arrest at midgestation and disruption of Notch signaling produced by the absence of both epsin 1 and epsin 2 in mice.

Proceedings of the National Academy of Sciences of the United States of America·2009
Same author

Two novel SNPs in coding region of the caprine Fat-inducing transcript gene and their association with growth traits.

Molecular biology reports·2009
Same author

Reprogramming human fibroblasts using HIV-1 TAT recombinant proteins OCT4, SOX2, KLF4 and c-MYC.

Molecular biology reports·2009
Same author

Bioinformatics and microarray analysis of microRNA expression profiles of murine embryonic stem cells, neural stem cells induced from ESCs and isolated from E8.5 mouse neural tube.

Neurological research·2009
Same author

Attenuation of lipopolysaccharide-mediated left ventricular dysfunction by glutamine preconditioning.

The Journal of surgical research·2009
Same author

Differential regulation of Apak by various DNA damage signals.

Molecular and cellular biochemistry·2009

Related Experiment Video

Updated: May 7, 2026

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

Error analysis of stochastic gradient descent ranking.

Hong Chen1, Yi Tang, Luoqing Li

  • 1College of Science, Huazhong Agricultural University, Wuhan 430070, China.

IEEE Transactions on Cybernetics
|October 2, 2013
PubMed
Summary

This study introduces a kernel-based stochastic gradient descent algorithm for machine learning ranking tasks. The novel method offers a simple implementation and proven effectiveness on real-world data for improved ranking performance.

Related Experiment Videos

Last Updated: May 7, 2026

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

Area of Science:

  • Machine Learning
  • Information Retrieval
  • Computational Science

Background:

  • Ranking is a critical task in machine learning and information retrieval, with applications in recommender systems and drug discovery.
  • Existing methods for learning ranking functions can be complex to implement and analyze.

Purpose of the Study:

  • To propose a novel kernel-based stochastic gradient descent algorithm for efficient and effective ranking.
  • To provide a theoretical analysis of the algorithm's convergence rate and error bounds.
  • To validate the algorithm's performance on real-world datasets.

Main Methods:

  • A kernel-based stochastic gradient descent algorithm utilizing a least squares loss function was developed.
  • The algorithm's solution was derived using sampling and integral operators.
  • A capacity-independent analysis was employed to determine the convergence rate based on step size and regularization parameters.

Main Results:

  • The proposed algorithm demonstrated a simple implementation and provided an explicit expression for its solution.
  • Theoretical analysis yielded an explicit convergence rate for learning a ranking function.
  • Experimental results on real-world data confirmed the algorithm's effectiveness in ranking tasks.

Conclusions:

  • The developed kernel-based stochastic gradient descent algorithm is effective for machine learning ranking.
  • The novel analytical technique provides valuable insights into ranking error analysis.
  • The algorithm offers a promising solution for various ranking applications.