Effective interpretable learning for large-scale categorical data

Author:

Zhang Yishuo,Zaidi Nayyar,Zhou Jiahui,Wang Tao,Li Gang

Abstract

AbstractLarge scale categorical datasets are ubiquitous in machine learning and the success of most deployed machine learning models rely on how effectively the features are engineered. For large-scale datasets, parametric methods are generally used, among which three strategies for feature engineering are quite common. The first strategy focuses on managing the breadth (or width) of a network, e.g., generalized linear models (aka. ). The second strategy focuses on the depth of a network, e.g., Artificial Neural networks or (aka. ). The third strategy relies on factorizing the interaction terms, e.g., Factorization Machines (aka. ). Each of these strategies brings its own advantages and disadvantages. Recently, it has been shown that for categorical data, combination of various strategies leads to excellent results. For example,  -Learning, , etc., leads to state-of-the-art results. Following the trend, in this work, we have proposed another learning framework—-Learning, based on the combination of , , , and a newly introduced component named  (). is in the form of a Bayesian network classifier whose structure is learned apriori, and parameters are learned by optimizing a joint objective function along with , and  parts. We denote the learning of  parameters as . Additionally, the parameters of  are constrained to be actual probabilities—therefore, it is extremely interpretable. Furthermore, one can sample or generate data from , which can facilitate learning and provides a framework for knowledge-guided machine learning. We demonstrate that our proposed framework possesses the resilience to maintain excellent classification performance when confronted with biased datasets. We evaluate the efficacy of our framework in terms of classification performance on various benchmark large-scale categorical datasets and compare against state-of-the-art methods. It is shown that, framework (a) exhibits superior performance on classification tasks, (b) boasts outstanding interpretability and (c) demonstrates exceptional resilience and effectiveness in scenarios involving skewed distributions.

Funder

Deakin University

Publisher

Springer Science and Business Media LLC

Reference29 articles.

1. Breiman L (2001) Random forests. Mach Learn 45(1):5–32

2. Chavira M, Darwiche A (2007) Compiling Bayesian networks using variable elimination. In: IJCAI, vol 2443

3. Chen CP, Liu Z (2017) Broad learning system: an effective and efficient incremental learning system without the need for deep architecture. IEEE Trans Neural Netw Learn Syst 29:10–24

4. Cheng H-T et al (2016) Wide & deep learning for recommender systems. arXiv https://doi.org/10.48550/ARXIV.1606.07792

5. Deleu T, Góis A, Emezue C, Rankawat M, Lacoste-Julien S, Bauer S, Bengio Y (2022) Bayesian structure learning with generative flow networks

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3