arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1604.02477cs.LGcs.CVcs.ITmath.IT
收藏

基于熵生成图的一类分类器

One-class classifiers based on entropic spanning graphs

Politecnico di Milano(米兰理工大学);Università della Svizzera Italiana(瑞士意大利语大学)

Lorenzo Livi, Cesare Alippi

摘要:

单类分类器为评估数据中离群值的存在提供了有价值的工具。本文提出了一种基于熵生成图的单类分类器的设计方法。我们的方法考虑到处理非数值数据的嵌入过程的方式的可能性。生成图在嵌入的输入数据上学习,并且顶点的输出分区定义分类器。最后的分区是通过利用基于互信息最小化的标准。在这里,我们通过使用一个方便的配方提供的$α$ -詹森差异计算的互信息。一旦训练完成,为了将置信水平与分类器决策相关联,构建基于图的模糊模型。模糊化过程仅基于熵生成图的顶点的拓扑信息。因此,所提出的一类分类器也适用于具有复杂几何结构的数据。我们提供的实验,著名的基准包含特征向量和标记图。此外,我们将该方法应用于蛋白质溶解度识别问题,通过考虑几种表示的输入样本。实验结果表明,相对于其他国家的最先进的方法所提出的方法的有效性和通用性。

英文摘要:

One-class classifiers offer valuable tools to assess the presence of outliers in data. In this paper, we propose a design methodology for one-class classifiers based on entropic spanning graphs. Our approach takes into account the possibility to process also non-numeric data by means of an embedding procedure. The spanning graph is learned on the embedded input data and the outcoming partition of vertices defines the classifier. The final partition is derived by exploiting a criterion based on mutual information minimization. Here, we compute the mutual information by using a convenient formulation provided in terms of the $α$-Jensen difference. Once training is completed, in order to associate a confidence level with the classifier decision, a graph-based fuzzy model is constructed. The fuzzification process is based only on topological information of the vertices of the entropic spanning graph. As such, the proposed one-class classifier is suitable also for data characterized by complex geometric structures. We provide experiments on well-known benchmarks containing both feature vectors and labeled graphs. In addition, we apply the method to the protein solubility recognition problem by considering several representations for the input samples. Experimental results demonstrate the effectiveness and versatility of the proposed method with respect to other state-of-the-art approaches.

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

↑