{"id":"W2959486411","doi":"10.18280/isi.240104","title":"Network Adjacency Matrix Blocked-compressive Sensing: A Novel Algorithm for Link Prediction","year":2019,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Adjacency matrix; Algorithm; Computer science; Subspace topology; Link (geometry); Matrix (chemical analysis); Adjacency list; Diagonal; Distance matrix; Sorting; Diagonal matrix; Mathematics; Artificial intelligence; Theoretical computer science; Graph","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006628957,0.000921586,0.0006850407,0.0008127212,0.0005289677,0.0006591637,0.001469639,0.0008867495,0.001508444],"category_scores_gemma":[0.00315497,0.0003684804,0.0004782756,0.001188003,0.0006621816,0.001909225,0.001183623,0.001490408,0.0006355146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004383012,"about_ca_system_score_gemma":0.001338173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005646843,"about_ca_topic_score_gemma":0.006158138,"domain_scores_codex":[0.9994301,0.0001382552,0.00002799218,0.0001268321,0.000222108,0.00005473563],"domain_scores_gemma":[0.9989985,0.0004715184,0.0001092449,0.0001294458,0.0002445093,0.00004691185],"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.0002558586,0.0001285054,0.001687419,0.0001478279,0.00007486468,0.0001242222,0.0001935164,0.4905708,0.01945285,0.02860252,0.006452416,0.4523092],"study_design_scores_gemma":[0.000004993279,0.00002289591,0.0001034469,0.000004423332,0.000004063171,0.00003141787,0.00001156618,0.9938002,0.001657451,0.003426567,0.000926032,0.000006941307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004588605,0.0001194189,0.9942227,0.0001123602,0.00003811024,0.00002594732,0.00005398292,0.0002468525,0.0005920872],"genre_scores_gemma":[0.2508424,0.0006298978,0.7439171,0.0002129894,0.0001534163,0.0002034746,0.00063454,0.0001130646,0.003293147],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005646843,"threshold_uncertainty_score":0.01122797,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01038043482133274,"score_gpt":0.2400942894047254,"score_spread":0.2297138545833926,"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."}}