MétaCan
Menu
Back to cohort
Record W1966755259 · doi:10.1109/nafips.2010.5548181

A new approach to improve the accuracy of online clustering algorithm based on scatter/gather model

2010· article· en· W1966755259 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Clustering Algorithms Research
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsCluster analysisComputer scienceData miningProcess (computing)Cluster (spacecraft)Canopy clustering algorithmAlgorithmCURE data clustering algorithmCorrelation clusteringAlgorithm designData stream clusteringArtificial intelligenceMachine learning

Abstract

fetched live from OpenAlex

In cluster analysis process used in data mining which enables extracting interesting data patterns from datasets, accuracy and efficiency are the factors which play a pivotal role. Scatter/Gather is a cluster-based browsing model, and most of previous works on this model focused on efficiency of the clustering algorithm. In this paper we present an algorithm which could improve the accuracy of the online clustering algorithm while still maintain a reasonable level of efficiency. Our experiment proves that the new algorithm is more accurate than the original algorithm.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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.809
Threshold uncertainty score0.577

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0020.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.029
GPT teacher head0.316
Teacher spread0.287 · 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

Quick stats

Citations2
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Clustering Algorithms ResearchFrench-language works237,207