{"id":"W2070925289","doi":"10.3934/amc.2014.8.119","title":"Nearest-neighbor entropy estimators with weak metrics","year":2014,"lang":"en","type":"preprint","venue":"Advances in Mathematics of Communications","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Estimator; Mathematics; Entropy estimation; Entropy (arrow of time); Upper and lower bounds; Minimax estimator; Ergodic theory; k-nearest neighbors algorithm; Bounded function; Applied mathematics; Maximum entropy probability distribution; Minimum-variance unbiased estimator; Nonparametric statistics; Statistics; Principle of maximum entropy; Computer science; Artificial intelligence; Mathematical analysis; Physics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009331371,0.0002931856,0.0006765083,0.0003900345,0.00009606483,0.00009930145,0.005806468,0.0001720313,0.000003537178],"category_scores_gemma":[0.0004277089,0.0002466554,0.0001079958,0.0006832788,0.0002907388,0.000357811,0.002797359,0.000725485,0.000005751851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005697088,"about_ca_system_score_gemma":0.0001728935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001200523,"about_ca_topic_score_gemma":0.00003984133,"domain_scores_codex":[0.9979659,0.0002709764,0.000752282,0.0003632848,0.0003947366,0.0002527757],"domain_scores_gemma":[0.9912221,0.001686836,0.000822488,0.005936141,0.0002503198,0.000082084],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001822956,0.0002476431,0.0001539213,0.0004105779,0.00002514443,6.961291e-7,0.0007326956,0.002191948,0.000009546513,0.9760787,0.00003082488,0.02011649],"study_design_scores_gemma":[0.0001634229,0.00003766573,0.00003719768,0.0005779475,0.00002792633,0.000005037043,0.00002305515,0.3263482,0.0001318966,0.66959,0.002826551,0.0002310991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001643084,0.006462329,0.9764035,0.0006696515,0.000125103,0.0004339558,0.00001029744,0.00008748541,0.01564331],"genre_scores_gemma":[0.07848486,0.004863725,0.9163986,0.00003437078,0.00001354492,0.0001189265,0.00001092231,0.00002587698,0.00004914572],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3241562,"threshold_uncertainty_score":0.9999986,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0255040991783082,"score_gpt":0.3320897558339155,"score_spread":0.3065856566556073,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}