{"id":"W2401646429","doi":"10.14778/2831360.2831363","title":"Finding Pareto optimal groups","year":2015,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Air Force Office of Scientific Research; Science and Technology Planning Project of Guangdong Province; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Skyline; Computer science; Pruning; Pareto optimal; Scalability; Computation; Point (geometry); Heuristic; Set (abstract data type); Pareto principle; Group (periodic table); Data mining; Algorithm; Theoretical computer science; Mathematics; Mathematical optimization; Artificial intelligence; Database","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.001975755,0.00151886,0.00202927,0.005180405,0.001873082,0.00253376,0.001662874,0.001540852,0.005317073],"category_scores_gemma":[0.008365124,0.0007264782,0.00173854,0.003721265,0.001115534,0.003276031,0.002812472,0.001111199,0.001297784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001429262,"about_ca_system_score_gemma":0.002158912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003414175,"about_ca_topic_score_gemma":0.004278879,"domain_scores_codex":[0.9980419,0.0004991798,0.0001226812,0.0004940514,0.0005673931,0.0002748291],"domain_scores_gemma":[0.9963964,0.001706921,0.0004011833,0.0005038577,0.0007462794,0.0002453032],"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.0006513778,0.0004891765,0.0146885,0.0006542099,0.000385524,0.0004330963,0.001391739,0.4471321,0.008547134,0.1074646,0.02096457,0.397198],"study_design_scores_gemma":[0.0001025241,0.0001593624,0.001394558,0.00007324917,0.00005887819,0.0001630432,0.0006580949,0.8566238,0.003927806,0.1293202,0.007485726,0.00003273929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09495758,0.0004816192,0.8961304,0.0003971758,0.00003466593,0.0003649867,0.0009603605,0.0007541738,0.005919005],"genre_scores_gemma":[0.2849221,0.0002865113,0.7070307,0.0001730368,0.00005238554,0.000453197,0.003225175,0.0002840534,0.00357298],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005317073,"threshold_uncertainty_score":0.01778734,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03602136027877362,"score_gpt":0.2410628041821174,"score_spread":0.2050414439033438,"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."}}