{"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/classification/papers/146","list_of":"/task/classification","task":"General Classification","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":146,"pages_in_order":146,"rows_per_page":100,"rows":[14501,14581],"of":14581,"counts":{"archive_papers_tagged":14581,"with_a_code_link":3945,"where_syntology_ran_a_sample":713,"not_listed_spam_title":0,"listed":14581,"listed_where_code_ran":713,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":560,"every_run_a_failure_of_syntologys_instrument":153,"listed_with_a_run_with_no_instrument_failure":560,"listed_every_run_a_failure_of_syntologys_instrument":153,"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/classification","prev":"/task/classification/papers/145","next":null,"papers":[{"url":null,"slug":"predictive-subspace-learning-for-multi-view","title":"Predictive Subspace Learning for Multi-view Data: a Large Margin Approach","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"relaxed-clipping-a-global-training-method-for","title":"Relaxed Clipping: A Global Training Method for Robust Regression and Classification","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"reverse-multi-label-learning","title":"Reverse Multi-Label Learning","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"tight-sample-complexity-of-large-margin","title":"Tight Sample Complexity of Large-Margin Learning","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-holistic-scene-understanding-feedback","title":"Towards Holistic Scene Understanding: Feedback Enabled Cascaded Classification Models","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-property-based-classification-of","title":"Towards Property-Based Classification of Clustering Paradigms","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"transduction-with-matrix-completion-three","title":"Transduction with Matrix Completion: Three Birds with One Stone","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-consistency-of-multi-class-support","title":"Universal Consistency of Multi-Class Support Vector Classification","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-kernel-dimension-reduction","title":"Unsupervised Kernel Dimension Reduction","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"variable-margin-losses-for-classifier-design","title":"Variable margin losses for classifier design","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"an-introduction-to-conditional-random-fields","title":"An Introduction to Conditional Random Fields","date":"2010-11-17","arxiv_id":"1011.4088","repositories_listed":0,"syntology":null},{"url":null,"slug":"classification-with-scattering-operators","title":"Classification with Scattering Operators","date":"2010-11-12","arxiv_id":"1011.3023","repositories_listed":0,"syntology":null},{"url":null,"slug":"task-driven-dictionary-learning","title":"Task-Driven Dictionary Learning","date":"2010-09-27","arxiv_id":"1009.5358","repositories_listed":0,"syntology":null},{"url":null,"slug":"classification-of-fused-images-using-radial","title":"Classification of Fused Images using Radial Basis Function Neural Network for Human Face Recognition","date":"2010-07-05","arxiv_id":"1007.00631","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-recursive-edit-distance-kernels-with","title":"On Recursive Edit Distance Kernels with Application to Time Series Classification","date":"2010-05-27","arxiv_id":"1005.5141","repositories_listed":0,"syntology":null},{"url":null,"slug":"classification-of-polar-thermal-eigenfaces","title":"Classification of Polar-Thermal Eigenfaces using Multilayer Perceptron for Human Face Recognition","date":"2010-05-21","arxiv_id":"1005.04035","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":"how-to-explain-individual-classification","title":"How to Explain Individual Classification Decisions","date":"2009-12-06","arxiv_id":"0912.1128","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-rate-distortion-approach-for-semi","title":"A Rate Distortion Approach for Semi-Supervised Conditional Random Fields","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"bilinear-classifiers-for-visual-recognition","title":"Bilinear classifiers for visual recognition","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"breaking-boundaries-between-induction-time","title":"Breaking Boundaries Between Induction Time and Diagnosis Time Active Information Acquisition","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dirichlet-bernoulli-alignment-a-generative","title":"Dirichlet-Bernoulli Alignment: A Generative Model for Multi-Class Multi-Label Multi-Instance Corpora","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"distribution-calibrated-hierarchical","title":"Distribution-Calibrated Hierarchical Classification","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"distribution-matching-for-transduction","title":"Distribution Matching for Transduction","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"entropic-graph-regularization-in-non","title":"Entropic Graph Regularization in Non-Parametric Semi-Supervised Classification","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"free-energy-score-space","title":"Free energy score space","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-consensus-maximization-among","title":"Graph-based Consensus Maximization among Multiple Supervised and Unsupervised Models","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"group-sparse-coding","title":"Group Sparse Coding","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-mixture-of-classification","title":"Hierarchical Mixture of Classification Experts Uncovers Interactions between Brain Regions","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-label-embeddings-for-nearest","title":"Learning Label Embeddings for Nearest-Neighbor Multi-class Classification with an Application to Speech Recognition","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-social-annotation-data-with-content","title":"Modeling Social Annotation Data with Content Relevance using a Topic Model","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-scoring-for-unsupervised-learning","title":"Optimal Scoring for Unsupervised Learning","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-multi-class-spatio-spectral","title":"Optimizing Multi-Class Spatio-Spectral Filters via Bayes Error Estimation for EEG Classification","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"positive-semidefinite-metric-learning-with","title":"Positive Semidefinite Metric Learning with Boosting","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"ranking-measures-and-loss-functions-in","title":"Ranking Measures and Loss Functions in Learning to Rank","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"region-based-segmentation-and-object","title":"Region-based Segmentation and Object Detection","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"regularized-distance-metric-learningtheory","title":"Regularized Distance Metric Learning:Theory and Algorithm","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"replacing-supervised-classification-learning","title":"Replacing supervised classification learning by Slow Feature Analysis in spiking neural networks","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-nonparametric-regression-with-metric","title":"Robust Nonparametric Regression with Metric-Space Valued Output","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":"sufficient-conditions-for-agnostic-active","title":"Sufficient Conditions for Agnostic Active Learnable","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-feature-learning-for-audio","title":"Unsupervised feature learning for audio classification using convolutional deep belief networks","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/a-novel-discourse-parser-based-on-support","slug":"a-novel-discourse-parser-based-on-support","title":"A Novel Discourse Parser Based on Support Vector Machine Classification","date":"2009-08-02","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"parallel-adaboost-algorithm-for-gabor-wavelet","title":"Parallel AdaBoost Algorithm for Gabor Wavelet Selection in Face Recognition","date":"2009-07-18","arxiv_id":"0907.03218","repositories_listed":0,"syntology":null},{"url":null,"slug":"search-based-structured-prediction","title":"Search-based Structured Prediction","date":"2009-07-04","arxiv_id":"0907.0786","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-offset-tree-for-learning-with-partial","title":"The Offset Tree for Learning with Partial Labels","date":"2008-12-21","arxiv_id":"0812.4044","repositories_listed":0,"syntology":null},{"url":null,"slug":"face-detection-using-adaboosted-svm-based","title":"Face Detection Using Adaboosted SVM-Based Component Classifier","date":"2008-12-13","arxiv_id":"0812.02575","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":"elementary-epistemological-features-of","title":"Elementary epistemological features of machine intelligence","date":"2008-12-04","arxiv_id":"0812.0885","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-martingale-boosting","title":"Adaptive Martingale Boosting","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"an-empirical-analysis-of-domain-adaptation","title":"An Empirical Analysis of Domain Adaptation Algorithms for Genomic Sequence Analysis","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/automated-flower-classification-over-a-large","slug":"automated-flower-classification-over-a-large","title":"Automated Flower Classification over a Large Number of Classes","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cascaded-classification-models-combining","title":"Cascaded Classification Models: Combining Models for Holistic Scene Understanding","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"disclda-discriminative-learning-for","title":"DiscLDA: Discriminative Learning for Dimensionality Reduction and Classification","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-sampling-for-gaussian-process","title":"Efficient Sampling for Gaussian Process Inference using Control Variables","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"extended-grassmann-kernels-for-subspace-based","title":"Extended Grassmann Kernels for Subspace-Based Learning","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-fisher-kernels-for-longitudinal","title":"Hierarchical Fisher Kernels for Longitudinal Data","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"large-margin-taxonomy-embedding-for-document","title":"Large Margin Taxonomy Embedding for Document Categorization","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-the-semantic-correlation-an","title":"Learning the Semantic Correlation: An Alternative Way to Gain from Unlabeled Text","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"linear-classification-and-selective-sampling","title":"Linear Classification and Selective Sampling Under Low Noise Conditions","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"localized-sliced-inverse-regression","title":"Localized Sliced Inverse Regression","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-regression-and-classification","title":"Nonparametric regression and classification with joint sparsity constraints","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-design-of-loss-functions-for","title":"On the Design of Loss Functions for Classification: theory, robustness to outliers, and SavageBoost","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-efficient-minimization-of","title":"On the Efficient Minimization of Classification Calibrated Surrogates","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"overlaying-classifiers-a-practical-approach","title":"Overlaying classifiers: a practical approach for optimal ranking","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"performance-analysis-for-l_2-kernel","title":"Performance analysis for L\\_2 kernel classification","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"relative-margin-machines","title":"Relative Margin Machines","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-algorithms-for-string-kernels-with","title":"Scalable Algorithms for String Kernels with Inexact Matching","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-learning-with-weakly-related","title":"Semi-supervised Learning with Weakly-Related Unlabeled Data : Towards Better Text Categorization","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"supervised-dictionary-learning","title":"Supervised Dictionary Learning","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"support-vector-machines-with-a-reject-option","title":"Support Vector Machines with a Reject Option","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"tighter-bounds-for-structured-estimation","title":"Tighter Bounds for Structured Estimation","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-randomized-algorithm-for-large-scale","title":"A Randomized Algorithm for Large Scale Support Vector Learning","date":"2007-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"diffrac-a-discriminative-and-flexible","title":"DIFFRAC: a discriminative and flexible framework for clustering","date":"2007-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"grift-a-graphical-model-for-inferring-visual","title":"GRIFT: A graphical model for inferring visual classification features from human data","date":"2007-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"second-order-bilinear-discriminant-analysis","title":"Second Order Bilinear Discriminant Analysis for single trial EEG analysis","date":"2007-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"support-vector-machine-classification-with","title":"Support Vector Machine Classification with Indefinite Kernels","date":"2007-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"using-deep-belief-nets-to-learn-covariance","title":"Using Deep Belief Nets to Learn Covariance Kernels for Gaussian Processes","date":"2007-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/biographies-bollywood-boom-boxes-and-blenders","slug":"biographies-bollywood-boom-boxes-and-blenders","title":"Biographies, Bollywood, Boom-boxes and Blenders: Domain Adaptation for Sentiment Classification","date":"2007-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/support-vector-machine-based-arrhythmia","slug":"support-vector-machine-based-arrhythmia","title":"Support vector machine based arrhythmia classification using reduced features","date":"2005-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"thumbs-up-sentiment-classification-using","title":"Thumbs up? Sentiment Classification using Machine Learning Techniques","date":"2002-05-28","arxiv_id":"cs/0205070","repositories_listed":0,"syntology":null}],"record_sha256":"27a277c8e62a947dd119f7f668f5bce17fcc8cb05fb14733a198c3fc957742cd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}