{"id":"W2141385938","doi":"10.1109/icdar.1995.602070","title":"A Markovian random field approach to information retrieval","year":2002,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Markov process; Analogy; Markov chain; Theoretical computer science; Random field; Set (abstract data type); Matching (statistics); Field (mathematics); Information retrieval; Algorithm; Data mining; Artificial intelligence; Machine learning; Mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.0001298482,0.00006349113,0.00007457403,0.00007286813,0.00007415526,0.0001975589,0.0004836305,0.00003771005,0.0001250308],"category_scores_gemma":[0.00005603094,0.00004748682,0.00002640084,0.0002694033,0.000003889691,0.001315175,0.0002455363,0.00006285068,0.0003508299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009839748,"about_ca_system_score_gemma":0.000004903498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002202211,"about_ca_topic_score_gemma":3.077782e-7,"domain_scores_codex":[0.9993764,0.00001711552,0.0001394723,0.0001270293,0.0002020436,0.0001378962],"domain_scores_gemma":[0.9994265,0.00004227141,0.00002602086,0.0003798365,0.00003409044,0.00009124311],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005931843,0.0001048169,0.00004554621,0.00001607984,0.000008517951,0.000001998009,0.001746503,0.0001048327,0.00007922043,0.02806194,0.4506388,0.5191324],"study_design_scores_gemma":[0.000857848,0.00008532178,0.0002533514,0.000007237492,0.000001409531,0.00001193683,0.00002605809,0.8249575,0.0005551066,0.0002763423,0.172812,0.0001558905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002487749,0.00001237918,0.8586451,0.0008642843,0.0001351793,0.0001237436,0.000001074631,0.0001051789,0.1398642],"genre_scores_gemma":[0.226949,0.00001952765,0.7592417,0.00951639,0.0001501194,0.0000161648,0.0000153961,0.000005493162,0.004086218],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8248526,"threshold_uncertainty_score":0.4509326,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01361539952366508,"score_gpt":0.2069330651218659,"score_spread":0.1933176655982008,"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."}}