Mobile-Based and Self-Service Tool (iPed) to Collect, Manage, and Visualize Pedigree Data: Development Study
Bibliographic record
Abstract
BACKGROUND: Pedigree data (family history) are indispensable for genetics studies and the assessment of individuals' disease susceptibility. With the popularity of genetics testing, the collection of pedigree data is becoming more common. However, it can be time-consuming, laborious, and tedious for clinicians to investigate all pedigree data for each patient. A self-service robot could inquire about patients' family history in place of professional clinicians or genetic counselors. OBJECTIVE: The aim of this study was to develop a mobile-based and self-service tool to collect and visualize pedigree data, not only for professionals but also for those who know little about genetics. METHODS: There are 4 main aspects in the iPed construction, including interface building, data processing, data storage, and data visualization. The user interface was built using HTML, JavaScript libraries, and Cascading Style Sheets (version 3; Daniel Eden). Processing of the submitted data is carried out by PHP programming language. MySQL is used to document and manage the pedigree data. PHP calls the R script to accomplish the visualization. RESULTS: iPed is freely available to all users through the iPed website. No software is required to be installed, no pedigree files need to be prepared, and no knowledge of genetics or programs is required. The users can easily complete their pedigree data collection and visualization on their own and through a dialogue with iPed. Meanwhile, iPed provides a database that stores all users' information. Therefore, when the users need to construct new pedigree trees for other genetic traits or modify the pedigree trees that have already been created, unnecessary duplication of operations can be avoided. CONCLUSIONS: iPed is a mobile-based and self-service tool that could be used by both professionals and nonprofessionals at any time and from any place. It reduces the amount of time required to collect, manage, and visualize pedigree data.
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.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.014 | 0.005 |
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".