MétaCan
Menu
Back to cohort
Record W1535195418

Designing an Integrated Bookmark / History System for Web Browsing

2000· article· en· W1535195418 on OpenAlexaff
Shaun Kaasten, Saul Greenberg

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWeb Data Mining and Analysis
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsThumbnailWorld Wide WebComputer scienceThe InternetWeb pageWeb browserFilter (signal processing)
DOInot available

Abstract

fetched live from OpenAlex

Current commercial web browsers such as Netscape Navigator and Microsoft Internet Explorer attempt to make it easier for users to return to previously visited web pages. They offer several important facilities for doing this, with the major ones being the Back button, the history list, and bookmarks. In theory, these mechanisms should be heavily used, for almost 60 % of all pages a person visits are to ones that they had seen previously [Tauscher and Greenberg 1997]. Yet research indicates several problems with these mechanisms. While Back is heavily used, people have an incorrect model of how it works, which leads to surprises when just-visited pages are no longer reachable [Cockburn and Jones 96; Greenberg and Cockburn 99]. Also, the bookmark and history systems are not used very frequently [Tauscher and Greenberg 97; Abrahms, Baeker, Chignell 98]. We believe that one of the reasons for these problems is that browsers provide revisitation systems in a fragmented, un-integrated manner. Back, history and bookmarks all use dissimilar underlying models, different interfaces, and various ways of sorting and presenting groups of candidate pages. In this research, our goal is to integrate the idea of Back, history and bookmarks into a single integrated revisitation system that captures the best features while remedying their known deficiencies. We are currently developing our prototype system (see Figure) that works within Microsoft Internet

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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.007
Threshold uncertainty score0.022

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.008
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0010.001
Scholarly communication0.0030.006
Open science0.0030.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0070.003

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.029
GPT teacher head0.227
Teacher spread0.198 · 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 designBench or experimental
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

Citations13
Published2000
Admission routes1
Has abstractyes

Explore more

Same topicWeb Data Mining and AnalysisFrench-language works237,207