MétaCan
Menu
Back to cohort
Record W4405850275 · doi:10.36548/jitdw.2024.4.002

Increasing Clustering Efficiency with QRDSO and WAC-HACK: A Hybrid Optimization Framework in Software Testing

2024· article· en· W4405850275 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

VenueJournal of Information Technology and Digital World · 2024
Typearticle
Languageen
FieldComputer Science
TopicSoftware Testing and Debugging Techniques
Canadian institutionsPotashCorp (Canada)
Fundersnot available
KeywordsCluster analysisSoftware testingComputer scienceSoftwareArtificial intelligenceProgramming language

Abstract

fetched live from OpenAlex

Clustering is a fundamental concept of unsupervised learning, that helps in arranging similar objects into groups based on some similarity. Nevertheless, it is difficult to increase clustering efficiency for a large dataset. Therefore, the research combines QRDSO (Quantum-Driven Differential Search Optimization) and WAC-HACK (Weighted Adaptive Clustering using Hierarchical and K-means), presenting a hybrid framework of optimization. QRDSO employs quantum-based computation to enhance the exploring properties and convergence rates of hashing search in complex datasets, while WAC-HACK adjusts this clustering by using adaptive hierarchical approaches which guarantees an improved cluster assignment. These strategies jointly enhance the accuracy of clustering, reduce computational overhead, and aid the acquisition of data structure more effectively, especially in high-dimensional domains such as image analysis similar to TF-IDF which serves for text mining with bioinformatics. The proposed algorithm has improved its performance over existing techniques, making it a good candidate for large datasets and multi-dimensional clustering problems.

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.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.904
Threshold uncertainty score0.632

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0020.001
Science and technology studies0.0000.000
Scholarly communication0.0010.003
Open science0.0000.000
Research integrity0.0000.000
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.007
GPT teacher head0.221
Teacher spread0.214 · 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