{"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/binary-classification/papers/26","list_of":"/task/binary-classification","task":"Binary 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":26,"pages_in_order":26,"rows_per_page":100,"rows":[2501,2574],"of":2574,"counts":{"archive_papers_tagged":2574,"with_a_code_link":710,"where_syntology_ran_a_sample":115,"not_listed_spam_title":0,"listed":2574,"listed_where_code_ran":115,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":100,"every_run_a_failure_of_syntologys_instrument":15,"listed_with_a_run_with_no_instrument_failure":100,"listed_every_run_a_failure_of_syntologys_instrument":15,"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/binary-classification","prev":"/task/binary-classification/papers/25","next":null,"papers":[{"url":null,"slug":"consistent-binary-classification-with","title":"Consistent Binary Classification with Generalized Performance Metrics","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"extended-and-unscented-gaussian-processes","title":"Extended and Unscented Gaussian Processes","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"large-margin-convex-polytope-machine","title":"Large-Margin Convex Polytope Machine","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-multiple-tasks-in-parallel-with-a","title":"Learning Multiple Tasks in Parallel with a Shared Annotator","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"ranking-via-robust-binary-classification","title":"Ranking via Robust Binary Classification","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-classification-under-sample-selection","title":"Robust Classification Under Sample Selection Bias","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-logistic-regression-and-classification","title":"Robust Logistic Regression and Classification","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"non-verbal-communication-analysis-in-victim","title":"Non-Verbal Communication Analysis in Victim-Offender Mediations","date":"2014-11-25","arxiv_id":"1412.2122","repositories_listed":0,"syntology":null},{"url":null,"slug":"pu-learning-for-matrix-completion","title":"PU Learning for Matrix Completion","date":"2014-11-22","arxiv_id":"1411.6081","repositories_listed":0,"syntology":null},{"url":null,"slug":"hardware-amenable-structural-learning-for","title":"Hardware-Amenable Structural Learning for Spike-based Pattern Classification using a Simple Model of Active Dendrites","date":"2014-11-20","arxiv_id":"1411.5881","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-margin-classification-with-multiple","title":"Large-Margin Classification with Multiple Decision Rules","date":"2014-11-19","arxiv_id":"1411.5260","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-overview-of-general-performance-metrics-of","title":"An Overview of General Performance Metrics of Binary Classifier Systems","date":"2014-10-17","arxiv_id":"1410.5330","repositories_listed":0,"syntology":null},{"url":null,"slug":"scene-image-is-non-mutually-exclusive-a-fuzzy","title":"Scene Image is Non-Mutually Exclusive - A Fuzzy Qualitative Scene Understanding","date":"2014-10-14","arxiv_id":"1410.3726","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-approach-to-reducing-annotation-costs-for","title":"An Approach to Reducing Annotation Costs for BioNLP","date":"2014-09-12","arxiv_id":"1409.3881","repositories_listed":0,"syntology":null},{"url":null,"slug":"enforcing-label-and-intensity-consistency-for","title":"Enforcing Label and Intensity Consistency for IR Target Detection","date":"2014-09-09","arxiv_id":"1409.2800","repositories_listed":0,"syntology":null},{"url":null,"slug":"weighted-classification-cascades-for","title":"Weighted Classification Cascades for Optimizing Discovery Significance in the HiggsML Challenge","date":"2014-09-09","arxiv_id":"1409.2655","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-consistency-of-ordinal-regression","title":"On the Consistency of Ordinal Regression Methods","date":"2014-08-11","arxiv_id":"1408.2327","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-generalization-of-the-c-bound-to","title":"On the Generalization of the C-Bound to Structured Output Ensemble Methods","date":"2014-08-06","arxiv_id":"1408.1336","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-feature-scaling-for-online-learning","title":"Dynamic Feature Scaling for Online Learning of Binary Classifiers","date":"2014-07-28","arxiv_id":"1407.7584","repositories_listed":0,"syntology":null},{"url":null,"slug":"quadratically-constrained-quadratic","title":"Quadratically constrained quadratic programming for classification using particle swarms and applications","date":"2014-07-23","arxiv_id":"1407.6315","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-average-precision-using-weakly","title":"Optimizing Average Precision using Weakly Supervised Data","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-learners-for-multiclass-problems","title":"Optimal Learners for Multiclass Problems","date":"2014-05-10","arxiv_id":"1405.2420","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-lipschitz-continuity-and-smoothness-of","title":"On Lipschitz Continuity and Smoothness of Loss Functions in Learning to Rank","date":"2014-05-03","arxiv_id":"1405.0586","repositories_listed":0,"syntology":null},{"url":null,"slug":"adapting-freely-available-resources-to-build","title":"Adapting Freely Available Resources to Build an Opinion Mining Pipeline in Portuguese","date":"2014-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"constructing-a-corpus-of-japanese-predicate","title":"Constructing a Corpus of Japanese Predicate Phrases for Synonym/Antonym Relations","date":"2014-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-munich-biovoice-corpus-effects-of","title":"The Munich Biovoice Corpus: Effects of Physical Exercising, Heart Rate, and Skin Conductance on Human Speech Production","date":"2014-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-borders-classification","title":"Multi-borders classification","date":"2014-04-15","arxiv_id":"1404.4095","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-version-of-the-support-vector","title":"Generalized version of the support vector machine for binary classification problems: supporting hyperplane machine","date":"2014-04-13","arxiv_id":"1404.3415","repositories_listed":0,"syntology":null},{"url":null,"slug":"ensemble-committees-for-stock-return","title":"Ensemble Committees for Stock Return Classification and Prediction","date":"2014-04-05","arxiv_id":"1404.1492","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-study-on-cost-behaviors-of-binary","title":"A study on cost behaviors of binary classification measures in class-imbalanced problems","date":"2014-03-26","arxiv_id":"1403.7100","repositories_listed":0,"syntology":null},{"url":null,"slug":"ranking-via-robust-binary-classification-and","title":"Ranking via Robust Binary Classification and Parallel Parameter Estimation in Large-Scale Data","date":"2014-02-11","arxiv_id":"1402.2676","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-sampling-and-learning-framework-a","title":"The Sampling-and-Learning Framework: A Statistical View of Evolutionary Algorithms","date":"2014-01-24","arxiv_id":"1401.6333","repositories_listed":0,"syntology":null},{"url":null,"slug":"binary-classifier-calibration-bayesian-non","title":"Binary Classifier Calibration: Bayesian Non-Parametric Approach","date":"2014-01-13","arxiv_id":"1401.2955","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-fused-elastic-net-logistic-regression-model","title":"A Fused Elastic Net Logistic Regression Model for Multi-Task Binary Classification","date":"2013-12-30","arxiv_id":"1312.7750","repositories_listed":0,"syntology":null},{"url":null,"slug":"3d-interest-point-detection-via","title":"3D Interest Point Detection via Discriminative Learning","date":"2013-12-24","arxiv_id":"1312.6826","repositories_listed":0,"syntology":null},{"url":null,"slug":"manifold-regularized-kernel-logistic","title":"Manifold regularized kernel logistic regression for web image annotation","date":"2013-12-21","arxiv_id":"1312.6180","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-mapreduce-based-distributed-svm-algorithm","title":"A MapReduce based distributed SVM algorithm for binary classification","date":"2013-12-15","arxiv_id":"1312.4108","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-methodology-for-player-modeling-based-on","title":"A Methodology for Player Modeling based on Machine Learning","date":"2013-12-13","arxiv_id":"1312.3903","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-law-of-total-odds","title":"The Law of Total Odds","date":"2013-12-02","arxiv_id":"1312.0365","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-lower-bounds-for-1","title":"Information-theoretic lower bounds for distributed statistical estimation with communication constraints","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-with-noisy-labels","title":"Learning with Noisy Labels","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-relationship-between-binary","title":"On the Relationship Between Binary Classification, Bipartite Ranking, and Binary Class Probability Estimation","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-bloom-filters-for-large-multilabel","title":"Robust Bloom Filters for Large MultiLabel Classification Tasks","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-u-statistic-estimator-for-the-variance-of","title":"A U-statistic estimator for the variance of resampling-based error estimators","date":"2013-10-30","arxiv_id":"1310.8203","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-bayes-optimality-of-f-measure","title":"On the Bayes-optimality of F-measure maximizers","date":"2013-10-17","arxiv_id":"1310.4849","repositories_listed":0,"syntology":null},{"url":null,"slug":"building-bridges-viewing-active-learning-from","title":"Building Bridges: Viewing Active Learning from the Multi-Armed Bandit Lens","date":"2013-09-26","arxiv_id":"1309.6830","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-optimization-for-machine-learning","title":"Stochastic Optimization for Machine Learning","date":"2013-08-15","arxiv_id":"1308.3509","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiclass-learnability-and-the-erm-principle","title":"Multiclass learnability and the ERM principle","date":"2013-08-13","arxiv_id":"1308.2893","repositories_listed":0,"syntology":null},{"url":null,"slug":"when-is-the-majority-vote-classifier","title":"When is the majority-vote classifier beneficial?","date":"2013-07-24","arxiv_id":"1307.6522","repositories_listed":0,"syntology":null},{"url":null,"slug":"dimensionality-detection-and-integration-of","title":"Dimensionality Detection and Integration of Multiple Data Sources via the GP-LVM","date":"2013-07-01","arxiv_id":"1307.0323","repositories_listed":0,"syntology":null},{"url":null,"slug":"supersparse-linear-integer-models-for","title":"Supersparse Linear Integer Models for Predictive Scoring Systems","date":"2013-06-25","arxiv_id":"1306.5860","repositories_listed":0,"syntology":null},{"url":null,"slug":"auditing-active-learning-with-outcome","title":"Auditing: Active Learning with Outcome-Dependent Query Costs","date":"2013-06-10","arxiv_id":"1306.2347","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-large-scale-structured-learning","title":"Efficient Large-Scale Structured Learning","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"rolling-riemannian-manifolds-to-solve-the","title":"Rolling Riemannian Manifolds to Solve the Multi-class Classification Problem","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-from-imprecise-and-fuzzy","title":"Learning from Imprecise and Fuzzy Observations: Data Disambiguation through Generalized Loss Minimization","date":"2013-05-03","arxiv_id":"1305.0698","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-sharp-bound-on-the-computation-accuracy","title":"Estimating a sharp convergence bound for randomized ensembles","date":"2013-03-04","arxiv_id":"1303.0727","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-scale-discriminant-saliency-with","title":"Multi-scale Discriminant Saliency with Wavelet-based Hidden Markov Tree Modelling","date":"2013-01-31","arxiv_id":"1301.7641","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":"multiclass-learning-approaches-a-theoretical","title":"Multiclass Learning Approaches: A Theoretical Comparison with Implications","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multiclass-learning-with-simplex-coding","title":"Multiclass Learning with Simplex Coding","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"volume-regularization-for-binary","title":"Volume Regularization for Binary Classification","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"reducing-statistical-time-series-problems-to","title":"Reducing statistical time-series problems to binary classification","date":"2012-10-22","arxiv_id":"1210.6001","repositories_listed":0,"syntology":null},{"url":null,"slug":"asymptotic-generalization-bound-of-fishers","title":"Asymptotic Generalization Bound of Fisher's Linear Discriminant Analysis","date":"2012-08-15","arxiv_id":"1208.3030","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-optimal-active-search-and-surveying","title":"Bayesian Optimal Active Search and Surveying","date":"2012-06-27","arxiv_id":"1206.6406","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":"classification-approach-based-on-association","title":"Classification approach based on association rules mining for unbalanced data","date":"2012-02-24","arxiv_id":"1202.5514","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-exact-algorithm-for-f-measure-maximization","title":"An Exact Algorithm for F-Measure Maximization","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"collective-classification-of-textual","title":"Collective Classification of Textual Documents by Guided Self-Organization in T-Cell Cross-Regulation Dynamics","date":"2011-02-04","arxiv_id":"1102.1027","repositories_listed":0,"syntology":null},{"url":null,"slug":"survey-experiment-towards-the-learning","title":"Survey & Experiment: Towards the Learning Accuracy","date":"2010-12-18","arxiv_id":"1012.4051","repositories_listed":0,"syntology":null},{"url":null,"slug":"direct-loss-minimization-for-structured","title":"Direct Loss Minimization for Structured Prediction","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"online-classification-with-specificity","title":"Online Classification with Specificity Constraints","date":"2010-12-01","arxiv_id":null,"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":"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}],"record_sha256":"ee3c6ac72b05be97a6db8a6794b1cc4f1cfd0f65848de19755ba33f0fc5a5a12","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}