{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002465606,0.0009959296,0.0009923455,0.001381222,0.000472283,0.00210404,0.00129148,0.0009090075,0.003673603],"category_scores_gemma":[0.01200332,0.0008559158,0.001132256,0.001254691,0.0006290237,0.003367843,0.002661328,0.001587916,0.0007475088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001099581,"about_ca_system_score_gemma":0.0009412698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002249691,"about_ca_topic_score_gemma":0.003477351,"domain_scores_codex":[0.9982305,0.0006677581,0.000102852,0.0002081582,0.0006480202,0.000142752],"domain_scores_gemma":[0.9943404,0.003911863,0.0003926501,0.000602495,0.0005557453,0.000196775],"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.0005644573,0.0001866454,0.004332594,0.0006776919,0.0001602101,0.0003480653,0.0008715148,0.5136805,0.03464861,0.05192387,0.01208647,0.3805194],"study_design_scores_gemma":[0.00003299806,0.00006068936,0.000335251,0.00001765386,0.00001430409,0.0000741769,0.00008002413,0.9697893,0.004979632,0.02246538,0.002131944,0.00001848273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01564947,0.0001995551,0.981313,0.0001767669,0.0000137705,0.0000440814,0.0001936523,0.001715171,0.0006944999],"genre_scores_gemma":[0.2510398,0.0002331195,0.7454886,0.0001375233,0.00002610221,0.0001980155,0.0007569802,0.0008683171,0.001251457],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003673603,"threshold_uncertainty_score":0.01303953,"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."}}