{"id":"W2070673450","doi":"10.1109/ccece.2013.6567812","title":"Software architecture decomposition using adaptive K-nearest neighbor algorithm","year":2013,"lang":"en","type":"article","venue":"","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Architecture tradeoff analysis method; Decomposition; Software engineering; Software; Software architecture; Software development; Software system; Cluster analysis; Software construction; Reference architecture; Data mining; Computer architecture; Artificial intelligence; Programming language","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001400464,0.0001737061,0.0001796024,0.00009329658,0.0002127232,0.0001940857,0.0005212076,0.0001025173,0.0001240612],"category_scores_gemma":[0.00001970221,0.0001268008,0.00008907055,0.0003286051,0.00005122579,0.0008338218,0.0002052142,0.000165274,0.0003610202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008308252,"about_ca_system_score_gemma":0.00007566407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005824434,"about_ca_topic_score_gemma":0.000008528064,"domain_scores_codex":[0.9986792,0.00006742313,0.000242193,0.000410418,0.0002699973,0.0003308253],"domain_scores_gemma":[0.9989565,0.00009841236,0.00007558932,0.0005530772,0.0001871958,0.0001292425],"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.000006156583,0.0001377237,0.00537238,0.00005123928,0.00004799722,0.0000122672,0.0009239603,0.004455887,0.0007902667,0.0009317403,0.001465524,0.9858049],"study_design_scores_gemma":[0.0006250469,0.0002948583,0.03176929,0.0001198495,0.00001358409,0.0002008355,0.0001077535,0.9470181,0.003499231,0.01486787,0.0007553451,0.0007282133],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04692937,0.00005882992,0.9511154,0.000225022,0.0004598745,0.0003705413,0.000002543668,0.0004650112,0.0003734256],"genre_scores_gemma":[0.2676207,0.000002126874,0.7317874,0.0003121501,0.0001380045,0.00002934869,0.000003160323,0.00001010444,0.00009692864],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9850767,"threshold_uncertainty_score":0.5170785,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01231685987209967,"score_gpt":0.2473001812912446,"score_spread":0.2349833214191449,"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."}}