{"id":"W3197751840","doi":"10.1109/access.2021.3131987","title":"Identifying Influential Nodes in Two-Mode Data Networks Using Formal Concept Analysis","year":2021,"lang":"en","type":"preprint","venue":"IEEE Access","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Betweenness centrality; Centrality; Computer science; Network science; Bipartite graph; Network theory; Closeness; Theoretical computer science; Key (lock); Network analysis; Node (physics); Data mining; Exploit; Formal concept analysis; Formalism (music); Complex network; Topology (electrical circuits); Mathematics; Computer security; Algorithm; Combinatorics; Graph","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.00538107,0.0008510866,0.000732181,0.007397186,0.001002751,0.00254844,0.001271647,0.0008896989,0.001620284],"category_scores_gemma":[0.02408057,0.0003626158,0.001070629,0.003762945,0.001213101,0.005280535,0.001786998,0.001264157,0.000439678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00182485,"about_ca_system_score_gemma":0.001456652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005576278,"about_ca_topic_score_gemma":0.005863929,"domain_scores_codex":[0.9973782,0.0009307971,0.0001663514,0.00061533,0.0007742948,0.0001350986],"domain_scores_gemma":[0.9836096,0.01202233,0.001730502,0.0009590128,0.001338001,0.0003406495],"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.0005238216,0.0003895653,0.0695387,0.001078293,0.0003807229,0.000834728,0.003819435,0.244063,0.01214741,0.2116751,0.006322172,0.4492269],"study_design_scores_gemma":[0.00001873241,0.00004972832,0.004424534,0.00007718235,0.00003481928,0.0002386682,0.0005893207,0.8856262,0.002417524,0.1024454,0.004041012,0.0000368896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1199107,0.000831623,0.8736886,0.0005565569,0.00005485761,0.000259342,0.001250559,0.001035098,0.002412715],"genre_scores_gemma":[0.5459295,0.0004580821,0.4502197,0.0001316731,0.0000516845,0.000341382,0.002001252,0.00006765557,0.0007990785],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007397186,"threshold_uncertainty_score":0.02845812,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1045938054224565,"score_gpt":0.445622203072682,"score_spread":0.3410283976502255,"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."}}