MétaCan
Menu
Back to cohort
Record W4378575626 · doi:10.1049/cit2.12235

A multiple sensitive attributes data publishing method with guaranteed information utility

2023· article· en· W4378575626 on OpenAlexaff
Haibin Zhu, Tong Yi, Songtao Shang, Minyong Shi, Zhucheng Li, Wenqian Shang

Bibliographic record

VenueCAAI Transactions on Intelligence Technology · 2023
Typearticle
Languageen
FieldComputer Science
TopicPrivacy-Preserving Technologies in Data
Canadian institutionsNipissing University
FundersFundamental Research Funds for the Central Universities
KeywordsData publishingPublishingComputer scienceInformation lossHeuristicData miningScheme (mathematics)Information retrievalAnonymityInformation sensitivityComputer securityArtificial intelligenceMathematics

Abstract

fetched live from OpenAlex

Abstract Data publishing methods can provide available information for analysis while preserving privacy. The multiple sensitive attributes data publishing, which preserves the relationship between sensitive attributes, may keep many records from being grouped and bring in a high record suppression ratio. Another category of multiple sensitive attributes data publishing, which reduces the possibility of record suppression by breaking the relationship between sensitive attributes, cannot provide the sensitive attributes association for analysis. Hence, the existing multiple sensitive attributes data publishing fails to fully account for the comprehensive information utility. To acquire a guaranteed information utility, this article defines comprehensive information loss that considers both the suppression of records and the relationship between sensitive attributes. A heuristic method is leveraged to discover the optimal anonymity scheme that has the lowest comprehensive information loss. The experimental results verify the practice of the proposed data publishing method with multiple sensitive attributes. The proposed method can guarantee information utility when compared with previous ones.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.004
metaresearch head score (Gemma)0.014
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.004
Threshold uncertainty score0.023

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.014
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.004
Science and technology studies0.0020.001
Scholarly communication0.0030.006
Open science0.0030.003
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0020.001

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.085
GPT teacher head0.322
Teacher spread0.237 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
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

Citations1
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueCAAI Transactions on Intelligence TechnologySame topicPrivacy-Preserving Technologies in DataFrench-language works237,207