{"id":"W3042433848","doi":"10.1007/s11761-020-00298-7","title":"A graph database-based approach utilizing FAHP and directed bipartite graph for service composition","year":2020,"lang":"en","type":"article","venue":"Service Oriented Computing and Applications","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Graph database; Bipartite graph; Dijkstra's algorithm; Database; Cloud computing; Graph; Theoretical computer science; Data mining; Shortest path problem","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.001090828,0.0008175483,0.001614715,0.004318305,0.00179754,0.002795236,0.003383627,0.001231971,0.005684829],"category_scores_gemma":[0.002880736,0.0005683418,0.002100108,0.005599006,0.0006875579,0.00340445,0.002398717,0.001245314,0.001828389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001697224,"about_ca_system_score_gemma":0.003290339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02055729,"about_ca_topic_score_gemma":0.02198179,"domain_scores_codex":[0.9981833,0.0003535169,0.0001083859,0.0005079801,0.0007006374,0.0001461712],"domain_scores_gemma":[0.9987429,0.0003298466,0.00005752332,0.0003461565,0.0004217868,0.0001018204],"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.0002747221,0.0006511617,0.002156043,0.0005969676,0.0003424388,0.0005236504,0.0003136017,0.2095613,0.0205479,0.1522463,0.009786679,0.6029992],"study_design_scores_gemma":[0.00001639943,0.00003815572,0.0002397548,0.00001980424,0.00007984738,0.0001997203,0.000126436,0.9469896,0.004050652,0.04193518,0.006274458,0.00003003435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003128799,0.0001252083,0.9934666,0.0001053503,0.00003928046,0.000146923,0.0002075583,0.001112357,0.001667886],"genre_scores_gemma":[0.1152677,0.0003263047,0.8790146,0.0001513631,0.0000499566,0.0002147149,0.001224272,0.0002353495,0.003515725],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02055729,"threshold_uncertainty_score":0.04087526,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02120740045095552,"score_gpt":0.2514484409857296,"score_spread":0.2302410405347741,"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."}}