MétaCan
Menu
Back to cohort
Record W2896048995 · doi:10.5539/cis.v11n4p9

Representation and Reasoning with Probabilistic TCP-nets

2018· article· en· W2896048995 on OpenAlexafffundvenue
Sultan Ahmed, Malek Mouhoub

Bibliographic record

VenueComputer and Information Science · 2018
Typearticle
Languageen
FieldComputer Science
TopicRecommender Systems and Techniques
Canadian institutionsUniversity of Regina
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceNet (polyhedron)PreferenceBayesian networkRepresentation (politics)Aggregate (composite)Set (abstract data type)Recommender systemProbabilistic logicArtificial intelligenceMachine learningMathematicsStatisticsProgramming language

Abstract

fetched live from OpenAlex

TCP-nets are graphical tools for modeling user's preference and relative importance statements. We propose the Prob-abilistic TCP-net (PTCP-net) model that can aggregate a set of TCP-nets, in a compact form, sharing the same set of variables and their domains but having different preference and relative importance statements. In particular, the PTCP-net is able to aggregate the choices of multiple users such as, in recommender systems. The PTCP-net can also be seen as an extension of the TCP-net with uncertainty on preference and relative importance statements. We adopt the Bayesian Network as the reasoning tool for PTCP-nets especially when answering the following two queries (1) finding the most probable TCP-net and (2) finding the most probable optimal outcome. We also show that the PTCP-net is applicable in collaborative filtering type recommender systems.

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 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: none
Teacher disagreement score0.863
Threshold uncertainty score0.763

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.0010.008
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.014
GPT teacher head0.260
Teacher spread0.246 · 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 teacher head, 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

Citations4
Published2018
Admission routes3
Has abstractyes

Explore more

Same venueComputer and Information ScienceSame topicRecommender Systems and TechniquesFrench-language works237,207