MétaCan
Menu
Back to cohort
Record W2902415114 · doi:10.1137/1.9781611975673.66

LSCP: Locally Selective Combination in Parallel Outlier Ensembles

2019· book-chapter· en· W2902415114 on OpenAlexaff
Yue Zhao, Zain Nasrullah, Maciej K. Hryniewicki, Zheng Li

Bibliographic record

VenueSociety for Industrial and Applied Mathematics eBooks · 2019
Typebook-chapter
Languageen
FieldComputer Science
TopicAnomaly Detection Techniques and Applications
Canadian institutionsPricewaterhouseCoopers (Canada)University of Toronto
Fundersnot available
KeywordsOutlierLinear subspaceAnomaly detectionComputer scienceBase (topology)Task (project management)Stability (learning theory)Artificial intelligencePattern recognition (psychology)Data miningLocal outlier factorFeature (linguistics)Machine learningMathematicsEngineering

Abstract

fetched live from OpenAlex

In unsupervised outlier ensembles, the absence of ground truth makes the combination of base outlier detectors a challenging task. Specifically, existing parallel outlier ensembles lack a reliable way of selecting competent base detectors, affecting accuracy and stability, during model combination. In this paper, we propose a framework—called Locally Selective Combination in Parallel Outlier Ensembles (LSCP)—which addresses the issue by defining a local region around a test instance using the consensus of its nearest neighbors in randomly selected feature subspaces. The top-performing base detectors in this local region are selected and combined as the model's final output. Four variants of the LSCP framework are compared with seven widely used parallel frameworks. Experimental results demonstrate that one of these variants, LSCP_AOM, consistently outperforms baselines on the majority of twenty real-world datasets.

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.005
metaresearch head score (Gemma)0.008
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.006
Threshold uncertainty score0.026

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.008
Meta-epidemiology (narrow)0.0030.001
Meta-epidemiology (broad)0.0030.002
Bibliometrics0.0020.002
Science and technology studies0.0010.001
Scholarly communication0.0020.003
Open science0.0040.006
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0020.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.039
GPT teacher head0.240
Teacher spread0.201 · 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

Citations139
Published2019
Admission routes1
Has abstractyes

Explore more

Same venueSociety for Industrial and Applied Mathematics eBooksSame topicAnomaly Detection Techniques and ApplicationsFrench-language works237,207