MétaCan
Menu
Back to cohort
Record W2120896220 · doi:10.1109/icnc.2011.6022593

Towards an optimal classification model against imbalanced data for Customer Relationship Management

2011· article· en· W2120896220 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
TopicData Mining Algorithms and Applications
Canadian institutionsYork University
Fundersnot available
KeywordsCustomer relationship managementComputer scienceData miningTask (project management)Identification (biology)Domain (mathematical analysis)CONTESTData qualityQuality (philosophy)Data modelingData scienceDatabaseEngineeringSystems engineeringMathematicsOperations management

Abstract

fetched live from OpenAlex

This paper proposes a comprehensive classification framework applicable to the analytical Customer Relationship Management (CRM) problem domain of customer identification. Effective data mining tools have for long been anticipated in CRM as a promising technique to extract from historical data the knowledge that improves the quality of all CRM functions. However, standardized CRM data mining processes are yet to be developed. The proposed methodology provides quality solutions to most challenges encountered during a typical analytical CRM project, and has been tested on the difficult task from the UC San Diego Data Mining contest. The result outperforms some prevalent data mining techniques in the CRM domain.

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.986
Threshold uncertainty score0.345

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0020.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.206
GPT teacher head0.337
Teacher spread0.131 · 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

Citations4
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicData Mining Algorithms and ApplicationsFrench-language works237,207