Bibliographic record
Abstract
In this paper, recent bioinformatics methods using data mining techniques are presented to analyze protein-protein interaction data gathered from recent large-scale biological studies. Novel approaches are suggested to tackle some of the challenges in this area. Protein-protein interaction data can provide a wealth of information to better understand the biology of a cell. The analysis of these interactions is also important for the discovery of disease-associated proteins. The data can also be used for the identification of novel cellular sites that are crucial for the development of new and improved pharmaceutical drugs. Knowledge discovery and data mining (KDD) is the process of extracting implicit information from large amounts of data using mathematical and statistical methods. It grows in synergy with computer technology, creating new analytical tools and using them for knowledge discovery in large volume of data. A multidisciplinary science and technology with links in statistics, machine learning, database systems, and computer programming and visualization, KDD has proved to be a promising solution to various problems in molecular biology, and gene analysis. An overview of various data mining techniques is presented in this paper with specific examples of their applications in protein-protein interaction data analysis. While some of the most widely used data mining techniques for exploring protein interaction data sets are clustering (including supervised and unsupervised), classification and association rule discovery, others are based on methods for mining interaction information from scientific sources such as PubMed and MedLine. There are areas such as prediction and profiling that have not been explored much for mining information in protein-protein interactions. We propose methods to employ these novel techniques to analyze protein-protein interaction 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.006 | 0.022 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.003 | 0.004 |
| Bibliometrics | 0.009 | 0.010 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.005 |
| Open science | 0.005 | 0.002 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.005 | 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".