{"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/30","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":30,"pages_in_order":30,"rows_per_page":100,"rows":[2901,2971],"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/29","next":null,"papers":[{"url":null,"slug":"optimal-feature-selection-in-high-dimensional","title":"Optimal Feature Selection in High-Dimensional Discriminant Analysis","date":"2013-06-27","arxiv_id":"1306.6557","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimax-theory-for-high-dimensional-gaussian","title":"Minimax Theory for High-dimensional Gaussian Mixtures with Sparse Mean Separation","date":"2013-06-09","arxiv_id":"1306.2035","repositories_listed":0,"syntology":null},{"url":null,"slug":"performance-analysis-of-unsupervised-feature","title":"Performance analysis of unsupervised feature selection methods","date":"2013-06-06","arxiv_id":"1306.1326","repositories_listed":0,"syntology":null},{"url":null,"slug":"verdict-accuracy-of-quick-reduct-algorithm","title":"Verdict Accuracy of Quick Reduct Algorithm using Clustering and Classification Techniques for Gene Expression Data","date":"2013-06-06","arxiv_id":"1306.1323","repositories_listed":0,"syntology":null},{"url":null,"slug":"guided-random-forest-in-the-rrf-package","title":"Guided Random Forest in the RRF Package","date":"2013-06-02","arxiv_id":"1306.0237","repositories_listed":0,"syntology":null},{"url":null,"slug":"enriching-texture-analysis-with-semantic-data","title":"Enriching Texture Analysis with Semantic Data","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fine-grained-crowdsourcing-for-fine-grained","title":"Fine-Grained Crowdsourcing for Fine-Grained Recognition","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"seeking-the-strongest-rigid-detector","title":"Seeking the Strongest Rigid Detector","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sentiment-classification-using-rough-set","title":"Sentiment Classification using Rough Set based Hybrid Feature Selection","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"supervised-feature-selection-for-diagnosis-of","title":"Supervised Feature Selection for Diagnosis of Coronary Artery Disease Based on Genetic Algorithm","date":"2013-05-26","arxiv_id":"1305.6046","repositories_listed":0,"syntology":null},{"url":null,"slug":"robustness-of-random-forest-based-gene","title":"Robustness of Random Forest-based gene selection methods","date":"2013-05-20","arxiv_id":"1305.4525","repositories_listed":0,"syntology":null},{"url":null,"slug":"class-imbalance-problem-in-data-mining-review","title":"Class Imbalance Problem in Data Mining Review","date":"2013-05-08","arxiv_id":"1305.1707","repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-selection-based-on-term-frequency-and","title":"Feature Selection Based on Term Frequency and T-Test for Text Categorization","date":"2013-05-03","arxiv_id":"1305.0638","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-densities-conditional-on-many","title":"Learning Densities Conditional on Many Interacting Features","date":"2013-04-26","arxiv_id":"1304.7230","repositories_listed":0,"syntology":null},{"url":null,"slug":"analytic-feature-selection-for-support-vector","title":"Analytic Feature Selection for Support Vector Machines","date":"2013-04-20","arxiv_id":"1304.5678","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-cancer-subtypes-in-glioblastoma","title":"Identifying cancer subtypes in glioblastoma by combining genomic, transcriptomic and epigenomic data","date":"2013-04-12","arxiv_id":"1304.3577","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-feature-reduction-in-intrusion-detection","title":"Fast Feature Reduction in intrusion detection datasets","date":"2013-04-01","arxiv_id":"1305.2388","repositories_listed":0,"syntology":null},{"url":null,"slug":"greedy-feature-selection-for-subspace","title":"Greedy Feature Selection for Subspace Clustering","date":"2013-03-19","arxiv_id":"1303.4778","repositories_listed":0,"syntology":null},{"url":null,"slug":"cost-sensitive-feature-selection-of-data-with","title":"Cost-Sensitive Feature Selection of Data with Errors","date":"2012-12-13","arxiv_id":"1212.3185","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-systematic-approach-to-extracting-semantic","title":"A systematic approach to extracting semantic information from functional MRI data","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"categorical-probability-proportion-difference","title":"Categorical Probability Proportion Difference (CPPD): A Feature Selection Method for Sentiment Classification","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cuni-feature-selection-and-error-analysis-of","title":"CUNI: Feature Selection and Error Analysis of a Transition-Based Parser","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-representations-and-codes-for-image-auto","title":"Deep Representations and Codes for Image Auto-Annotation","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"differential-evolution-based-feature","title":"Differential Evolution Based Feature Selection and Classifier Ensemble for Named Entity Recognition","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"expected-divergence-based-feature-selection","title":"Expected Divergence Based Feature Selection for Learning to Rank","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"imitation-learning-by-coaching","title":"Imitation Learning by Coaching","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-as-map-inference-in-discrete","title":"Learning as MAP Inference in Discrete Graphical Models","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"selecting-diverse-features-via-spectral","title":"Selecting Diverse Features via Spectral Regularization","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"visual-recognition-using-embedded-feature","title":"Visual Recognition using Embedded Feature Selection for Curvature Self-Similarity","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"minimal-cost-feature-selection-of-data-with","title":"Minimal cost feature selection of data with normal distribution measurement errors","date":"2012-11-12","arxiv_id":"1211.2512","repositories_listed":0,"syntology":null},{"url":null,"slug":"application-of-symmetric-uncertainty-and","title":"Application of Symmetric Uncertainty and Mutual Information to Dimensionality Reduction and Classification of Hyperspectral Images","date":"2012-11-03","arxiv_id":"1211.0613","repositories_listed":0,"syntology":null},{"url":null,"slug":"language-independent-sentence-level","title":"Language Independent Sentence-Level Subjectivity Analysis with Feature Selection","date":"2012-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-subset-selection-for-software-cost","title":"Feature Subset Selection for Software Cost Modelling and Estimation","date":"2012-10-03","arxiv_id":"1210.1161","repositories_listed":0,"syntology":null},{"url":null,"slug":"gene-selection-with-guided-regularized-random","title":"Gene selection with guided regularized random forest","date":"2012-09-28","arxiv_id":"1209.6425","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-ultrahigh-dimensional-feature","title":"Towards Ultrahigh Dimensional Feature Selection for Big Data","date":"2012-09-24","arxiv_id":"1209.5260","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithms-for-approximate-minimization-of","title":"Algorithms for Approximate Minimization of the Difference Between Submodular Functions, with Applications","date":"2012-07-03","arxiv_id":"1207.0560","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-feature-selection-in-distributed","title":"Joint Feature Selection in Distributed Stochastic Learning for Large-Scale Discriminative Training in SMT","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-role-of-linguistic-models-and-language","title":"The Role of Linguistic Models and Language Annotation in Feature Selection for Machine Learning","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-maximum-entropy-learning-for","title":"Generative Maximum Entropy Learning for Multiclass Classification","date":"2012-05-03","arxiv_id":"1205.0651","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hierarchical-approach-with-feature","title":"A hierarchical approach with feature selection for emotion recognition from speech","date":"2012-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"supervised-feature-selection-in-graphs-with","title":"Supervised Feature Selection in Graphs with Path Coding Penalties and Network Flows","date":"2012-04-20","arxiv_id":"1204.4539","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-dimensional-feature-selection-by-feature","title":"High-Dimensional Feature Selection by Feature-Wise Kernelized Lasso","date":"2012-02-02","arxiv_id":"1202.0515","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-methods-for-overlapping-group-lasso","title":"Efficient Methods for Overlapping Group Lasso","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-alzheimers-disease-related-brain","title":"Identifying Alzheimer's Disease-Related Brain Regions from Multi-Modality Neuroimaging Data using Sparse Composite Linear Discrimination Analysis","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"prismatic-algorithm-for-discrete-dc","title":"Prismatic Algorithm for Discrete D.C. Programming Problem","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"target-neighbor-consistent-feature-weighting","title":"Target Neighbor Consistent Feature Weighting for Nearest Neighbor Classification","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-the-intrinsic-memorability-of","title":"Understanding the Intrinsic Memorability of Images","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-domain-feature-selection-for-language","title":"Cross-domain Feature Selection for Language Identification","date":"2011-11-11","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"randomized-dimensionality-reduction-for-k","title":"Randomized Dimensionality Reduction for k-means Clustering","date":"2011-10-13","arxiv_id":"1110.2897","repositories_listed":0,"syntology":null},{"url":null,"slug":"deterministic-feature-selection-for-k-means","title":"Deterministic Feature Selection for $k$-means Clustering","date":"2011-09-26","arxiv_id":"1109.5664","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-feature-selection-method-for-multivariate","title":"A Feature Selection Method for Multivariate Performance Measures","date":"2011-03-05","arxiv_id":"1103.1013","repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-selection-via-simultaneous-sparse","title":"Feature selection via simultaneous sparse approximation for person specific face verification","date":"2011-02-14","arxiv_id":"1102.02743","repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-selection-via-sparse-approximation","title":"Feature Selection via Sparse Approximation for Face Recognition","date":"2011-02-14","arxiv_id":"1102.02748","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-and-robust-feature-selection-via","title":"Efficient and Robust Feature Selection via Joint ℓ2,1-Norms Minimization","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"linear-complementarity-for-regularized-policy","title":"Linear Complementarity for Regularized Policy Evaluation and Improvement","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-stage-dantzig-selector","title":"Multi-Stage Dantzig Selector","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-multi-task-feature-selection","title":"Probabilistic Multi-Task Feature Selection","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"reduction-of-feature-vectors-using-rough-set","title":"Reduction of Feature Vectors Using Rough Set Theory for Human Face Recognition","date":"2010-05-21","arxiv_id":"1005.04044","repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-selection-as-a-one-player-game","title":"Feature Selection as a One-Player Game","date":"2010-05-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-of-naive-bayes-machine-learning","title":"A Survey of Naïve Bayes Machine Learning approach in Text Document Classification","date":"2010-03-09","arxiv_id":"1003.1795","repositories_listed":0,"syntology":null},{"url":null,"slug":"grouped-orthogonal-matching-pursuit-for","title":"Grouped Orthogonal Matching Pursuit for Variable Selection and Prediction","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-estimation-using-general-likelihoods","title":"Sparse Estimation Using General Likelihoods and Non-Factorial Priors","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"submodularity-cuts-and-applications","title":"Submodularity Cuts and Applications","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-provably-correct-feature-selection-in","title":"Toward Provably Correct Feature Selection in Arbitrary Domains","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-feature-selection-for-the-k","title":"Unsupervised Feature Selection for the k-means Clustering Problem","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-selection-by-kdda-for-svm-based","title":"Feature Selection By KDDA For SVM-Based MultiView Face Recognition","date":"2008-12-13","arxiv_id":"0812.02574","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-interior-point-stochastic-approximation","title":"An interior-point stochastic approximation method and an L1-regularized delta rule","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-view-of-automatic-relevance","title":"A New View of Automatic Relevance Determination","date":"2007-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminative-keyword-selection-using","title":"Discriminative Keyword Selection Using Support Vector Machines","date":"2007-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-and-scalable-training-of-semi-supervised","title":"Fast and Scalable Training of Semi-Supervised CRFs with Application to Activity Recognition","date":"2007-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-selection-and-classification-of","title":"Feature Selection and Classification of Hyperspectral Images With Support Vector Machines","date":"2007-10-15","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"e7ebef10d842e6fa277a389d86463e7fce329d46a50f863151015db4857475ad","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}