MétaCan
Menu
Back to cohort
Record W2545943971 · doi:10.1145/2837060.2837072

FIMaaS

2015· article· en· W2545943971 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicData Mining Algorithms and Applications
Canadian institutionsUniversity of Manitoba
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer sciencePopularityScalabilityVariety (cybernetics)Data scienceBig dataService (business)ScheduleCloud computingKnowledge extractionWorld Wide WebData miningDatabaseBusinessArtificial intelligence

Abstract

fetched live from OpenAlex

Frequent itemset mining discovers implicit, previously unknown and potentially useful knowledge---in the form of frequent itemsets---from data. For example, discovery of frequently purchased merchandise products reveals customer purchase patterns, which help store managers about their business strategies and promotional tactics. These, in turn, help increase profits of the stores. As another example, discovery of popular collections of courses reveals course popularity and trends of some subject matters. These, in turn, assist university administrators schedule courses and their corresponding exams to avoid conflict or exam hardship, as well as planning of the calendar. As we are living in the era of big data, many applications and services generate high volumes of a wide variety of highly valuable data at a high velocity. These data can be of a wide range of veracity. Consequently, having scalable frequent itemset mining service is important to both the data mining experts and non-experts. Over the past two decades, numerous frequent itemset mining algorithms have been proposed. Many of them require some degrees of data mining knowledge and expertise, which may be inaccessible by layman. In this paper, we propose a tool with an intention to provide scalable frequent itemset mining-as-a-service (FIMaaS) on cloud for non-expert data miners.

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: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.645
Threshold uncertainty score0.667

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.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.060
GPT teacher head0.276
Teacher spread0.215 · 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

Citations14
Published2015
Admission routes2
Has abstractyes

Explore more

Same topicData Mining Algorithms and ApplicationsFrench-language works237,207