{"id":"W2342411541","doi":"10.1109/tkde.2016.2527003","title":"Conflict-Aware Weighted Bipartite B-Matching and Its Application to E-Commerce","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Computer science; Scalability; Matching (statistics); Scheduling (production processes); The Internet; Time complexity; Approximation algorithm; Blossom algorithm; Context (archaeology); Theoretical computer science; Data mining; Graph; Combinatorics; Algorithm; Mathematics; World Wide Web; Mathematical optimization; Database","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.002932391,0.001156128,0.002013297,0.001890366,0.001763237,0.002008104,0.003116738,0.002614362,0.005286394],"category_scores_gemma":[0.01245274,0.0009676278,0.001644353,0.007187078,0.00133179,0.004582715,0.002490586,0.002471351,0.0009565239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001682452,"about_ca_system_score_gemma":0.001831373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005552815,"about_ca_topic_score_gemma":0.004563483,"domain_scores_codex":[0.997006,0.001409987,0.0001538893,0.0007262477,0.0004950973,0.0002087456],"domain_scores_gemma":[0.9953144,0.002899799,0.0004477366,0.0006876975,0.0004023817,0.0002480018],"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.0003901254,0.0006668593,0.003358434,0.0007713311,0.0003151171,0.0003429276,0.0003187773,0.6191391,0.003694055,0.1496508,0.02207297,0.1992795],"study_design_scores_gemma":[0.0000459359,0.00005123621,0.0003640938,0.00002348473,0.00003324751,0.0001638708,0.00006614447,0.8667449,0.0006214534,0.1273107,0.004554823,0.00002024136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04071235,0.002225564,0.9452356,0.001897225,0.0001587873,0.000289244,0.0007425092,0.0008764867,0.007862237],"genre_scores_gemma":[0.392518,0.001845643,0.5986553,0.0008003626,0.0002163891,0.0003670828,0.00160829,0.0003192657,0.003669688],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005552815,"threshold_uncertainty_score":0.01768476,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03065758621392588,"score_gpt":0.2842775778446898,"score_spread":0.2536199916307639,"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."}}