MétaCan
Menu
Back to cohort
Record W2090996319 · doi:10.1142/s0218001402002180

USING MARKET VALUE FUNCTIONS FOR TARGETED MARKETING DATA MINING

2002· article· en· W2090996319 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

VenueInternational Journal of Pattern Recognition and Artificial Intelligence · 2002
Typearticle
Languageen
FieldComputer Science
TopicData Mining Algorithms and Applications
Canadian institutionsUniversity of Regina
Fundersnot available
KeywordsRank (graph theory)Computer scienceIdentification (biology)Value (mathematics)Data miningSet (abstract data type)Function (biology)Object (grammar)Basis (linear algebra)Artificial intelligenceMachine learningMathematics

Abstract

fetched live from OpenAlex

Targeted marketing typically involves the identification of customers or products having potential market values. We propose a linear model for solving this problem by drawing and extending results from information retrieval. It is assumed that each object is represented by values of a finite set of attributes. A market value function, which is a linear combination of utility functions on attribute values, is used to rank objects. Several methods are examined for mining market value functions. The main advantage of the model is that one can rank objects of interest according to their market values, instead of classifying the objects. Both the theoretical and experimental results are reported in this paper. It establishes a basis on which further studies and experimental evaluation can be carried out.

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.001
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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.997
Threshold uncertainty score0.418

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.0010.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.282
GPT teacher head0.358
Teacher spread0.076 · 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