Jove
Visualize
Contáctanos
JoVE
x logofacebook logolinkedin logoyoutube logo
ACERCA DE JoVE
Visión GeneralLiderazgoBlogCentro de Ayuda JoVE
AUTORES
Proceso de PublicaciónConsejo EditorialAlcance y PolíticasRevisión por ParesPreguntas FrecuentesEnviar
BIBLIOTECARIOS
TestimoniosSuscripcionesAccesoRecursosConsejo Asesor de BibliotecasPreguntas Frecuentes
INVESTIGACIÓN
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchivo
EDUCACIÓN
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualCentro de Recursos para ProfesoresSitio de Profesores
Términos y Condiciones de Uso
Política de Privacidad
Políticas

Videos de Conceptos Relacionados

Fundamental Theorem of Algebra01:30

Fundamental Theorem of Algebra

The Fundamental Theorem of Algebra is central to the study of polynomial equations, asserting that every non-constant polynomial with complex coefficients has at least one complex zero. This means that a polynomial of degree n ≥ 1, written as:  with an ≠ 0, has at least one solution in the complex number system. Since the set of real numbers is a subset of complex numbers, this theorem applies equally to polynomials with real coefficients.Building on this result, the Complete Factorization...
Complex Zeros01:29

Complex Zeros

Complex zeros are the solutions to polynomial equations that include imaginary numbers, specifically, numbers of the form a + bi, where a and b are real numbers and i is the imaginary unit defined by i2=-1. These zeros satisfy the equation P(x) = 0, where P(x) is a polynomial with real or complex coefficients. Since the complex number system includes all real numbers, it provides a complete framework for analyzing all possible roots of a polynomial.Every polynomial of degree n≥1 can be...
Application of Nonlinear Inequalities01:29

Application of Nonlinear Inequalities

A nonlinear inequality describes a comparison involving an expression that curves or behaves more complexly than a straight line. These inequalities often appear in forms that include squares, products, or variables in the denominator.To solve such an inequality, one starts by rewriting it so that zero appears on one side. For example, the inequality:  can be factored as: This form makes it easier to identify the values that cause the expression to equal zero. In this case, the key values are 3...
Gaussian Elimination: Problem Solving01:30

Gaussian Elimination: Problem Solving

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...
Partial Fractions01:28

Partial Fractions

A partial fraction is a component of a rational expression represented as the sum of simpler fractions. When a rational function is expressed as a ratio of two polynomials, it can often be decomposed into a sum of fractions whose denominators are simpler polynomials, typically linear or irreducible quadratic factors. This process is called partial fraction decomposition, and it is used to simplify complex expressions for integration, solving equations, or analysis.Partial fraction decomposition...
Synthetic Disvision of Polynomials01:28

Synthetic Disvision of Polynomials

Synthetic division is an efficient algorithmic approach for dividing a polynomial by a linear binomial of the form x - c, where c is a real number. This method is helpful due to its streamlined process, which avoids the more cumbersome steps involved in the traditional long division of polynomials. It simplifies computation and serves as a practical tool for evaluating polynomials and identifying their factors.To perform synthetic division, one begins by listing the coefficients of the...

También podría leer

Artículos Relacionados

Artículos vinculados a este trabajo por autores compartidos, revista y gráfico de citas.

Ordenar por
Same author

Integrating EM and Patch-seq data: Synaptic connectivity and target specificity of predicted Sst transcriptomic types.

bioRxiv : the preprint server for biology·2023
Same author

Serum Wisteria floribunda agglutinin-positive Mac-2-binding protein can reflect systemic lupus erythematosus activity.

Lupus·2017
Same author

Thromboelastography as a Predictor of Outcomes Following Liver Transplantation.

Transplantation proceedings·2017
Same author

Waitlist Outcomes for Patients Relisted Following Failed Donation After Cardiac Death Liver Transplant: Implications for Awarding Model for End-Stage Liver Disease Exception Scores.

American journal of transplantation : official journal of the American Society of Transplantation and the American Society of Transplant Surgeons·2017
Same author

Noneligible Donors as a Strategy to Decrease the Organ Shortage.

American journal of transplantation : official journal of the American Society of Transplantation and the American Society of Transplant Surgeons·2016
Same author

Early Allograft Dysfunction After Liver Transplantation Is Associated With Short- and Long-Term Kidney Function Impairment.

American journal of transplantation : official journal of the American Society of Transplantation and the American Society of Transplant Surgeons·2015

Video Experimental Relacionado

Updated: Jul 6, 2026

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

Aprender las partes de los objetos mediante la factorización de matrices no negativas.

D D Lee1, H S Seung

  • 1Bell Laboratories, Lucent Technologies, Murray Hill, New Jersey 07974, USA.

Nature
|November 5, 1999
PubMed
Resumen

Este estudio introduce un nuevo algoritmo, la factorización de matriz no negativa (NMF, por sus siglas en inglés), que aprende partes de objetos para un mejor reconocimiento. A diferencia de otros métodos, NMF utiliza restricciones para permitir combinaciones aditivas, revelando representaciones basadas en partes.

Más Videos Relacionados

Using Cholesky Decomposition to Explore Individual Differences in Longitudinal Relations between Reading Skills
06:52

Using Cholesky Decomposition to Explore Individual Differences in Longitudinal Relations between Reading Skills

Published on: September 17, 2019

Optimization of Processing of Tiebangchui with Highland Barley Wine Based on the Box-Behnken Design Combined with the Entropy Method
09:12

Optimization of Processing of Tiebangchui with Highland Barley Wine Based on the Box-Behnken Design Combined with the Entropy Method

Published on: May 19, 2023

Videos de Experimentos Relacionados

Last Updated: Jul 6, 2026

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

Using Cholesky Decomposition to Explore Individual Differences in Longitudinal Relations between Reading Skills
06:52

Using Cholesky Decomposition to Explore Individual Differences in Longitudinal Relations between Reading Skills

Published on: September 17, 2019

Optimization of Processing of Tiebangchui with Highland Barley Wine Based on the Box-Behnken Design Combined with the Entropy Method
09:12

Optimization of Processing of Tiebangchui with Highland Barley Wine Based on the Box-Behnken Design Combined with the Entropy Method

Published on: May 19, 2023

Área de la Ciencia:

  • La neurociencia computacional es la neurociencia computacional.
  • El aprendizaje automático es el aprendizaje automático.
  • Psicología cognitiva psicología cognitiva.

Sus antecedentes:

  • La evidencia psicológica y fisiológica apoya las representaciones basadas en partes en el cerebro.
  • Las teorías computacionales del reconocimiento de objetos a menudo utilizan representaciones basadas en partes.
  • El mecanismo por el cual los cerebros o las computadoras aprenden partes de objetos sigue siendo una pregunta abierta.

Objetivo del estudio:

  • Para demostrar un algoritmo capaz de aprender partes de objetos.
  • Para contrastar este enfoque con los métodos que aprenden representaciones holísticas.
  • Investigar el papel de las restricciones de no negatividad en el aprendizaje de representación.

Principales métodos:

  • Desarrolló un algoritmo de factorización de matriz no negativa (NMF).
  • Aplicado NMF para aprender partes de rostros y características semánticas del texto.
  • Comparó la NMF con el análisis de componentes principales (PCA) y la cuantización vectorial (VQ).

Principales resultados:

  • NMF aprendió con éxito representaciones basadas en partes para rostros y texto.
  • La NMF contrastaba con la PCA y la VQ, que producían representaciones holísticas.
  • Las restricciones de no negatividad en la NMF permitieron combinaciones aditivas basadas en partes.

Conclusiones:

  • La factorización de matrices no negativas proporciona un método para el aprendizaje de representaciones basadas en partes.
  • Las restricciones de no negatividad son clave para lograr representaciones basadas en partes.
  • La implementación de NMF como una red neuronal con tasas de disparo no negativas y fortalezas sinápticas naturalmente produce representaciones basadas en partes.