MétaCan
Menu
Back to cohort
Record W2137344466 · doi:10.1504/ijbidm.2006.009135

A unified framework for protecting sensitive association rules in business collaboration

2006· article· en· W2137344466 on OpenAlex
Stanley Robson de Medeiros Oliveira, Osmar R. Zai͏̈ane

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 Business Intelligence and Data Mining · 2006
Typearticle
Languageen
FieldComputer Science
TopicPrivacy-Preserving Technologies in Data
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsComputer scienceAssociation rule learningSet (abstract data type)Process (computing)Information sensitivityData miningKnowledge managementData scienceComputer security

Abstract

fetched live from OpenAlex

The sharing of association rules has been proven beneficial in business collaboration, but requires privacy safeguards. One may decide to disclose only part of the knowledge and conceal strategic patterns called sensitive rules. The challenge here is how to protect the sensitive rules without losing the benefit of mining. To address this problem, we propose a unified framework that combines: a set of algorithms to protect sensitive knowledge; retrieval facilities to speed up the process of knowledge protecting; and a set of metrics to evaluate the effectiveness of the proposed algorithms in terms of information loss and private information disclosure.

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.002
metaresearch head score (Gemma)0.067
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMetaresearch, Open science
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.821
Threshold uncertainty score0.998

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.067
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.003
Open science0.0070.007
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.061
GPT teacher head0.340
Teacher spread0.279 · 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