Efficient algorithms for constructing decision trees with constraints
Bibliographic record
Abstract
Article Free Access Share on Efficient algorithms for constructing decision trees with constraints Authors: Minos Garofalakis Bell Laboratories Bell LaboratoriesView Profile , Dongjoon Hyun Korea Advanced Institute of Science and Technology and Advanced Information Technology Research Centre Korea Advanced Institute of Science and Technology and Advanced Information Technology Research CentreView Profile , Rajeev Rastogi Bell Laboratories Bell LaboratoriesView Profile , Kyuseok Shim Korea Advanced Institute of Science and Technology and Advanced Information Technology Research Centre Korea Advanced Institute of Science and Technology and Advanced Information Technology Research CentreView Profile Authors Info & Claims KDD '00: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data miningAugust 2000 Pages 335–339https://doi.org/10.1145/347090.347163Online:01 August 2000Publication History 20citation677DownloadsMetricsTotal Citations20Total Downloads677Last 12 Months5Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
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.003 | 0.016 |
| Meta-epidemiology (narrow) | 0.003 | 0.002 |
| Meta-epidemiology (broad) | 0.003 | 0.004 |
| Bibliometrics | 0.004 | 0.006 |
| Science and technology studies | 0.002 | 0.001 |
| Scholarly communication | 0.004 | 0.005 |
| Open science | 0.004 | 0.003 |
| Research integrity | 0.002 | 0.005 |
| Insufficient payload (model declined to judge) | 0.014 | 0.004 |
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".