MétaCan
Menu
Back to cohort

Machine Learning Based Hybrid Association Rules for Web Usage Mining

2025· article· W7124938891 on OpenAlexaff
Dinesh Chander Verma, Harish Kumar Saini, Jaspreet Kaur, Amit K. Chopra, Harinder Singh

Bibliographic record

Venuenot available
Typearticle
Language
FieldComputer Science
TopicRecommender Systems and Techniques
Canadian institutionsThompson Rivers University
Fundersnot available
KeywordsWeb miningWeb pageThe InternetMarkov chainScalabilityAssociation rule learningScope (computer science)Precision and recallWeb content

Abstract

fetched live from OpenAlex

Online content may contain text or visual data, web mining can be used to analyze the different factors related to the online users and web contents i.e. frequency of web page usage, online user's behavior, URL visit frequency, least/most frequently content retrieval. All these are common factors for different domains i.e. education, e-commerce, marketing etc. As per the user's interest, it is necessary to recommend the URLs w.r.t. browsing history. The scalability of internet content makes it difficult to examine user behavior patterns. In case of educational domain, it is necessary to track the navigational patterns and web usage of the users, in order to provide the automated URL recommendations as per the scope of the website. In this paper, a hybrid method is presented to generate the URL usage predictions using association rules-based Markov chain and its performance is analyzed using existing approaches. Analysis shows that it outperforms in terms of accuracy, precision, recall and Fl-score value as compared to existing Markov chain method.

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.003
metaresearch head score (Gemma)0.008
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical · Consensus signal: none
Teacher disagreement score0.014
Threshold uncertainty score0.028

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.008
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0050.004
Science and technology studies0.0010.000
Scholarly communication0.0010.002
Open science0.0020.001
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0020.002

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.019
GPT teacher head0.268
Teacher spread0.249 · 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 designSimulation or modeling
Domainnot available
GenreEmpirical

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

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicRecommender Systems and TechniquesFrench-language works237,207