{"id":"W2296555785","doi":"10.1007/978-3-319-25789-1_10","title":"Semi-extractive Multi-document Summarization via Submodular Functions","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Submodular set function; Automatic summarization; Computer science; Monotone polygon; Knapsack problem; Scalability; Relevance (law); Greedy algorithm; Theoretical computer science; Data mining; Mathematical optimization; Artificial intelligence; Algorithm; Mathematics; 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.001563332,0.002329804,0.002516372,0.002537712,0.0007305469,0.002358707,0.001765062,0.001446618,0.00621643],"category_scores_gemma":[0.00466315,0.0008678433,0.001855232,0.002987863,0.0005770582,0.003593053,0.002651282,0.002000382,0.008002696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005941868,"about_ca_system_score_gemma":0.00129851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001272211,"about_ca_topic_score_gemma":0.002727853,"domain_scores_codex":[0.9983022,0.0004410608,0.0001913061,0.0004534049,0.0004644057,0.0001476152],"domain_scores_gemma":[0.997071,0.001516505,0.0002033268,0.0004495837,0.0006697979,0.00008971794],"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.0003527844,0.0001495032,0.0002440949,0.0006409693,0.0001478698,0.0002175112,0.0002027493,0.03876653,0.02456822,0.008271413,0.0215084,0.9049299],"study_design_scores_gemma":[0.00005833055,0.0002742504,0.0004603127,0.00008442339,0.0001424469,0.0003062348,0.0002206218,0.9234523,0.02332509,0.03525975,0.01635261,0.00006370644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004005824,0.001047801,0.9892675,0.0002057014,0.0001110142,0.00009134998,0.0007501983,0.003354562,0.00116609],"genre_scores_gemma":[0.08654568,0.001406372,0.8901284,0.0002888375,0.0005161165,0.0004377067,0.008033839,0.0009436954,0.01169931],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00621643,"threshold_uncertainty_score":0.02079606,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03023738798065039,"score_gpt":0.2617135266681185,"score_spread":0.2314761386874681,"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."}}