Rule Based Systems in a Distributed Environment: Survey
Bibliographic record
Abstract
Over the past years, the internet has become faster, computer storage has become larger and the data from internet users and sensors is piling up to larger amount and is also spread around the globe. This requires more time and space for a single computer to cope with them. Ecosystems like Hadoop helps to store, process and retrieve back the data efficiently in a distributed fashion. Data mining finds substantial improvements over such distributed frameworks to process a large volume of data in a lesser time. Currently, there are many approaches to do data mining tasks such as classification and clustering in a distributed setup using Hadoop MapReduce, Spark, and other Cloud platforms. Actionable pattern mining is a rule based data mining approach for discovering knowledge from information systems in a form of Action Rules. An emphasis of traditional classification rules from a supervised Machine Learning is to predict class label of a data object. Whereas Action Rules produce actionable knowledge in the form of suggestions on how an object can change from one class value to another more desirable class value. This paper gives a brief survey of previous works on association and classification rule mining algorithms in a distributed environment, as well as action rule mining algorithms, and discusses Action Rule Mining in a distributed environment.
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.004 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.003 | 0.009 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.005 | 0.007 |
| Open science | 0.004 | 0.002 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 0.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.
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".