A Novel Rigorous Measurement Model for Big Data Quality Characteristics
Bibliographic record
Abstract
Satisfiable data quality is the basic guarantee for data-based research, decision-making, and service. Today, new trends in the creation, collection, and utilization of data are constantly emerging. With the usage of massive data, the problem of data quality is highlighted. Several studies on the measurement, evaluation, and management of big data quality have been proposed, and the data quality problem in the big data environment has received attention. The big data characteristics Vs model describes the dimensions and attributes information of data sources in detail, which can be implemented in big data quality measurement. In this paper, a novel rigorous big data quality measurement architecture is proposed for automatically and parallelly quantifying the value of six big data Vs, which are Volume, Variety, Velocity, Veracity, Validity, and Vincularity according to the developed algorithms in every big data process step and time phase of the big data pipeline. Thresholds for the six big data Vs are provided correspondingly for analyzing the result values. The hierarchical measurement model is constructed with multiple-based measures, derived measures, and indicators. The model is verified by comparative experiments and experiments results indicate that the designed architecture can improve the outcomes of data source implementation.
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.013 | 0.040 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.005 | 0.004 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.006 | 0.013 |
| Open science | 0.004 | 0.004 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.002 | 0.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.
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".