MétaCan
Menu
Back to cohort
Record W1515477238

Spectral Clustering and Kernel PCA are Learning Eigenfunctions

2004· preprint· en· W1515477238 on OpenAlexfundno aff
Yoshua Bengio, Pascal Vincent, Jean-François Paiement, Olivier Delalleau, Marie Claude Ouimet, Nicolas Le Roux

Bibliographic record

VenueÉrudit documents and data repository (Érudit Consortium, University of Montreal) · 2004
Typepreprint
Languageen
FieldComputer Science
TopicFace and Expression Recognition
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of CanadaMitacsCanada Research Chairs
KeywordsCluster analysisMathematicsSpectral clusteringKernel principal component analysisEigenfunctionKernel embedding of distributionsSmoothingEmbeddingKernel (algebra)Artificial intelligenceLaplace operatorVariable kernel density estimationKernel methodPattern recognition (psychology)Computer scienceMathematical analysisPure mathematicsEigenvalues and eigenvectorsSupport vector machinePhysics
DOInot available

Abstract

fetched live from OpenAlex

Dans cet article, on montre une équivalence directe entre la classification spectrale et l'ACP à noyau, et on montre que les deux sont des cas particuliers d'un problème plus général, celui d'apprendre les fonctions propres d'un noyau. Ces fonctions fournissent une base pour un espace de Hilbert dont le produit scalaire est défini par rapport à la densité des données. Les fonctions propres définissent une transformation de coordonnées naturelles pour de nouveaux points, alors que des méthodes comme la classification spectrale et les 'Laplacian eigenmaps' ne fournissaient un système de coordonnées que pour les exemples d'apprentissage. Cette analyse suggère aussi de nouvelles approches à l'apprentissage non-supervisé dans lesquelles on extrait des abstractions qui résument la densité des données, telles que des variétés et des classes naturelles.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.013
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.004
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.013
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.003
Science and technology studies0.0010.004
Scholarly communication0.0030.005
Open science0.0010.002
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0040.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.017
GPT teacher head0.223
Teacher spread0.206 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations44
Published2004
Admission routes1
Has abstractyes

Explore more

Same venueÉrudit documents and data repository (Érudit Consortium, University of Montreal)Same topicFace and Expression RecognitionFrench-language works237,207