{"id":"W2111811740","doi":"10.14778/2021017.2021018","title":"On pruning for top-k ranking in uncertain databases","year":2011,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University; University of Alberta","funders":"","keywords":"Tuple; Pruning; Ranking (information retrieval); Rank (graph theory); Computer science; Parameterized complexity; Key (lock); Range (aeronautics); Learning to rank; Semantics (computer science); Function (biology); Computation; Ranking SVM; Task (project management); Database; Information retrieval; Artificial intelligence; Data mining; Mathematics; Algorithm; Programming language; Combinatorics; Discrete 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.007393262,0.001290712,0.003059169,0.002604358,0.00265284,0.004163521,0.002620056,0.002315425,0.001896239],"category_scores_gemma":[0.03185013,0.0006858756,0.001777778,0.004120819,0.002846774,0.007878399,0.003060069,0.002992241,0.0005819621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00186313,"about_ca_system_score_gemma":0.00235327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005134074,"about_ca_topic_score_gemma":0.006152779,"domain_scores_codex":[0.9917763,0.003349777,0.0005920557,0.0008798662,0.002674625,0.0007273653],"domain_scores_gemma":[0.9783496,0.01582574,0.0008704213,0.003215341,0.001386047,0.0003529709],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005935527,0.000223811,0.002834358,0.0004612162,0.0001960059,0.000503913,0.0007896203,0.4899133,0.004731545,0.2502981,0.006229629,0.2432249],"study_design_scores_gemma":[0.00003638778,0.0001016584,0.0004401816,0.00007059588,0.00006126146,0.0002861362,0.000158112,0.7340154,0.002764221,0.2584791,0.003541713,0.00004516723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02278708,0.001637134,0.9720441,0.0005344452,0.00004973903,0.0000964724,0.0001635525,0.0004473534,0.00224013],"genre_scores_gemma":[0.3497904,0.001600341,0.6449713,0.0003024599,0.0001944706,0.0001969646,0.0006811132,0.000265354,0.00199757],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007393262,"threshold_uncertainty_score":0.03909975,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06770205945613778,"score_gpt":0.2641757924783974,"score_spread":0.1964737330222596,"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."}}