陈松灿

Professor  

Alma Mater:杭州大学/上海交通大学/南京航空航天大学

Education Level:南京航空航天大学

Degree:Doctoral Degree in Engineering

School/Department:College of Computer Science and Technology

E-Mail:


Paper Publications

Ordinal factorization machine with hierarchical sparsity

Hits:

Affiliation of Author(s):计算机科学与技术学院/人工智能学院/软件学院

Journal:FRONTIERS OF COMPUTER SCIENCE

Key Words:ordinal regression factorization machine hierarchical sparsity interaction modelling

Abstract:Ordinal regression (OR) or classification is a machine learning paradigm for ordinal labels. To date, there have been a variety of methods proposed including kernel based and neural network based methods with significant performance. However, existing OR methods rarely consider latent structures of given data, particularly the interaction among covariates, thus losing interpretability to some extent. To compensate this, in this paper, we present a new OR method: ordinal factorization machine with hierarchical sparsity (OFMHS), which combines factorization machine and hierarchical sparsity together to explore the hierarchical structure behind the input variables. For the sake of optimization, we formulate OFMHS as a convex optimization problem and solve it by adopting the efficient alternating directions method of multipliers (ADMM) algorithm. Experimental results on synthetic and real datasets demonstrate the superiority of our method in both performance and significant variable selection.

ISSN No.:2095-2228

Translation or Not:no

Date of Publication:2020-02-01

Co-author:Guo, Shaocheng,Tian, Qing

Correspondence Author:csc

Pre One:Convex Clustering Combined with Weakly-Supervised Information

Next One:结合显性与隐性空间光滑的高效二维图像判别特征抽取