{"id":"W2921972197","doi":"10.1109/access.2019.2904843","title":"Locating the Nodes From Incomplete Euclidean Distance Matrix Using Bayesian Learning","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Jiangsu University of Technology; Government of Jiangsu Province; Jiangsu University; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Euclidean distance; Euclidean distance matrix; Node (physics); Wireless sensor network; Euclidean geometry; Multidimensional scaling; Computer science; Matrix completion; Distance matrix; Matrix (chemical analysis); Bayesian probability; Fraction (chemistry); Scaling; Rank (graph theory); Low-rank approximation; Artificial intelligence; Algorithm; Mathematics; Machine learning; Combinatorics; Geometry; Computer network","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.0001038778,0.0001480421,0.0001588645,0.00006067459,0.0001683826,0.0002120556,0.0005693517,0.00008034598,0.00009894979],"category_scores_gemma":[0.00003730294,0.0001177088,0.00004241641,0.0002992488,0.00004424678,0.0002958544,0.00007758252,0.0002732062,0.00007990892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006270607,"about_ca_system_score_gemma":0.000009748855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003029523,"about_ca_topic_score_gemma":0.00005154413,"domain_scores_codex":[0.9991838,0.00002868402,0.0002185334,0.0001739978,0.0001477148,0.0002472765],"domain_scores_gemma":[0.9994575,0.00011508,0.00006122467,0.0003092525,0.00003428802,0.00002270389],"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.000005454395,0.000004920711,0.08075825,0.00008562399,0.00003423519,0.000004559851,0.0005485527,0.9011234,0.01094531,0.0007051944,0.0001211481,0.005663364],"study_design_scores_gemma":[0.0002113882,0.000006459726,0.001943991,0.00008846162,0.00001707188,0.000002355496,0.0007337889,0.9651759,0.02853077,0.001271896,0.001731553,0.0002864222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6351898,0.0002341972,0.3623354,0.00003719001,0.0004431809,0.0001152806,0.000007674874,0.0006105785,0.001026657],"genre_scores_gemma":[0.9986883,0.00001617762,0.001002281,0.00004660099,0.0001148845,0.000005872454,0.000008148906,0.00004308506,0.00007458506],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3634986,"threshold_uncertainty_score":0.4800023,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01640986354785847,"score_gpt":0.2703548838467498,"score_spread":0.2539450202988913,"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."}}