{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/feature-selection/papers/6","list_of":"/task/feature-selection","task":"feature selection","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":6,"pages_in_order":30,"rows_per_page":100,"rows":[501,600],"of":2971,"counts":{"archive_papers_tagged":2971,"with_a_code_link":707,"where_syntology_ran_a_sample":85,"not_listed_spam_title":0,"listed":2971,"listed_where_code_ran":85,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":71,"every_run_a_failure_of_syntologys_instrument":14,"listed_with_a_run_with_no_instrument_failure":71,"listed_every_run_a_failure_of_syntologys_instrument":14,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/feature-selection","prev":"/task/feature-selection/papers/5","next":"/task/feature-selection/papers/7","papers":[{"url":"/paper/mh-covidnet-diagnosis-of-covid-19-using-deep","slug":"mh-covidnet-diagnosis-of-covid-19-using-deep","title":"MH-COVIDNet: Diagnosis of COVID-19 using Deep Neural Networks and Meta-heuristic-based Feature Selection on X-ray Images","date":"2020-10-06","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/doubleensemble-a-new-ensemble-method-based-on","slug":"doubleensemble-a-new-ensemble-method-based-on","title":"DoubleEnsemble: A New Ensemble Method Based on Sample Reweighting and Feature Selection for Financial Data Analysis","date":"2020-10-03","arxiv_id":"2010.01265","repositories_listed":1,"syntology":null},{"url":"/paper/covariate-shift-adaptation-in-high","slug":"covariate-shift-adaptation-in-high","title":"Effective Sample Size, Dimensionality, and Generalization in Covariate Shift Adaptation","date":"2020-10-02","arxiv_id":"2010.01184","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/covariate-shift-adaptation-in-high#ran","syntology_url":"https://syntology.ai/paper/2010.01184","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01184"}},"official":{"repos":["felipemaiapolo/infoselect"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/adjusted-measures-for-feature-selection","slug":"adjusted-measures-for-feature-selection","title":"Adjusted Measures for Feature Selection Stability for Data Sets with Similar Features","date":"2020-09-25","arxiv_id":"2009.12075","repositories_listed":1,"syntology":null},{"url":"/paper/dataset-optimization-strategies-for","slug":"dataset-optimization-strategies-for","title":"Dataset Optimization Strategies for MalwareTraffic Detection","date":"2020-09-23","arxiv_id":"2009.11347","repositories_listed":1,"syntology":null},{"url":"/paper/using-unsupervised-learning-to-help-discover","slug":"using-unsupervised-learning-to-help-discover","title":"Using Unsupervised Learning to Help Discover the Causal Graph","date":"2020-09-22","arxiv_id":"2009.10790","repositories_listed":1,"syntology":null},{"url":"/paper/attributes-guided-and-pure-visual-attention","slug":"attributes-guided-and-pure-visual-attention","title":"Attributes-Guided and Pure-Visual Attention Alignment for Few-Shot Recognition","date":"2020-09-10","arxiv_id":"2009.04724","repositories_listed":1,"syntology":null},{"url":"/paper/a-distance-preserving-matrix-sketch","slug":"a-distance-preserving-matrix-sketch","title":"A Distance-preserving Matrix Sketch","date":"2020-09-08","arxiv_id":"2009.03979","repositories_listed":1,"syntology":null},{"url":"/paper/sunny-as2-enhancing-sunny-for-algorithm","slug":"sunny-as2-enhancing-sunny-for-algorithm","title":"sunny-as2: Enhancing SUNNY for Algorithm Selection","date":"2020-09-07","arxiv_id":"2009.03107","repositories_listed":1,"syntology":null},{"url":"/paper/any-to-many-voice-conversion-with-location","slug":"any-to-many-voice-conversion-with-location","title":"Any-to-Many Voice Conversion with Location-Relative Sequence-to-Sequence Modeling","date":"2020-09-06","arxiv_id":"2009.02725","repositories_listed":1,"syntology":null},{"url":"/paper/exact-and-approximation-algorithms-for-sparse","slug":"exact-and-approximation-algorithms-for-sparse","title":"Exact and Approximation Algorithms for Sparse PCA","date":"2020-08-28","arxiv_id":"2008.12438","repositories_listed":1,"syntology":null},{"url":"/paper/autofs-automated-feature-selection-via","slug":"autofs-automated-feature-selection-via","title":"AutoFS: Automated Feature Selection via Diversity-aware Interactive Reinforcement Learning","date":"2020-08-27","arxiv_id":"2008.12001","repositories_listed":1,"syntology":null},{"url":"/paper/duth-at-semeval-2020-task-11-bert-with-entity","slug":"duth-at-semeval-2020-task-11-bert-with-entity","title":"DUTH at SemEval-2020 Task 11: BERT with Entity Mapping for Propaganda Classification","date":"2020-08-22","arxiv_id":"2008.09894","repositories_listed":1,"syntology":null},{"url":"/paper/fatigue-assessment-using-ecg-and-actigraphy","slug":"fatigue-assessment-using-ecg-and-actigraphy","title":"Fatigue Assessment using ECG and Actigraphy Sensors","date":"2020-08-06","arxiv_id":"2008.02871","repositories_listed":1,"syntology":null},{"url":"/paper/conditional-latent-block-model-a-multivariate","slug":"conditional-latent-block-model-a-multivariate","title":"Conditional Latent Block Model: a Multivariate Time Series Clustering Approach for Autonomous Driving Validation","date":"2020-08-03","arxiv_id":"2008.00946","repositories_listed":1,"syntology":null},{"url":"/paper/implicit-regularization-in-deep-learning-a","slug":"implicit-regularization-in-deep-learning-a","title":"Implicit Regularization via Neural Feature Alignment","date":"2020-08-03","arxiv_id":"2008.00938","repositories_listed":1,"syntology":null},{"url":"/paper/accurate-and-efficient-intracranial","slug":"accurate-and-efficient-intracranial","title":"Accurate and Efficient Intracranial Hemorrhage Detection and Subtype Classification in 3D CT Scans with Convolutional and Long Short-Term Memory Neural Networks","date":"2020-08-01","arxiv_id":"2008.00302","repositories_listed":1,"syntology":null},{"url":"/paper/fibonacci-and-k-subsecting-recursive-feature","slug":"fibonacci-and-k-subsecting-recursive-feature","title":"Fibonacci and k-Subsecting Recursive Feature Elimination","date":"2020-07-29","arxiv_id":"2007.14920","repositories_listed":1,"syntology":null},{"url":"/paper/interpretable-anomaly-detection-with-diffi","slug":"interpretable-anomaly-detection-with-diffi","title":"Interpretable Anomaly Detection with DIFFI: Depth-based Isolation Forest Feature Importance","date":"2020-07-21","arxiv_id":"2007.11117","repositories_listed":1,"syntology":null},{"url":"/paper/towards-ground-truth-explainability-on","slug":"towards-ground-truth-explainability-on","title":"Towards Ground Truth Explainability on Tabular Data","date":"2020-07-20","arxiv_id":"2007.10532","repositories_listed":1,"syntology":null},{"url":"/paper/rgb-d-salient-object-detection-with-cross","slug":"rgb-d-salient-object-detection-with-cross","title":"RGB-D Salient Object Detection with Cross-Modality Modulation and Selection","date":"2020-07-14","arxiv_id":"2007.07051","repositories_listed":1,"syntology":null},{"url":"/paper/let-the-data-choose-its-features","slug":"let-the-data-choose-its-features","title":"Differentiable Unsupervised Feature Selection based on a Gated Laplacian","date":"2020-07-09","arxiv_id":"2007.04728","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/let-the-data-choose-its-features#ran","syntology_url":"https://syntology.ai/paper/2007.04728","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04728"}},"official":{"repos":["Ofirlin/DUFS"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/binary-stochastic-filtering-feature-selection","slug":"binary-stochastic-filtering-feature-selection","title":"Binary Stochastic Filtering: feature selection and beyond","date":"2020-07-08","arxiv_id":"2007.03920","repositories_listed":1,"syntology":null},{"url":"/paper/trajectories-bifurcations-and-pseudotime-in","slug":"trajectories-bifurcations-and-pseudotime-in","title":"Trajectories, bifurcations and pseudotime in large clinical datasets: applications to myocardial infarction and diabetes data","date":"2020-07-07","arxiv_id":"2007.03788","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-as-a-competitive-feature-free","slug":"deep-learning-as-a-competitive-feature-free","title":"Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem","date":"2020-06-29","arxiv_id":"2006.15968","repositories_listed":1,"syntology":null},{"url":"/paper/mantra-a-machine-learning-reference","slug":"mantra-a-machine-learning-reference","title":"MANTRA: A Machine Learning reference lightcurve dataset for astronomical transient event recognition","date":"2020-06-23","arxiv_id":"2006.13163","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-model-inherent-variable-importance","slug":"leveraging-model-inherent-variable-importance","title":"Leveraging Model Inherent Variable Importance for Stable Online Feature Selection","date":"2020-06-18","arxiv_id":"2006.10398","repositories_listed":1,"syntology":null},{"url":"/paper/freetree-a-tree-based-approach-for-high","slug":"freetree-a-tree-based-approach-for-high","title":"FREEtree: A Tree-based Approach for High Dimensional Longitudinal Data With Correlated Features","date":"2020-06-17","arxiv_id":"2006.09693","repositories_listed":1,"syntology":null},{"url":"/paper/fanok-knockoffs-in-linear-time","slug":"fanok-knockoffs-in-linear-time","title":"FANOK: Knockoffs in Linear Time","date":"2020-06-15","arxiv_id":"2006.08790","repositories_listed":1,"syntology":null},{"url":"/paper/infinite-feature-selection-a-graph-based","slug":"infinite-feature-selection-a-graph-based","title":"Infinite Feature Selection: A Graph-based Feature Filtering Approach","date":"2020-06-15","arxiv_id":"2006.08184","repositories_listed":1,"syntology":null},{"url":"/paper/optimizing-generalization-on-the-train-set-a","slug":"optimizing-generalization-on-the-train-set-a","title":"Optimizing generalization on the train set: a novel gradient-based framework to train parameters and hyperparameters simultaneously","date":"2020-06-11","arxiv_id":"2006.06705","repositories_listed":1,"syntology":null},{"url":"/paper/optilime-optimized-lime-explanations-for","slug":"optilime-optimized-lime-explanations-for","title":"OptiLIME: Optimized LIME Explanations for Diagnostic Computer Algorithms","date":"2020-06-10","arxiv_id":"2006.05714","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/optilime-optimized-lime-explanations-for#ran","syntology_url":"https://syntology.ai/paper/2006.05714","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05714"}},"official":{"repos":["giorgiovisani/lime_stability"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-infidelity-learning-for-model","slug":"adversarial-infidelity-learning-for-model","title":"Adversarial Infidelity Learning for Model Interpretation","date":"2020-06-09","arxiv_id":"2006.05379","repositories_listed":1,"syntology":null},{"url":"/paper/an-efficient-semi-smooth-newton-augmented","slug":"an-efficient-semi-smooth-newton-augmented","title":"An Efficient Semi-smooth Newton Augmented Lagrangian Method for Elastic Net","date":"2020-06-06","arxiv_id":"2006.03970","repositories_listed":1,"syntology":null},{"url":"/paper/feature-weighted-elastic-net-using-features","slug":"feature-weighted-elastic-net-using-features","title":"Feature-weighted elastic net: using \"features of features\" for better prediction","date":"2020-06-02","arxiv_id":"2006.01395","repositories_listed":1,"syntology":null},{"url":"/paper/cpac-conv-cp-decomposition-to-approximately","slug":"cpac-conv-cp-decomposition-to-approximately","title":"Tensor decomposition to Compress Convolutional Layers in Deep Learning","date":"2020-05-28","arxiv_id":"2005.13746","repositories_listed":1,"syntology":null},{"url":"/paper/early-screening-of-sars-cov-2-by-intelligent","slug":"early-screening-of-sars-cov-2-by-intelligent","title":"Early Screening of SARS-CoV-2 by Intelligent Analysis of X-Ray Images","date":"2020-05-28","arxiv_id":"2005.13928","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-feature-selection-against-evasion","slug":"adversarial-feature-selection-against-evasion","title":"Adversarial Feature Selection against Evasion Attacks","date":"2020-05-25","arxiv_id":"2005.12154","repositories_listed":1,"syntology":null},{"url":"/paper/autosum-automating-feature-extraction-and","slug":"autosum-automating-feature-extraction-and","title":"AutoSUM: Automating Feature Extraction and Multi-user Preference Simulation for Entity Summarization","date":"2020-05-25","arxiv_id":"2005.11888","repositories_listed":1,"syntology":null},{"url":"/paper/feature-robust-optimal-transport-for-high","slug":"feature-robust-optimal-transport-for-high","title":"Feature Robust Optimal Transport for High-dimensional Data","date":"2020-05-25","arxiv_id":"2005.12123","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-refinement-network-for-oriented-and","slug":"dynamic-refinement-network-for-oriented-and","title":"Dynamic Refinement Network for Oriented and Densely Packed Object Detection","date":"2020-05-20","arxiv_id":"2005.09973","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dynamic-refinement-network-for-oriented-and#ran","syntology_url":"https://syntology.ai/paper/2005.09973","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09973"}},"official":{"repos":["Anymake/DRN_CVPR2020"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/convolutional-neural-networks-for-3","slug":"convolutional-neural-networks-for-3","title":"Convolutional neural networks for classification and regression analysis of one-dimensional spectral data","date":"2020-05-15","arxiv_id":"2005.07530","repositories_listed":1,"syntology":null},{"url":"/paper/feature-selection-with-evolving-fast-and-slow","slug":"feature-selection-with-evolving-fast-and-slow","title":"Feature Selection with Evolving, Fast and Slow Using Two Parallel Genetic Algorithms","date":"2020-05-11","arxiv_id":"2005.05268","repositories_listed":1,"syntology":null},{"url":"/paper/ensemble-wrapper-subsampling-for-deep","slug":"ensemble-wrapper-subsampling-for-deep","title":"Ensemble Wrapper Subsampling for Deep Modulation Classification","date":"2020-05-10","arxiv_id":"2005.04586","repositories_listed":1,"syntology":null},{"url":"/paper/feature-selection-methods-for-uplift-modeling","slug":"feature-selection-methods-for-uplift-modeling","title":"Feature Selection Methods for Uplift Modeling and Heterogeneous Treatment Effect","date":"2020-05-05","arxiv_id":"2005.03447","repositories_listed":1,"syntology":null},{"url":"/paper/measuring-the-discrepancy-between-conditional","slug":"measuring-the-discrepancy-between-conditional","title":"Measuring the Discrepancy between Conditional Distributions: Methods, Properties and Applications","date":"2020-05-05","arxiv_id":"2005.02196","repositories_listed":1,"syntology":null},{"url":"/paper/a-novel-outlook-on-feature-selection-as-a","slug":"a-novel-outlook-on-feature-selection-as-a","title":"A Novel Outlook on Feature Selection as a Multi-objective Problem","date":"2020-04-29","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/towards-prediction-explainability-through","slug":"towards-prediction-explainability-through","title":"The Explanation Game: Towards Prediction Explainability through Sparse Communication","date":"2020-04-28","arxiv_id":"2004.13876","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-prediction-explainability-through#ran","syntology_url":"https://syntology.ai/paper/2004.13876","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13876"}},"official":{"repos":["deep-spin/spec"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/an-efficient-parallelized-algorithm-for","slug":"an-efficient-parallelized-algorithm-for","title":"An Efficient, Parallelized Algorithm for Optimal Conditional Entropy-Based Feature Selection","date":"2020-04-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-novel-embedded-min-max-approach-for-feature","slug":"a-novel-embedded-min-max-approach-for-feature","title":"A novel embedded min-max approach for feature selection in nonlinear support vector machine classification","date":"2020-04-21","arxiv_id":"2004.09863","repositories_listed":1,"syntology":null},{"url":"/paper/latent-regularization-for-feature-selection","slug":"latent-regularization-for-feature-selection","title":"Latent regularization for feature selection using kernel methods in tumor classification","date":"2020-04-10","arxiv_id":"2004.04866","repositories_listed":1,"syntology":null},{"url":"/paper/orthant-based-proximal-stochastic-gradient","slug":"orthant-based-proximal-stochastic-gradient","title":"Orthant Based Proximal Stochastic Gradient Method for $\\ell_1$-Regularized Optimization","date":"2020-04-07","arxiv_id":"2004.03639","repositories_listed":1,"syntology":null},{"url":"/paper/ivfs-simple-and-efficient-feature-selection","slug":"ivfs-simple-and-efficient-feature-selection","title":"IVFS: Simple and Efficient Feature Selection for High Dimensional Topology Preservation","date":"2020-04-02","arxiv_id":"2004.01299","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-ask-medical-questions-using","slug":"learning-to-ask-medical-questions-using","title":"Learning to Ask Medical Questions using Reinforcement Learning","date":"2020-03-31","arxiv_id":"2004.00994","repositories_listed":1,"syntology":null},{"url":"/paper/faster-than-fast-gpu-accelerated-frontend-for","slug":"faster-than-fast-gpu-accelerated-frontend-for","title":"Faster than FAST: GPU-Accelerated Frontend for High-Speed VIO","date":"2020-03-30","arxiv_id":"2003.13493","repositories_listed":1,"syntology":null},{"url":"/paper/arda-automatic-relational-data-augmentation","slug":"arda-automatic-relational-data-augmentation","title":"ARDA: Automatic Relational Data Augmentation for Machine Learning","date":"2020-03-21","arxiv_id":"2003.09758","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/arda-automatic-relational-data-augmentation#ran","syntology_url":"https://syntology.ai/paper/2003.09758","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.09758"}},"official":null}},{"url":"/paper/selecting-relevant-features-from-a-universal","slug":"selecting-relevant-features-from-a-universal","title":"Selecting Relevant Features from a Multi-domain Representation for Few-shot Classification","date":"2020-03-20","arxiv_id":"2003.09338","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/selecting-relevant-features-from-a-universal#ran","syntology_url":"https://syntology.ai/paper/2003.09338","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.09338"}},"official":{"repos":["dvornikita/SUR"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-matlab-toolbox-for-feature-importance","slug":"a-matlab-toolbox-for-feature-importance","title":"A Matlab Toolbox for Feature Importance Ranking","date":"2020-03-10","arxiv_id":"2003.08737","repositories_listed":1,"syntology":null},{"url":"/paper/high-dimensional-feature-selection-for","slug":"high-dimensional-feature-selection-for","title":"High-Dimensional Feature Selection for Genomic Datasets","date":"2020-02-27","arxiv_id":"2002.12104","repositories_listed":1,"syntology":null},{"url":"/paper/a-stacking-based-model-for-non-invasive","slug":"a-stacking-based-model-for-non-invasive","title":"A Stacking-Based Model for Non-Invasive Detection of Coronary Heart Disease","date":"2020-02-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/tcmi-a-non-parametric-mutual-dependence","slug":"tcmi-a-non-parametric-mutual-dependence","title":"TCMI: a non-parametric mutual-dependence estimator for multivariate continuous distributions","date":"2020-01-30","arxiv_id":"2001.11212","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-semi-supervised-heterogeneous","slug":"sparse-semi-supervised-heterogeneous","title":"Sparse Semi-supervised Heterogeneous Interbattery Bayesian Analysis","date":"2020-01-24","arxiv_id":"2001.08975","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-feature-selection-based-on","slug":"unsupervised-feature-selection-based-on","title":"Unsupervised Feature Selection based on Adaptive Similarity Learning and Subspace Clustering","date":"2019-12-10","arxiv_id":"1912.05458","repositories_listed":1,"syntology":null},{"url":"/paper/a-real-time-global-inference-network-for-one","slug":"a-real-time-global-inference-network-for-one","title":"A Real-time Global Inference Network for One-stage Referring Expression Comprehension","date":"2019-12-07","arxiv_id":"1912.03478","repositories_listed":1,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":9,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-real-time-global-inference-network-for-one#ran","syntology_url":"https://syntology.ai/paper/1912.03478","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.03478"}},"official":{"repos":["luogen1996/Real-time-Global-Inference-Network"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-sparse-negative-binomial-mixture-model-for","slug":"a-sparse-negative-binomial-mixture-model-for","title":"A sparse negative binomial mixture model for clustering RNA-seq count data","date":"2019-12-05","arxiv_id":"1912.02399","repositories_listed":1,"syntology":null},{"url":"/paper/sapdsoft-anchor-point-detector","slug":"sapdsoft-anchor-point-detector","title":"SAPD：Soft Anchor-Point Detector","date":"2019-11-27","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/causality-based-feature-selection-methods-and","slug":"causality-based-feature-selection-methods-and","title":"Causality-based Feature Selection: Methods and Evaluations","date":"2019-11-17","arxiv_id":"1911.07147","repositories_listed":1,"syntology":null},{"url":"/paper/dualvd-an-adaptive-dual-encoding-model-for","slug":"dualvd-an-adaptive-dual-encoding-model-for","title":"DualVD: An Adaptive Dual Encoding Model for Deep Visual Understanding in Visual Dialogue","date":"2019-11-17","arxiv_id":"1911.07251","repositories_listed":1,"syntology":null},{"url":"/paper/model-augmented-nearest-neighbor-estimation","slug":"model-augmented-nearest-neighbor-estimation","title":"Model-Augmented Estimation of Conditional Mutual Information for Feature Selection","date":"2019-11-12","arxiv_id":"1911.04628","repositories_listed":1,"syntology":null},{"url":"/paper/ptlnc-bxe-prediction-of-plant-lncrnas-using-a","slug":"ptlnc-bxe-prediction-of-plant-lncrnas-using-a","title":"ItLnc-BXE: a Bagging-XGBoost-ensemble method with multiple features for identification of plant lncRNAs","date":"2019-11-01","arxiv_id":"1911.00185","repositories_listed":1,"syntology":null},{"url":"/paper/sobolev-independence-criterion","slug":"sobolev-independence-criterion","title":"Sobolev Independence Criterion","date":"2019-10-31","arxiv_id":"1910.14212","repositories_listed":1,"syntology":null},{"url":"/paper/effectiveness-of-random-deep-feature","slug":"effectiveness-of-random-deep-feature","title":"Effectiveness of random deep feature selection for securing image manipulation detectors against adversarial examples","date":"2019-10-25","arxiv_id":"1910.12392","repositories_listed":1,"syntology":null},{"url":"/paper/malware-classification-using-deep-learning","slug":"malware-classification-using-deep-learning","title":"Malware Classification using Deep Learning based Feature Extraction and Wrapper based Feature Selection Technique","date":"2019-10-24","arxiv_id":"1910.10958","repositories_listed":1,"syntology":null},{"url":"/paper/is-graph-biased-feature-selection-of-genes","slug":"is-graph-biased-feature-selection-of-genes","title":"Is graph-based feature selection of genes better than random?","date":"2019-10-21","arxiv_id":"1910.09600","repositories_listed":1,"syntology":null},{"url":"/paper/tree-based-intelligent-intrusion-detection","slug":"tree-based-intelligent-intrusion-detection","title":"Tree-based Intelligent Intrusion Detection System in Internet of Vehicles","date":"2019-10-18","arxiv_id":"1910.08635","repositories_listed":1,"syntology":null},{"url":"/paper/setexpan-corpus-based-set-expansion-via","slug":"setexpan-corpus-based-set-expansion-via","title":"SetExpan: Corpus-Based Set Expansion via Context Feature Selection and Rank Ensemble","date":"2019-10-17","arxiv_id":"1910.08192","repositories_listed":1,"syntology":null},{"url":"/paper/asymmetric-shapley-values-incorporating","slug":"asymmetric-shapley-values-incorporating","title":"Asymmetric Shapley values: incorporating causal knowledge into model-agnostic explainability","date":"2019-10-14","arxiv_id":"1910.06358","repositories_listed":1,"syntology":null},{"url":"/paper/more-powerful-selective-kernel-tests-for","slug":"more-powerful-selective-kernel-tests-for","title":"More Powerful Selective Kernel Tests for Feature Selection","date":"2019-10-14","arxiv_id":"1910.06134","repositories_listed":1,"syntology":null},{"url":"/paper/prediction-focused-topic-models-via-vocab","slug":"prediction-focused-topic-models-via-vocab","title":"Prediction Focused Topic Models via Feature Selection","date":"2019-10-12","arxiv_id":"1910.05495","repositories_listed":1,"syntology":null},{"url":"/paper/a-nonlocal-feature-driven-exemplar-based","slug":"a-nonlocal-feature-driven-exemplar-based","title":"A nonlocal feature-driven exemplar-based approach for image inpainting","date":"2019-09-20","arxiv_id":"1909.09301","repositories_listed":1,"syntology":null},{"url":"/paper/a-robust-hybrid-approach-for-textual-document","slug":"a-robust-hybrid-approach-for-textual-document","title":"A Robust Hybrid Approach for Textual Document Classification","date":"2019-09-12","arxiv_id":"1909.05478","repositories_listed":1,"syntology":null},{"url":"/paper/feature-engineering-and-forecasting-via","slug":"feature-engineering-and-forecasting-via","title":"Feature Engineering and Forecasting via Derivative-free Optimization and Ensemble of Sequence-to-sequence Networks with Applications in Renewable Energy","date":"2019-09-12","arxiv_id":"1909.05447","repositories_listed":1,"syntology":null},{"url":"/paper/describing-objects-by-their-attributes","slug":"describing-objects-by-their-attributes","title":"Describing objects by their attributes","date":"2019-08-18","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/attentive-deep-regression-networks-for-real","slug":"attentive-deep-regression-networks-for-real","title":"Attentive Deep Regression Networks for Real-Time Visual Face Tracking in Video Surveillance","date":"2019-08-10","arxiv_id":"1908.03812","repositories_listed":1,"syntology":null},{"url":"/paper/joint-group-feature-selection-and","slug":"joint-group-feature-selection-and","title":"Joint Group Feature Selection and Discriminative Filter Learning for Robust Visual Object Tracking","date":"2019-07-30","arxiv_id":"1907.13242","repositories_listed":1,"syntology":null},{"url":"/paper/feature-selection-via-mutual-information-new","slug":"feature-selection-via-mutual-information-new","title":"Feature Selection via Mutual Information: New Theoretical Insights","date":"2019-07-17","arxiv_id":"1907.07384","repositories_listed":1,"syntology":null},{"url":"/paper/estimation-and-feature-selection-in-mixtures","slug":"estimation-and-feature-selection-in-mixtures","title":"Estimation and Feature Selection in Mixtures of Generalized Linear Experts Models","date":"2019-07-14","arxiv_id":"1907.06994","repositories_listed":1,"syntology":null},{"url":"/paper/dlime-a-deterministic-local-interpretable","slug":"dlime-a-deterministic-local-interpretable","title":"DLIME: A Deterministic Local Interpretable Model-Agnostic Explanations Approach for Computer-Aided Diagnosis Systems","date":"2019-06-24","arxiv_id":"1906.10263","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dlime-a-deterministic-local-interpretable#ran","syntology_url":"https://syntology.ai/paper/1906.10263","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.10263"}},"official":{"repos":["rehmanzafar/dlime_experiments"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/digivoice-voice-biomarker-featurization-and","slug":"digivoice-voice-biomarker-featurization-and","title":"DigiVoice: Voice Biomarker Featurization and Analysis Pipeline","date":"2019-06-17","arxiv_id":"1906.07222","repositories_listed":1,"syntology":null},{"url":"/paper/ccmi-classifier-based-conditional-mutual","slug":"ccmi-classifier-based-conditional-mutual","title":"CCMI : Classifier based Conditional Mutual Information Estimation","date":"2019-06-05","arxiv_id":"1906.01824","repositories_listed":1,"syntology":null},{"url":"/paper/190600195","slug":"190600195","title":"Multivariate, Multistep Forecasting, Reconstruction and Feature Selection of Ocean Waves via Recurrent and Sequence-to-Sequence Networks","date":"2019-06-01","arxiv_id":"1906.00195","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-wrapper-feature-selection-using","slug":"efficient-wrapper-feature-selection-using","title":"Efficient Wrapper Feature Selection using Autoencoder and Model Based Elimination","date":"2019-05-28","arxiv_id":"1905.11592","repositories_listed":1,"syntology":null},{"url":"/paper/naive-feature-selection-sparsity-in-naive","slug":"naive-feature-selection-sparsity-in-naive","title":"Naive Feature Selection: a Nearly Tight Convex Relaxation for Sparse Naive Bayes","date":"2019-05-23","arxiv_id":"1905.09884","repositories_listed":1,"syntology":null},{"url":"/paper/a-comparative-analysis-of-feature-selection","slug":"a-comparative-analysis-of-feature-selection","title":"A Comparative Analysis of Feature Selection Methods for Biomarker Discovery in Study of Toxicant-treated Atlantic Cod (Gadus morhua) Liver","date":"2019-05-20","arxiv_id":"1905.08048","repositories_listed":1,"syntology":null},{"url":"/paper/qbso-fs-a-reinforcement-learning-based-bee","slug":"qbso-fs-a-reinforcement-learning-based-bee","title":"QBSO-FS: A Reinforcement Learning Based Bee Swarm Optimization Metaheuristic for Feature Selection","date":"2019-05-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/invase-instance-wise-variable-selection-using","slug":"invase-instance-wise-variable-selection-using","title":"INVASE: Instance-wise Variable Selection using Neural Networks","date":"2019-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/knockoffgan-generating-knockoffs-for-feature","slug":"knockoffgan-generating-knockoffs-for-feature","title":"KnockoffGAN: Generating Knockoffs for Feature Selection using Generative Adversarial Networks","date":"2019-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-scalable-saliency-based-feature-selection","slug":"a-scalable-saliency-based-feature-selection","title":"A scalable saliency-based Feature selection method with instance level information","date":"2019-04-30","arxiv_id":"1904.13127","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-scalable-saliency-based-feature-selection#ran","syntology_url":"https://syntology.ai/paper/1904.13127","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.13127"}},"official":{"repos":["braisCB/SFS"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/predicting-fluid-intelligence-of-children","slug":"predicting-fluid-intelligence-of-children","title":"Predicting Fluid Intelligence of Children using T1-weighted MR Images and a StackNet","date":"2019-04-16","arxiv_id":"1904.07387","repositories_listed":1,"syntology":null},{"url":"/paper/a-topological-data-analysis-based","slug":"a-topological-data-analysis-based","title":"A topological data analysis based classification method for multiple measurements","date":"2019-04-05","arxiv_id":"1904.02971","repositories_listed":1,"syntology":null}],"record_sha256":"370641f6d7d5356fe85f6b1f9caf3b219992dfdbd138c8c28bd9e5eb92f6600e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}