MétaCan
Menu
Back to cohort
Record W862919699 · doi:10.1609/aaai.v29i1.9544

On the Equivalence of Linear Discriminant Analysis and Least Squares

2015· article· en· W862919699 on OpenAlexaff
Kibok Lee, Junmo Kim

Bibliographic record

VenueProceedings of the AAAI Conference on Artificial Intelligence · 2015
Typearticle
Languageen
FieldComputer Science
TopicFace and Expression Recognition
Canadian institutionsKootenay Association for Science & Technology
FundersNational Research Foundation of KoreaMinistry of Science, ICT and Future PlanningNational Research Foundation
KeywordsLinear discriminant analysisMathematicsEigenvalues and eigenvectorsEquivalence (formal languages)Equivalence class (music)Dimensionality reductionMatrix (chemical analysis)DiscriminantPrincipal component analysisCluster analysisEigendecomposition of a matrixRange (aeronautics)Pattern recognition (psychology)AlgorithmArtificial intelligenceComputer scienceStatisticsDiscrete mathematicsPhysics

Abstract

fetched live from OpenAlex

Linear discriminant analysis (LDA) is a popular dimensionality reduction and classification method that simultaneously maximizes between-class scatter and minimizes within-class scatter. In this paper, we verify the equivalence of LDA and least squares (LS) with a set of dependent variable matrices. The equivalence is in the sense that the LDA solution matrix and the LS solution matrix have the same range. The resulting LS provides an intuitive interpretation in which its solution performs data clustering according to class labels. Further, the fact that LDA and LS have the same range allows us to design a two-stage algorithm that computes the LDA solution given by generalized eigenvalue decomposition (GEVD), much faster than computing the original GEVD. Experimental results demonstrate the equivalence of the LDA solution and the proposed LS solution.

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.014
metaresearch head score (Gemma)0.061
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.014
Threshold uncertainty score0.072

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0140.061
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0020.002
Science and technology studies0.0010.007
Scholarly communication0.0030.005
Open science0.0020.005
Research integrity0.0020.004
Insufficient payload (model declined to judge)0.0030.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.142
GPT teacher head0.314
Teacher spread0.171 · 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 designTheoretical or conceptual
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

Citations7
Published2015
Admission routes1
Has abstractyes

Explore more

Same venueProceedings of the AAAI Conference on Artificial IntelligenceSame topicFace and Expression RecognitionFrench-language works237,207