{"id":"W2516807252","doi":"10.1109/tvcg.2016.2598591","title":"Optimizing Hierarchical Visualizations with the Minimum Description Length Principle","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Visualization and Computer Graphics","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Minimum description length; Computer science; Clutter; Data mining; Visualization; Outlier; Tree (set theory); Data visualization; Feature (linguistics); Set (abstract data type); Hierarchical database model; Artificial intelligence; Pattern recognition (psychology); Radar; 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.0002759448,0.00026302,0.0001930006,0.0003756661,0.0007233032,0.0004599155,0.0004921713,0.0001025115,0.00002050464],"category_scores_gemma":[0.000005517383,0.0001549872,0.00007909621,0.001186442,0.0002301294,0.0008580034,0.00001513463,0.0001482121,0.00001487521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003446511,"about_ca_system_score_gemma":0.00007490396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003973077,"about_ca_topic_score_gemma":0.00003016378,"domain_scores_codex":[0.9981338,0.000222837,0.0003393987,0.0005386205,0.0004666505,0.0002987216],"domain_scores_gemma":[0.9987128,0.000210188,0.0001364636,0.0005387248,0.0002296915,0.0001721176],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001959135,0.0002296083,0.00006224607,0.00001460001,0.00006158712,0.000003021546,0.0008693169,0.0006045399,0.00007726537,0.9900772,0.0004688921,0.007512126],"study_design_scores_gemma":[0.001054756,0.0003886051,0.0002569963,0.0001034554,0.00004467158,0.00003330188,0.00004721357,0.983745,0.00126153,0.0006231669,0.01206515,0.0003761115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003622399,0.00001837308,0.9944753,0.0009007449,0.0003030276,0.0002538484,0.00001688663,0.0003483915,0.00006099559],"genre_scores_gemma":[0.991509,0.0003732748,0.004616347,0.002904894,0.00008269408,0.00004246181,0.00001393893,0.00003728578,0.0004201659],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.989859,"threshold_uncertainty_score":0.6320193,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02505537348481576,"score_gpt":0.2798612655801945,"score_spread":0.2548058920953787,"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."}}