{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001052618,0.0007905584,0.0008808177,0.0008378305,0.0003620357,0.0006068216,0.001064765,0.000850308,0.0007450578],"category_scores_gemma":[0.004345032,0.0004509769,0.0005915913,0.001079069,0.0007759657,0.002234785,0.001209823,0.001061652,0.0004555586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005114719,"about_ca_system_score_gemma":0.0009874084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003381494,"about_ca_topic_score_gemma":0.003800107,"domain_scores_codex":[0.9991893,0.0002576605,0.00004590253,0.0001745935,0.0002825653,0.00005006431],"domain_scores_gemma":[0.9987679,0.0006369188,0.000201185,0.0001361729,0.0002169118,0.00004078541],"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.0001485598,0.00006960303,0.001254705,0.0001631443,0.00006185765,0.0001005195,0.0001383795,0.7545136,0.007854174,0.01874607,0.001736555,0.2152129],"study_design_scores_gemma":[0.000008386259,0.0000337598,0.0001917629,0.000007640284,0.000008835895,0.00004000902,0.00001418166,0.9921822,0.001328971,0.005725112,0.0004471145,0.00001194212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004845137,0.0001357408,0.9944877,0.00007482684,0.00001048377,0.00001117109,0.00001726964,0.0001110386,0.000306592],"genre_scores_gemma":[0.5021511,0.001349943,0.4928679,0.000208458,0.0001271764,0.0001763255,0.0004393932,0.00008326119,0.00259653],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003381494,"threshold_uncertainty_score":0.006723642,"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."}}