{"id":"W2798371164","doi":"10.1145/3209978.3210038","title":"Top-k Route Search through Submodularity Modeling of Recurrent POI Features","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Computer science; Pruning; Feature (linguistics); Variety (cybernetics); Point of interest; Heuristic; Class (philosophy); Space (punctuation); Data mining; Information retrieval; Mathematical optimization; Artificial intelligence; Mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007042536,0.0002964442,0.0003925568,0.000144987,0.00008946635,0.0004509484,0.003393554,0.0001955728,0.00004431529],"category_scores_gemma":[0.00002561524,0.000255635,0.0001843472,0.0002579702,0.0000683623,0.0006819984,0.009342287,0.0005786644,0.00003770147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005842378,"about_ca_system_score_gemma":0.0001216595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001206736,"about_ca_topic_score_gemma":0.00004790677,"domain_scores_codex":[0.9973875,0.00009652223,0.0003971522,0.0009885061,0.0007207763,0.0004095574],"domain_scores_gemma":[0.9974982,0.00002509304,0.0001309314,0.002034043,0.0002385964,0.00007310331],"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.00006008149,0.0009710357,0.001042931,0.00193028,0.0007354709,0.00005944416,0.005798909,0.02946889,0.00004370343,0.6447641,0.05130801,0.2638172],"study_design_scores_gemma":[0.0001750709,0.00006103507,0.000257396,0.0001469177,0.00002081913,0.000001626354,0.00003696607,0.9476445,0.0006185538,0.04929032,0.001372341,0.0003744068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005449088,0.0003939073,0.9699088,0.0009687188,0.001750325,0.0003941622,0.00005334189,0.0002084322,0.02087327],"genre_scores_gemma":[0.3622426,0.0004882594,0.6333571,0.0002715428,0.0006095298,0.00002759659,0.0002667354,0.00002737873,0.002709218],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9181756,"threshold_uncertainty_score":0.9999896,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06527603556412061,"score_gpt":0.3174099566823212,"score_spread":0.2521339211182006,"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."}}