{"id":"W1968497309","doi":"10.1016/j.aeue.2008.09.006","title":"Rate of convergence of the nearest neighbor entropy estimator","year":2008,"lang":"en","type":"article","venue":"AEU - International Journal of Electronics and Communications","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Estimator; Mathematics; Ergodic theory; Rate of convergence; Bernoulli's principle; Entropy estimation; Applied mathematics; k-nearest neighbors algorithm; Entropy (arrow of time); Minimax estimator; Statistics; Minimum-variance unbiased estimator; Pure mathematics; Computer science; Physics; Artificial intelligence; Thermodynamics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01431989,0.0009447185,0.001440055,0.002376624,0.001188556,0.002399158,0.002006236,0.002226568,0.004336473],"category_scores_gemma":[0.1174992,0.0006071152,0.0008350206,0.001163617,0.002014522,0.004319466,0.003723773,0.002843713,0.001806683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00133279,"about_ca_system_score_gemma":0.00168534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002130982,"about_ca_topic_score_gemma":0.001446021,"domain_scores_codex":[0.9931492,0.002837132,0.0003091711,0.0009796272,0.002279874,0.0004450633],"domain_scores_gemma":[0.9040733,0.07355546,0.00268026,0.007858987,0.01081295,0.001018995],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001821005,0.0002330645,0.03152687,0.001149285,0.0004654491,0.0008253246,0.001009849,0.4451077,0.02460011,0.2213068,0.009067626,0.262887],"study_design_scores_gemma":[0.00003421152,0.0001477978,0.005439662,0.000146194,0.00005471513,0.001005868,0.0001860456,0.9376727,0.0176928,0.03463931,0.002882521,0.00009820372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09059941,0.004204309,0.890753,0.001499935,0.0004633925,0.0001305157,0.0006949125,0.001126596,0.01052801],"genre_scores_gemma":[0.7576184,0.002706707,0.2200404,0.000580831,0.0004707733,0.0003906531,0.002155877,0.001114351,0.014922],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01431989,"threshold_uncertainty_score":0.07573175,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0176112982630366,"score_gpt":0.2651419223188676,"score_spread":0.247530624055831,"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."}}