Multimedia Classification via Tensor Linear Discriminant Analysis
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Linear discriminant analysis (LDA) is a well-known feature-extraction technique for data analytic and pattern classification. As the dimensionality of multimedia data has increased in this big era, it is often to characterize data by tensors. Over the past two decades, researchers have thus explored to extend LDA to the general tensor space, especially in two common ways: LDA of tensors using tensor decomposition methods (by conversion of tensors to matrices) and LDA of tensors built upon the T-product. However, both of the aforementioned approaches have restrictions thereby. A critical problem about how to carry out LDA of arbitrary scatter tensors based on the Einstein product still remains unsolved by the existing methods. Therefore, we propose a novel tensor LDA (a.k.a. TLDA) approach, which can carry out the LDA of arbitrary-dimensional scatter-tensors without any need of tensor decomposition. Besides, for reducing the computation time, we also design a parallel paradigm to execute our proposed TLDA in this work. Numerical experiments conducted over real multimedia data demonstrate the efficacy of our proposed new TLDA in terms of classification accuracy. Moreover, the comparison of the classification accuracies, computational-complexities, and memory-complexities of our proposed novel TLDA scheme and other existing tensor-based LDA methods is made. By leveraging TLDA for high-dimensional feature extraction, segmentation, and user-item interaction data processing, future multimedia recommendation systems can facilitate more accurate, engaging, and satisfactory user experience over the Internet.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it