{"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/7","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":7,"pages_in_order":30,"rows_per_page":100,"rows":[601,700],"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/6","next":"/task/feature-selection/papers/8","papers":[{"url":"/paper/uafs-uncertainty-aware-feature-selection-for","slug":"uafs-uncertainty-aware-feature-selection-for","title":"UAFS: Uncertainty-Aware Feature Selection for Problems with Missing Data","date":"2019-04-02","arxiv_id":"1904.01385","repositories_listed":1,"syntology":null},{"url":"/paper/stable-prediction-with-radiomics-data","slug":"stable-prediction-with-radiomics-data","title":"Stable prediction with radiomics data","date":"2019-03-27","arxiv_id":"1903.11696","repositories_listed":1,"syntology":null},{"url":"/paper/deep-feature-selection-using-a-teacher","slug":"deep-feature-selection-using-a-teacher","title":"Deep Feature Selection using a Teacher-Student Network","date":"2019-03-17","arxiv_id":"1903.07045","repositories_listed":1,"syntology":null},{"url":"/paper/semantically-tied-paired-cycle-consistency","slug":"semantically-tied-paired-cycle-consistency","title":"Semantically Tied Paired Cycle Consistency for Zero-Shot Sketch-based Image Retrieval","date":"2019-03-08","arxiv_id":"1903.03372","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/semantically-tied-paired-cycle-consistency#ran","syntology_url":"https://syntology.ai/paper/1903.03372","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.03372"}},"official":{"repos":["AnjanDutta/sem-pcyc"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-parallel-algorithms-for-feature","slug":"fast-parallel-algorithms-for-feature","title":"Fast Parallel Algorithms for Statistical Subset Selection Problems","date":"2019-03-06","arxiv_id":"1903.02656","repositories_listed":1,"syntology":null},{"url":"/paper/fast-adaptive-k-means-subspace-clustering-for","slug":"fast-adaptive-k-means-subspace-clustering-for","title":"Fast Adaptive K-Means Subspace Clustering for High-Dimensional Data","date":"2019-03-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/afs-an-attention-based-mechanism-for","slug":"afs-an-attention-based-mechanism-for","title":"AFS: An Attention-based mechanism for Supervised Feature Selection","date":"2019-02-28","arxiv_id":"1902.11074","repositories_listed":1,"syntology":null},{"url":"/paper/a-comparative-study-of-feature-selection","slug":"a-comparative-study-of-feature-selection","title":"A Comparative Study of Feature Selection Methods for Dialectal Arabic Sentiment Classification Using Support Vector Machine","date":"2019-02-17","arxiv_id":"1902.06242","repositories_listed":1,"syntology":null},{"url":"/paper/binary-stochastic-filtering-a-solution-for","slug":"binary-stochastic-filtering-a-solution-for","title":"Binary Stochastic Filtering: a Method for Neural Network Size Minimization and Supervised Feature Selection","date":"2019-02-12","arxiv_id":"1902.04510","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-feature-selection-in-kernel","slug":"sparse-feature-selection-in-kernel","title":"Sparse Feature Selection in Kernel Discriminant Analysis via Optimal Scoring","date":"2019-02-12","arxiv_id":"1902.04248","repositories_listed":1,"syntology":null},{"url":"/paper/crop-yield-prediction-using-deep-neural","slug":"crop-yield-prediction-using-deep-neural","title":"Crop Yield Prediction Using Deep Neural Networks","date":"2019-02-07","arxiv_id":"1902.02860","repositories_listed":1,"syntology":null},{"url":"/paper/reparameterizable-subset-sampling-via","slug":"reparameterizable-subset-sampling-via","title":"Reparameterizable Subset Sampling via Continuous Relaxations","date":"2019-01-29","arxiv_id":"1901.10517","repositories_listed":1,"syntology":null},{"url":"/paper/secure-multi-party-linear-regression-at","slug":"secure-multi-party-linear-regression-at","title":"Secure multi-party linear regression at plaintext speed","date":"2019-01-28","arxiv_id":"1901.09531","repositories_listed":1,"syntology":null},{"url":"/paper/rescaling-and-other-forms-of-unsupervised","slug":"rescaling-and-other-forms-of-unsupervised","title":"On the cross-validation bias due to unsupervised pre-processing","date":"2019-01-25","arxiv_id":"1901.08974","repositories_listed":1,"syntology":null},{"url":"/paper/interpretable-preference-learning-a-game","slug":"interpretable-preference-learning-a-game","title":"Interpretable preference learning: a game theoretic framework for large margin on-line feature and rule learning","date":"2018-12-19","arxiv_id":"1812.07895","repositories_listed":1,"syntology":null},{"url":"/paper/trade-selection-with-supervised-learning-and","slug":"trade-selection-with-supervised-learning-and","title":"Trade Selection with Supervised Learning and OCA","date":"2018-12-09","arxiv_id":"1812.04486","repositories_listed":1,"syntology":null},{"url":"/paper/feature-selection-with-optimal-coordinate","slug":"feature-selection-with-optimal-coordinate","title":"Feature selection with optimal coordinate ascent (OCA)","date":"2018-11-29","arxiv_id":"1811.12064","repositories_listed":1,"syntology":null},{"url":"/paper/visual-slam-with-network-uncertainty-informed","slug":"visual-slam-with-network-uncertainty-informed","title":"Network Uncertainty Informed Semantic Feature Selection for Visual SLAM","date":"2018-11-29","arxiv_id":"1811.11946","repositories_listed":1,"syntology":null},{"url":"/paper/feature-selection-for-survival-analysis-with","slug":"feature-selection-for-survival-analysis-with","title":"Feature Selection for Survival Analysis with Competing Risks using Deep Learning","date":"2018-11-22","arxiv_id":"1811.09317","repositories_listed":1,"syntology":null},{"url":"/paper/efsis-ensemble-feature-selection-integrating","slug":"efsis-ensemble-feature-selection-integrating","title":"EFSIS: Ensemble Feature Selection Integrating Stability","date":"2018-11-19","arxiv_id":"1811.07939","repositories_listed":1,"syntology":null},{"url":"/paper/feature-selection-as-monte-carlo-search-in","slug":"feature-selection-as-monte-carlo-search-in","title":"Feature selection as Monte-Carlo Search in Growing Single Rooted Directed Acyclic Graph by Best Leaf Identification","date":"2018-11-19","arxiv_id":"1811.07531","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-learning-with-contrastive-latent","slug":"unsupervised-learning-with-contrastive-latent","title":"Unsupervised learning with contrastive latent variable models","date":"2018-11-14","arxiv_id":"1811.06094","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/unsupervised-learning-with-contrastive-latent#ran","syntology_url":"https://syntology.ai/paper/1811.06094","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.06094"}},"official":{"repos":["kseverso/contrastive-LVM"],"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/learning-energy-based-inpainting-for-optical","slug":"learning-energy-based-inpainting-for-optical","title":"Learning Energy Based Inpainting for Optical Flow","date":"2018-11-09","arxiv_id":"1811.03721","repositories_listed":1,"syntology":null},{"url":"/paper/independent-vector-analysis-for-data-fusion","slug":"independent-vector-analysis-for-data-fusion","title":"Independent Vector Analysis for Data Fusion Prior to Molecular Property Prediction with Machine Learning","date":"2018-11-01","arxiv_id":"1811.00628","repositories_listed":1,"syntology":null},{"url":"/paper/advancing-pico-element-detection-in-medical","slug":"advancing-pico-element-detection-in-medical","title":"Advancing PICO Element Detection in Biomedical Text via Deep Neural Networks","date":"2018-10-30","arxiv_id":"1810.12780","repositories_listed":1,"syntology":null},{"url":"/paper/large-scale-visual-place-recognition-with-sub","slug":"large-scale-visual-place-recognition-with-sub","title":"Large scale visual place recognition with sub-linear storage growth","date":"2018-10-23","arxiv_id":"1810.09660","repositories_listed":1,"syntology":null},{"url":"/paper/pruning-deep-neural-networks-using-partial","slug":"pruning-deep-neural-networks-using-partial","title":"Pruning Deep Neural Networks using Partial Least Squares","date":"2018-10-17","arxiv_id":"1810.07610","repositories_listed":1,"syntology":null},{"url":"/paper/convex-hull-approximation-of-nearly-optimal","slug":"convex-hull-approximation-of-nearly-optimal","title":"Convex Hull Approximation of Nearly Optimal Lasso Solutions","date":"2018-10-14","arxiv_id":"1810.05992","repositories_listed":1,"syntology":null},{"url":"/paper/dpasf-a-flink-library-for-streaming-data","slug":"dpasf-a-flink-library-for-streaming-data","title":"DPASF: A Flink Library for Streaming Data preprocessing","date":"2018-10-14","arxiv_id":"1810.06021","repositories_listed":1,"syntology":null},{"url":"/paper/feature-selection-using-stochastic-gates","slug":"feature-selection-using-stochastic-gates","title":"Feature Selection using Stochastic Gates","date":"2018-10-09","arxiv_id":"1810.04247","repositories_listed":1,"syntology":null},{"url":"/paper/projective-inference-in-high-dimensional","slug":"projective-inference-in-high-dimensional","title":"Projective Inference in High-dimensional Problems: Prediction and Feature Selection","date":"2018-10-04","arxiv_id":"1810.02406","repositories_listed":1,"syntology":null},{"url":"/paper/accurate-dictionary-learning-with-direct","slug":"accurate-dictionary-learning-with-direct","title":"Accurate Dictionary Learning with Direct Sparsity Control","date":"2018-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/sparse-group-bayesian-feature-selection-using","slug":"sparse-group-bayesian-feature-selection-using","title":"Sparse-Group Bayesian Feature Selection Using Expectation Propagation for Signal Recovery and Network Reconstruction","date":"2018-09-25","arxiv_id":"1809.09367","repositories_listed":1,"syntology":null},{"url":"/paper/but-how-does-it-work-in-theory-linear-svm","slug":"but-how-does-it-work-in-theory-linear-svm","title":"But How Does It Work in Theory? Linear SVM with Random Features","date":"2018-09-12","arxiv_id":"1809.04481","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/but-how-does-it-work-in-theory-linear-svm#ran","syntology_url":"https://syntology.ai/paper/1809.04481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.04481"}},"official":{"repos":["syitong/randfourier"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deeppink-reproducible-feature-selection-in","slug":"deeppink-reproducible-feature-selection-in","title":"DeepPINK: reproducible feature selection in deep neural networks","date":"2018-09-04","arxiv_id":"1809.01185","repositories_listed":1,"syntology":null},{"url":"/paper/parameter-transfer-extreme-learning-machine","slug":"parameter-transfer-extreme-learning-machine","title":"Parameter Transfer Extreme Learning Machine based on Projective Model","date":"2018-09-04","arxiv_id":"1809.01018","repositories_listed":1,"syntology":null},{"url":"/paper/multivariate-extension-of-matrix-based-renyis","slug":"multivariate-extension-of-matrix-based-renyis","title":"Multivariate Extension of Matrix-based Renyi's α-order Entropy Functional","date":"2018-08-23","arxiv_id":"1808.07912","repositories_listed":1,"syntology":null},{"url":"/paper/interpretable-time-series-classification","slug":"interpretable-time-series-classification","title":"Interpretable Time Series Classification using All-Subsequence Learning and Symbolic Representations in Time and Frequency Domains","date":"2018-08-12","arxiv_id":"1808.04022","repositories_listed":1,"syntology":null},{"url":"/paper/on-feature-selection-and-evaluation-of","slug":"on-feature-selection-and-evaluation-of","title":"On feature selection and evaluation of transportation mode prediction strategies","date":"2018-08-09","arxiv_id":"1808.03096","repositories_listed":1,"syntology":null},{"url":"/paper/learning-adaptive-discriminative-correlation","slug":"learning-adaptive-discriminative-correlation","title":"Learning Adaptive Discriminative Correlation Filters via Temporal Consistency Preserving Spatial Feature Selection for Robust Visual Tracking","date":"2018-07-30","arxiv_id":"1807.11348","repositories_listed":1,"syntology":null},{"url":"/paper/pairwise-body-part-attention-for-recognizing","slug":"pairwise-body-part-attention-for-recognizing","title":"Pairwise Body-Part Attention for Recognizing Human-Object Interactions","date":"2018-07-28","arxiv_id":"1807.10889","repositories_listed":1,"syntology":null},{"url":"/paper/binacox-automatic-cut-points-detection-in","slug":"binacox-automatic-cut-points-detection-in","title":"Binacox: automatic cut-point detection in high-dimensional Cox model with applications in genetics","date":"2018-07-25","arxiv_id":"1807.09813","repositories_listed":1,"syntology":null},{"url":"/paper/lilikoi-an-r-package-for-personalized-pathway","slug":"lilikoi-an-r-package-for-personalized-pathway","title":"Lilikoi: an R package for personalized pathway-based classification modeling using metabolomics data","date":"2018-07-18","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/diagonal-discriminant-analysis-with-feature","slug":"diagonal-discriminant-analysis-with-feature","title":"Diagonal Discriminant Analysis with Feature Selection for High Dimensional Data","date":"2018-07-04","arxiv_id":"1807.01422","repositories_listed":1,"syntology":null},{"url":"/paper/ultra-large-scale-feature-selection-using","slug":"ultra-large-scale-feature-selection-using","title":"Ultra Large-Scale Feature Selection using Count-Sketches","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/diverse-online-feature-selection","slug":"diverse-online-feature-selection","title":"Diverse Online Feature Selection","date":"2018-06-12","arxiv_id":"1806.04308","repositories_listed":1,"syntology":null},{"url":"/paper/mission-ultra-large-scale-feature-selection","slug":"mission-ultra-large-scale-feature-selection","title":"MISSION: Ultra Large-Scale Feature Selection using Count-Sketches","date":"2018-06-12","arxiv_id":"1806.04310","repositories_listed":1,"syntology":null},{"url":"/paper/developing-a-machine-learning-framework-for","slug":"developing-a-machine-learning-framework-for","title":"Developing a machine learning framework for estimating soil moisture with VNIR hyperspectral data","date":"2018-04-24","arxiv_id":"1804.09046","repositories_listed":1,"syntology":null},{"url":"/paper/belief-a-distance-based-redundancy-proof","slug":"belief-a-distance-based-redundancy-proof","title":"BELIEF: A distance-based redundancy-proof feature selection method for Big Data","date":"2018-04-16","arxiv_id":"1804.05774","repositories_listed":1,"syntology":null},{"url":"/paper/feature-weighting-and-regularization-of","slug":"feature-weighting-and-regularization-of","title":"Feature Weighting and Regularization of Common Spatial Patterns in EEG-Based Motor Imagery BCI","date":"2018-04-05","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/projective-splitting-with-forward-steps-1","slug":"projective-splitting-with-forward-steps-1","title":"Projective Splitting with Forward Steps: Asynchronous and Block-Iterative Operator Splitting","date":"2018-03-19","arxiv_id":"1803.07043","repositories_listed":1,"syntology":null},{"url":"/paper/rare-feature-selection-in-high-dimensions","slug":"rare-feature-selection-in-high-dimensions","title":"Rare Feature Selection in High Dimensions","date":"2018-03-18","arxiv_id":"1803.06675","repositories_listed":1,"syntology":null},{"url":"/paper/anticipation-in-human-robot-cooperation-a","slug":"anticipation-in-human-robot-cooperation-a","title":"Anticipation in Human-Robot Cooperation: A Recurrent Neural Network Approach for Multiple Action Sequences Prediction","date":"2018-02-28","arxiv_id":"1802.10503","repositories_listed":1,"syntology":null},{"url":"/paper/salientdso-bringing-attention-to-direct","slug":"salientdso-bringing-attention-to-direct","title":"SalientDSO: Bringing Attention to Direct Sparse Odometry","date":"2018-02-28","arxiv_id":"1803.00127","repositories_listed":1,"syntology":null},{"url":"/paper/cadre-modeling-simultaneously-discovering","slug":"cadre-modeling-simultaneously-discovering","title":"Cadre Modeling: Simultaneously Discovering Subpopulations and Predictive Models","date":"2018-02-07","arxiv_id":"1802.02500","repositories_listed":1,"syntology":null},{"url":"/paper/evaluation-of-a-novel-ga-based-methodology","slug":"evaluation-of-a-novel-ga-based-methodology","title":"Evaluation of a novel GA-based methodology for model structure selection: The GA-PARSIMONY","date":"2018-01-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/multivariate-time-series-classification-with","slug":"multivariate-time-series-classification-with","title":"Multivariate Time Series Classification with WEASEL+MUSE","date":"2017-11-30","arxiv_id":"1711.11343","repositories_listed":1,"syntology":null},{"url":"/paper/sketching-linear-classifiers-over-data","slug":"sketching-linear-classifiers-over-data","title":"Sketching Linear Classifiers over Data Streams","date":"2017-11-07","arxiv_id":"1711.02305","repositories_listed":1,"syntology":null},{"url":"/paper/contextual-regression-an-accurate-and","slug":"contextual-regression-an-accurate-and","title":"Contextual Regression: An Accurate and Conveniently Interpretable Nonlinear Model for Mining Discovery from Scientific Data","date":"2017-10-30","arxiv_id":"1710.10728","repositories_listed":1,"syntology":null},{"url":"/paper/a-two-level-classification-approach-for","slug":"a-two-level-classification-approach-for","title":"A Two-Level Classification Approach for Detecting Clickbait Posts using Text-Based Features","date":"2017-10-23","arxiv_id":"1710.08528","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-a-version-of-multivariate","slug":"understanding-a-version-of-multivariate","title":"Understanding a Version of Multivariate Symmetric Uncertainty to assist in Feature Selection","date":"2017-09-25","arxiv_id":"1709.08730","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-principal-component-analysis","slug":"contrastive-principal-component-analysis","title":"Contrastive Principal Component Analysis","date":"2017-09-20","arxiv_id":"1709.06716","repositories_listed":1,"syntology":null},{"url":"/paper/rotation-adaptive-visual-object-tracking-with","slug":"rotation-adaptive-visual-object-tracking-with","title":"Rotation Adaptive Visual Object Tracking with Motion Consistency","date":"2017-09-18","arxiv_id":"1709.06057","repositories_listed":1,"syntology":null},{"url":"/paper/feature-selection-in-high-dimensional-dataset","slug":"feature-selection-in-high-dimensional-dataset","title":"Feature selection in high-dimensional dataset using MapReduce","date":"2017-09-07","arxiv_id":"1709.02327","repositories_listed":1,"syntology":null},{"url":"/paper/integrate-multi-omic-data-using-affinity","slug":"integrate-multi-omic-data-using-affinity","title":"Integrate Multi-omic Data Using Affinity Network Fusion (ANF) for Cancer Patient Clustering","date":"2017-08-23","arxiv_id":"1708.07136","repositories_listed":1,"syntology":null},{"url":"/paper/featsel-a-framework-for-benchmarking-of","slug":"featsel-a-framework-for-benchmarking-of","title":"featsel: A framework for benchmarking of feature selection algorithms and cost functions","date":"2017-07-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/an-information-theory-based-feature-selection","slug":"an-information-theory-based-feature-selection","title":"An Information Theory-Based Feature Selection Framework for Big Data Under Apache Spark","date":"2017-07-06","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/kernel-feature-selection-via-conditional","slug":"kernel-feature-selection-via-conditional","title":"Kernel Feature Selection via Conditional Covariance Minimization","date":"2017-07-04","arxiv_id":"1707.01164","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/kernel-feature-selection-via-conditional#ran","syntology_url":"https://syntology.ai/paper/1707.01164","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.01164"}},"official":{"repos":["Jianbo-Lab/CCM"],"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/high-dimensional-classification-by-sparse","slug":"high-dimensional-classification-by-sparse","title":"High-dimensional classification by sparse logistic regression","date":"2017-06-26","arxiv_id":"1706.08344","repositories_listed":1,"syntology":null},{"url":"/paper/multiobjective-programming-for-type-2","slug":"multiobjective-programming-for-type-2","title":"Multiobjective Programming for Type-2 Hierarchical Fuzzy Inference Trees","date":"2017-05-16","arxiv_id":"1705.05769","repositories_listed":1,"syntology":null},{"url":"/paper/learning-task-structure-via-sparsity-grouped","slug":"learning-task-structure-via-sparsity-grouped","title":"Learning task structure via sparsity grouped multitask learning","date":"2017-05-13","arxiv_id":"1705.04886","repositories_listed":1,"syntology":null},{"url":"/paper/know-your-master-driver-profiling-based-anti","slug":"know-your-master-driver-profiling-based-anti","title":"Know Your Master: Driver Profiling-based Anti-theft Method","date":"2017-04-18","arxiv_id":"1704.05223","repositories_listed":1,"syntology":null},{"url":"/paper/mixed-graphical-models-for-causal-analysis-of","slug":"mixed-graphical-models-for-causal-analysis-of","title":"Mixed Graphical Models for Causal Analysis of Multi-modal Variables","date":"2017-04-09","arxiv_id":"1704.02621","repositories_listed":1,"syntology":null},{"url":"/paper/supervised-infinite-feature-selection","slug":"supervised-infinite-feature-selection","title":"Supervised Infinite Feature Selection","date":"2017-04-09","arxiv_id":"1704.02665","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-multi-label-feature-selection","slug":"semi-supervised-multi-label-feature-selection","title":"Semi-supervised multi-label feature selection via label correlation analysis with l1-norm graph embedding","date":"2017-03-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/finding-statistically-significant-attribute","slug":"finding-statistically-significant-attribute","title":"Finding Statistically Significant Attribute Interactions","date":"2016-12-22","arxiv_id":"1612.07597","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-high-order-interaction-aware","slug":"efficient-high-order-interaction-aware","title":"Efficient High-Order Interaction-Aware Feature Selection Based on Conditional Mutual Information","date":"2016-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/lost-in-space-geolocation-in-event-data","slug":"lost-in-space-geolocation-in-event-data","title":"Lost in Space: Geolocation in Event Data","date":"2016-11-14","arxiv_id":"1611.04837","repositories_listed":1,"syntology":null},{"url":"/paper/group-sparse-regularization-for-deep-neural","slug":"group-sparse-regularization-for-deep-neural","title":"Group Sparse Regularization for Deep Neural Networks","date":"2016-07-02","arxiv_id":"1607.00485","repositories_listed":1,"syntology":null},{"url":"/paper/variational-information-maximization-for","slug":"variational-information-maximization-for","title":"Variational Information Maximization for Feature Selection","date":"2016-06-09","arxiv_id":"1606.02827","repositories_listed":1,"syntology":null},{"url":"/paper/lofs-library-of-online-streaming-feature","slug":"lofs-library-of-online-streaming-feature","title":"LOFS: Library of Online Streaming Feature Selection","date":"2016-03-02","arxiv_id":"1603.00531","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-convex-clustering","slug":"sparse-convex-clustering","title":"Sparse Convex Clustering","date":"2016-01-18","arxiv_id":"1601.04586","repositories_listed":1,"syntology":null},{"url":"/paper/llsf-learning-label-specific-features-for","slug":"llsf-learning-label-specific-features-for","title":"LLSF - Learning Label Specific Features for Multi-Label Classifcation","date":"2016-01-07","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/explorekit-automatic-feature-generation-and","slug":"explorekit-automatic-feature-generation-and","title":"ExploreKit: Automatic Feature Generation and Selection","date":"2016-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/infinite-feature-selection","slug":"infinite-feature-selection","title":"Infinite Feature Selection","date":"2015-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/scalable-and-accurate-online-feature","slug":"scalable-and-accurate-online-feature","title":"Scalable and Accurate Online Feature Selection for Big Data","date":"2015-11-30","arxiv_id":"1511.09263","repositories_listed":1,"syntology":null},{"url":"/paper/sacrificing-information-for-the-greater-good","slug":"sacrificing-information-for-the-greater-good","title":"Sacrificing information for the greater good: how to select photometric bands for optimal accuracy","date":"2015-11-17","arxiv_id":"1511.05424","repositories_listed":1,"syntology":null},{"url":"/paper/ga-parsimony-a-ga-svr-approach-with-feature","slug":"ga-parsimony-a-ga-svr-approach-with-feature","title":"GA-PARSIMONY: A GA-SVR approach with feature selection and parameter optimization to obtain parsimonious solutions for predicting temperature settings in a continuous annealing furnace","date":"2015-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/interpretable-selection-and-visualization-of","slug":"interpretable-selection-and-visualization-of","title":"Interpretable Selection and Visualization of Features and Interactions Using Bayesian Forests","date":"2015-06-08","arxiv_id":"1506.02371","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-feature-selection-with-adaptive","slug":"unsupervised-feature-selection-with-adaptive","title":"Unsupervised Feature Selection with Adaptive Structure Learning","date":"2015-04-03","arxiv_id":"1504.00736","repositories_listed":1,"syntology":null},{"url":"/paper/fast-forward-feature-selection-for-the","slug":"fast-forward-feature-selection-for-the","title":"Fast forward feature selection for the nonlinear classification of hyperspectral images","date":"2015-01-05","arxiv_id":"1501.00857","repositories_listed":1,"syntology":null},{"url":"/paper/attentional-neural-network-feature-selection","slug":"attentional-neural-network-feature-selection","title":"Attentional Neural Network: Feature Selection Using Cognitive Feedback","date":"2014-11-19","arxiv_id":"1411.5140","repositories_listed":1,"syntology":null},{"url":"/paper/approximate-false-positive-rate-control-in","slug":"approximate-false-positive-rate-control-in","title":"Approximate False Positive Rate Control in Selection Frequency for Random Forest","date":"2014-10-10","arxiv_id":"1410.2838","repositories_listed":1,"syntology":null},{"url":"/paper/a-hash-based-co-clustering-algorithm-for","slug":"a-hash-based-co-clustering-algorithm-for","title":"A Hash-based Co-Clustering Algorithm for Categorical Data","date":"2014-07-29","arxiv_id":"1407.7753","repositories_listed":1,"syntology":null},{"url":"/paper/a-data-driven-approach-to-predict-the-success","slug":"a-data-driven-approach-to-predict-the-success","title":"A data-driven approach to predict the success of bank telemarketing","date":"2014-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fully-bayesian-logistic-regression-with-hyper","slug":"fully-bayesian-logistic-regression-with-hyper","title":"Fully Bayesian Logistic Regression with Hyper-Lasso Priors for High-dimensional Feature Selection","date":"2014-05-13","arxiv_id":"1405.3319","repositories_listed":1,"syntology":null},{"url":"/paper/high-dimensional-semiparametric-latent","slug":"high-dimensional-semiparametric-latent","title":"High Dimensional Semiparametric Latent Graphical Model for Mixed Data","date":"2014-04-29","arxiv_id":"1404.7236","repositories_listed":1,"syntology":null},{"url":"/paper/using-reinforcement-learning-to-find-an","slug":"using-reinforcement-learning-to-find-an","title":"Using reinforcement learning to find an optimal set of features","date":"2013-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/feature-selection-with-annealing-for-computer","slug":"feature-selection-with-annealing-for-computer","title":"Feature Selection with Annealing for Computer Vision and Big Data Learning","date":"2013-10-10","arxiv_id":"1310.2880","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-and-functional-principal-components","slug":"sparse-and-functional-principal-components","title":"Sparse and Functional Principal Components Analysis","date":"2013-09-11","arxiv_id":"1309.2895","repositories_listed":1,"syntology":null}],"record_sha256":"14e7de1c885205926ffc6710823affad0d45a8fbec9a84d2b873062f1b5fe969","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}