One-class classifiers based on entropic spanning graphs
Politecnico di Milano(米兰理工大学);Università della Svizzera Italiana(瑞士意大利语大学)
Lorenzo Livi, Cesare Alippi
备注:
Extended and revised version of the paper "One-Class Classification Through Mutual Information Minimization" presented at the 2016 IEEE IJCNN, Vancouver, Canada
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.
Look Beyond Bias with Entropic Adversarial Data Augmentation
Univ Lyon(里昂大学);Ecole Centrale de Lyon(里昂中央理工学院);CNRS(法国国家科学研究中心);INSA Lyon(里昂国立应用科学学院);Univ Claude Bernard Lyon 1(里昂第一大学);Univ Louis Lumière Lyon 2(里昂第二大学);LIRIS(里昂信息与图像研究所);Thales LAS France(法国泰雷兹激光系统公司)
Sampling and active learning methods for network reliability estimation using K-terminal spanning tree
Institute for Risk and Reliability, Leibniz University Hannover(汉诺威莱布尼茨大学风险与可靠性研究所);School of Power and Energy, Northwestern Polytechnical University(西北工业大学动力与能源学院);Institute for Risk and Uncertainty, University of Liverpool(利物浦大学风险与不确定性研究所);International Joint Research Center for Resilient Infrastructure & International Joint Research Center for Engineering Reliability and Stochastic Mechanics, Tongji University(同济大学弹性基础设施国际联合研究中心与工程可靠性及随机力学国际联合研究中心);Tongji University(同济大学)
School of Computer Science and Engineering, Key Laboratory of Machine Intelligence and Advanced Computing, Ministry of Education, Sun Yat-sen University(计算机科学与工程学院,人工智能与先进计算重点实验室,教育部,中山大学);School of Computing, Macquarie University(计算学院,麦考瑞大学);Statistics and Data Science, Southeast University(统计与数据科学,东南大学);School of Computer Science and Engineering, Sun Yat-sen University(计算机科学与工程学院,中山大学)