{"id":"W4389179369","doi":"10.1016/j.compeleceng.2023.109048","title":"An approximation algorithm for high-dimensional table compression on balanced <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si5.svg\" display=\"inline\" id=\"d1e169\"><mml:mi>K</mml:mi></mml:math>-partite graph","year":2023,"lang":"en","type":"article","venue":"Computers & Electrical Engineering","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Table (database); Compression (physics); Approximation algorithm; Algorithm; Mathematics; Combinatorics; Data compression; Graph; Discrete mathematics; Computer science; Data mining; Physics","routes":{"ca_aff":true,"ca_fund":true,"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.0006149914,0.001299543,0.001327048,0.001983476,0.0009636236,0.00243381,0.002531383,0.00130542,0.01835235],"category_scores_gemma":[0.003021285,0.0004854905,0.001041091,0.004186929,0.0005581287,0.003619738,0.002357211,0.001376965,0.007269987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001741098,"about_ca_system_score_gemma":0.002397515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007021896,"about_ca_topic_score_gemma":0.01163676,"domain_scores_codex":[0.999038,0.0001002485,0.00009575774,0.0001866516,0.0004157466,0.0001636425],"domain_scores_gemma":[0.9987162,0.0003953694,0.00008282063,0.0004680024,0.0002596881,0.00007789121],"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.000953452,0.0003034753,0.001277552,0.0003440517,0.0001111149,0.0001914858,0.0003220244,0.05298792,0.0109541,0.02991472,0.07084145,0.8317986],"study_design_scores_gemma":[0.0005329428,0.0004344504,0.001348683,0.0001015157,0.0001108232,0.0007131794,0.0003653784,0.8823292,0.01885734,0.06897242,0.02615218,0.0000817702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05893671,0.001770705,0.9026924,0.001135857,0.0004769366,0.0004142401,0.003053892,0.01312785,0.01839139],"genre_scores_gemma":[0.1857241,0.0006584043,0.7899448,0.0003267137,0.0002423937,0.0005204268,0.006808373,0.000681556,0.0150933],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01835235,"threshold_uncertainty_score":0.06139475,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01386289608177232,"score_gpt":0.2317022944909012,"score_spread":0.2178393984091289,"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."}}