首页/论文/0812.3147

arXiv 0812.31472008-12-16cs.LGcs.CG

Comparison of Binary Classification Based on Signed Distance Functions with Support Vector Machines

Vanderbilt University Medical Center（范德比尔特大学医学中心）；Vanderbilt University（范德比尔特大学）

Erik M. Boczko, Todd Young, Minhui Zie, Di Wu

备注：: 5 pages, 4 figures. Presented at the Ohio Collaborative Conference on Bioinformatics (OCCBIO), June 2006

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

英文摘要相关论文

英文摘要：

We investigate the performance of a simple signed distance function (SDF) based method by direct comparison with standard SVM packages, as well as K-nearest neighbor and RBFN methods. We present experimental results comparing the SDF approach with other classifiers on both synthetic geometric problems and five benchmark clinical microarray data sets. On both geometric problems and microarray data sets, the non-optimized SDF based classifiers perform just as well or slightly better than well-developed, standard SVM methods. These results demonstrate the potential accuracy of SDF-based methods on some types of problems.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

The Signed Distance Function: A New Tool for Binary Classification

From a geometric perspective most nonlinear binary classification algorithms, including state of the art versions of Support Vector Machine (SVM) and Radial Basis Function Network (RBFN) classifiers, and are based on the idea of reconstructing indicator functions. We propose instead to use reconstruction of the signed distance function (SDF) as a basis for binary classification. We discuss properties of the signed distance function that can be exploited in classification algorithms. We develop simple versions of such classifiers and test them on several linear and nonlinear problems. On linear…

2005-11-30cs.CGcs.LG

Proximity Preserving Binary Code using Signed Graph-Cut

Tel-Aviv University（特拉维夫大学）；Princeton University（普林斯顿大学）；The Interdisciplinary Center（跨学科中心）

We introduce a binary embedding framework, called Proximity Preserving Code (PPC), which learns similarity and dissimilarity between data points to create a compact and affinity-preserving binary code. This code can be used to apply fast and memory-efficient approximation to nearest-neighbor searches. Our framework is flexible, enabling different proximity definitions between data points. In contrast to previous methods that extract binary codes based on unsigned graph partitioning, our system models the attractive and repulsive forces in the data by incorporating positive and negative graph w…

2020-02-05cs.CVcs.IRcs.LG

方向核均值差异：用于单变量分布比较的快速有符号统计量

Directional Kernel Mean Difference: A Fast Signed Statistic for Univariate Distribution Comparison

Northwestern Polytechnical University（西北工业大学）

研究提出方向核均值差异（DKMD）用于单变量分布比较，通过积分核均值嵌入差异与奇权重函数保留分布变化方向，推导数据驱动估计器，开发高效算法，实验证明其能准确分离方向变化、抗重尾异常值且计算高效。

2026-07-23cs.LGstat.ML

Even Trolls Are Useful: Efficient Link Classification in Signed Networks

Inria（法国国家信息与自动化研究所）；Univ. Lille（里尔大学）；CNRS（法国国家科学研究中心）；CRIStAL（里尔计算机、信号与自动控制实验室）

We address the problem of classifying the links of signed social networks given their full structural topology. Motivated by a binary user behaviour assumption, which is supported by decades of research in psychology, we develop an efficient and surprisingly simple approach to solve this classification problem. Our methods operate both within the active and batch settings. We demonstrate that the algorithms we developed are extremely fast in both theoretical and practical terms. Within the active setting, we provide a new complexity measure and a rigorous analysis of our methods that hold for …

2016-02-29cs.LGcs.SIphysics.soc-ph

基于平衡符号图展开的轻量级变换器用于EEG分类

Lightweight Transformer for EEG Classification via Balanced Signed Graph Algorithm Unrolling

Peking University（北京大学）；York University（约克大学）；New York University（纽约大学）

本文提出基于平衡符号图展开的轻量级变换器，用于高效分类EEG信号，通过频谱去噪算法实现低通滤波，减少参数量同时保持分类性能。

2026-03-03cs.LG

Radon符号累积分布变换及其在符号图像分类中的应用

The Radon Signed Cumulative Distribution Transform and its applications in classification of Signed Images

Vanderbilt University（范德堡大学）；University of North Carolina at Chapel Hill（北卡罗来纳大学教堂山分校）；University of Virginia（弗吉尼亚大学）；North South University（北南大学）

本文提出Radon符号累积分布变换，通过结合Radon变换与Signed Cumulative Distribution Transform推广了传输图像表示方法，能更准确表示符号图像信息内容，在真实和模拟数据上实现了比现有传输变换和深度学习方法更高的分类准确率。

2023-07-28cs.CVcs.ITcs.LG

更多相关论文收起更多论文

面向中轴线的符号距离函数学习

Medial Axis Aware Learning of Signed Distance Functions

Institute for Numerical Simulation, University of Bonn（数值模拟研究所，波恩大学）

本文提出一种新的变分方法，用于计算高精度的全局符号距离函数，通过高阶变分公式考虑梯度的跳跃集，以提高计算精度。

2026-06-08cs.CGcs.CVcs.GR

输出扰动对二值线性分类公平性的影响

On the Impact of Output Perturbation on Fairness in Binary Linear Classification

Univ. Lille（里尔大学）；Inria（法国国家信息与自动化研究所）；CNRS（法国国家科学研究中心）；Centrale Lille（里尔中央理工学院）；UMR 9189 - CRIStAL（UMR 9189 - CRIStAL研究中心）

本研究理论分析输出扰动机制对二值线性分类中个体与群体公平性的影响，证明个体公平性影响有界但随维度增长，群体公平性影响由角余量分布决定。

2024-02-05cs.CYcs.LG

少即是多：二元反馈可以在排名恢复中超越序数比较

When Less Is More: Binary Feedback Can Outperform Ordinal Comparisons in Ranking Recovery

Xiamen University（厦门大学）；University of Science and Technology of China（中国科学技术大学）；The Chinese University of Hong Kong（香港中文大学）

本文提出了一种通用框架，证明在特定算法下，二元反馈在排名恢复中优于序数比较，通过分析信噪比和收敛率展示了二元化的优势。

2026-01-11cs.LGstat.ML

Comparison of 14 different families of classification algorithms on 115 binary datasets

Computing Institute（计算研究所）；University of Campinas（坎皮纳斯大学）

We tested 14 very different classification algorithms (random forest, gradient boosting machines, SVM - linear, polynomial, and RBF - 1-hidden-layer neural nets, extreme learning machines, k-nearest neighbors and a bagging of knn, naive Bayes, learning vector quantization, elastic net logistic regression, sparse linear discriminant analysis, and a boosting of linear classifiers) on 115 real life binary datasets. We followed the Demsar analysis and found that the three best classifiers (random forest, gbm and RBF SVM) are not significantly different from each other. We also discuss that a chang…

2016-06-02cs.CVcs.LG

Pointwise Binary Classification with Pairwise Confidence Comparisons

College of Computer Science, Chongqing University（重庆大学计算机学院）；College of Computer and Information Science, Southwest University（西南大学计算机与信息科学学院）；The University of Tokyo（东京大学）；RIKEN Center for Advanced Intelligence Project（理化学研究所革新智能综合研究中心）；Department of Computer Science, Hong Kong Baptist University（香港浸会大学计算机科学系）；School of Information Technology and Electrical Engineering, The University of Queensland（昆士兰大学信息技术与电气工程学院）；School of Computer Science and Engineering, Nanyang Technological University（南洋理工大学计算机科学与工程学院）

To alleviate the data requirement for training effective binary classifiers in binary classification, many weakly supervised learning settings have been proposed. Among them, some consider using pairwise but not pointwise labels, when pointwise labels are not accessible due to privacy, confidentiality, or security reasons. However, as a pairwise label denotes whether or not two data points share a pointwise label, it cannot be easily collected if either point is equally likely to be positive or negative. Thus, in this paper, we propose a novel setting called pairwise comparison (Pcomp) classif…

2022-01-13cs.LGstat.ML

On the relation between accuracy and fairness in binary classification

Aalto University（阿尔托大学）；Helsinki Institute for Information Technology HIIT（赫尔辛基信息技术研究所HIIT）

Our study revisits the problem of accuracy-fairness tradeoff in binary classification. We argue that comparison of non-discriminatory classifiers needs to account for different rates of positive predictions, otherwise conclusions about performance may be misleading, because accuracy and discrimination of naive baselines on the same dataset vary with different rates of positive predictions. We provide methodological recommendations for sound comparison of non-discriminatory classifiers, and present a brief theoretical and empirical analysis of tradeoffs between accuracy and non-discrimination.

2015-05-21cs.AIcs.LG