Bibliographic record
Abstract
Domain novices learning about a new subject can struggle to find their way in large collections. Typical searching and browsing tools are better utilized if users know what to search for or browse to. In this dissertation, we present Multiple Diagram Navigation (MDN) to assist domain novices by providing multiple overviews of the content matter using multiple diagrams. Rather than relying on specific types of visualizations, MDN superimposes any type of diagram or map over a collection of documents, allowing content providers to reveal interesting perspectives of their content. Domain novices can navigate through the content in an exploratory way using three types of queries (navigation): diagram to content (D2C), diagram to diagram (D2D), and content to diagram (C2D). To evaluate the MDN user interface, we conducted a user study, which showed that users found MDN useful and easy to use in exploratory-navigation scenarios. Encouraged by these positive results, we extended the functionality of MDN to provide a ranking of collection documents for D2C queries (expressed by a selected diagram concept). We studied different elements of the ranking process. As a case study, we targeted our research towards the Wikipedia collection. With the goal of studying ranking in different types of diagrams, we introduced two diagram models: the Items-and-Attributes model and the Universal model. We also studied two ranking algorithms: Personalized PageRank (PPR), an algorithm used in similar applications; and Greedy Energy Spreading (GES), an algorithm that we designed. We also studied different approaches to computing rankings for C2D queries. Our results show encouraging performance on the ranking of D2C and C2D queries. For example, in an experiment targeting diagrams conforming to the Items-and-Attributes model, results showed reasonably high similarity between a diagram concept selected by the user and the top-ten-ranked pages. We also found that diagrams had a strong influence on D2C ranking, which yielded a ranking reflecting the aspect presented by the diagram. In C2D-query ranking, GES was able to rank the most related concept in the diagram to a Wikipedia page selected by the user in the top five or six positions on average (in diagrams with 50 elements). In our tuning for the two studied algorithms, we observed that GES performs slightly better than PPR in some aspects of D2C and C2D ranking. We also noticed differences between MDN and similar applications on the optimal settings for Personalized PageRank. Our configuration of the Wikipedia graph revealed
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.015 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.006 |
| Open science | 0.002 | 0.004 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.051 | 0.017 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".