{"id":"W2897518515","doi":"10.1007/s00034-018-0961-y","title":"A Computationally Efficient Blind Source Extraction Using Idempotent Transformation Matrix","year":2018,"lang":"en","type":"article","venue":"Circuits Systems and Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Blind signal separation; Algorithm; Computational complexity theory; Singular value decomposition; Computer science; Independent component analysis; Matrix (chemical analysis); Distortion (music); Computation; Transformation (genetics); Mathematics; Mathematical optimization; Artificial intelligence","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.0008414724,0.0001520473,0.0001767224,0.0002268685,0.000512438,0.0008153647,0.0001933441,0.0001002552,0.000002604854],"category_scores_gemma":[0.000008859128,0.0001450367,0.00003687693,0.0003762074,0.00006811714,0.0008994487,0.00003147021,0.0001311779,0.000008398472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006855589,"about_ca_system_score_gemma":0.0001495129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003115968,"about_ca_topic_score_gemma":0.000001259262,"domain_scores_codex":[0.9984743,0.0001188888,0.0004474802,0.0003314992,0.0004151576,0.0002127041],"domain_scores_gemma":[0.9991105,0.00004741736,0.0002675417,0.0001221525,0.0003615032,0.00009089266],"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.00004520431,0.0003160454,0.0002251525,0.001020263,0.00006528124,0.0000126353,0.05127527,0.2654391,0.1622587,0.05945955,0.0001111924,0.4597716],"study_design_scores_gemma":[0.0003157069,0.00006918367,0.0002046432,0.0001981673,0.000009422805,0.0001797426,0.0002866688,0.9955432,0.001964206,0.0004460684,0.0005979321,0.0001851052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1379974,0.000463109,0.8602659,0.00009950783,0.00009347098,0.000306542,9.228192e-7,0.0002112302,0.0005619332],"genre_scores_gemma":[0.9936731,0.000002192402,0.005982578,0.00009669796,0.0001755806,0.00001210119,0.000003333937,0.00001299615,0.00004145855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8556757,"threshold_uncertainty_score":0.786258,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03734896975669077,"score_gpt":0.3128192243894432,"score_spread":0.2754702546327524,"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."}}