Diagnosis of Parasitic Diseases in Animals Cat Using Bayes Theorem Method
Bibliographic record
Abstract
Cats are one of the most popular pets in the world, including Indonesian people who like to keep cats as pets, and even become a hobby for cat lovers. Diseases that often attack cats are caused by parasites, namely worms and fleas. Parasites that attack cats are grouped into two, namely ectoparasites and endoparasites. expert system which is a computer program , which is able to store knowledge and rules like an expert . With the help of an expert system, someone who is lay or not an expert in a particular field will be able to answer questions, solve problems, and make decisions that are usually made by an expert . The Bayes Theorem method can be applied to diagnose parasitic diseases in cats based on input symptoms chosen by the users, the system can perform analysis based on predetermined rules or knowledge base. Based on the probability value of each symptom and disease that has been made, the system can diagnose parasitic diseases in cats with different accuracy results, the highest value or percentage which is the result of the diagnosis of the parasitic disease. From the results of trials conducted by the expert system for diagnosing parasitic diseases in cats using the Bayes Theorem method, the highest value was obtained, namely the type of parasitic disease Flea Disease (P03) with a percentage of 38.66%.
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.009 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| 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".