【大连理工大学管理与经济学部MBA学术报告】Boolean Matrix Decompositions and Its A

更新时间：2018-10-22 09:57:38 来源：环球网校

浏览

MBA报名、考试、查分时间免费短信提醒

地区

北京
上海
天津
重庆
河北
山东
辽宁
黑龙江
吉林
甘肃
青海
河南
江苏
湖北
湖南
江西
浙江
广东
云南
福建
台湾
海南
山西
四川
陕西
贵州
安徽
广西
内蒙
西藏
新疆
宁夏
兵团

获取验证立即预约

请填写图片验证码后获取短信验证码

看不清楚，换张图片

免费获取短信验证码

摘要大连理工大学（Dalian University of Technology）简称大工，坐落于滨城大连，是中华人民共和国教育部直属的全国重点大学，国家国防科技工业局与教育部共建高校，国家首批“双一流”（世界一流大学A类）、“211工程”、“985工程”重点建设高校。

【报告题目】Boolean Matrix Decompositions and Its Applications

【报告人】陆海兵教授 (美国Santa Clara University)

【邀请人】闵庆飞教授

【时间及地点】2018年10月18日上午10：00-11：30 大连理工大学管经新大楼B312

【报告摘要】

Many real-world data sets can be represented in the form of Boolean (0/1) matrices, e.g. transactional data (purchase or not), product reviews (like or dislike), documents (containing a term or not). Boolean matrix decomposition (BMD) recently has stood out as an effective model for analyzing/mining Boolean data sets. BMD is to decompose a Boolean (0/1) matrix into the Boolean product (one plus one equals one) of two other Boolean matrices. The key advantage of BMD over other matrix decomposition methods is the direct interpretability of its decomposition solutions, e.g. one decomposed matrix can be viewed as extracted patterns and the other composes the source data with the extract patterns. This study intends to build a general framework of BMD and explores its practical applications. Many variants of BMD, such as minimal rank BMD, minimal edge BMD, rank-one BMD, extended BMD with negative ones, are proposed and investigated. Due to the discrete nature of BMD, most of the studied problems are NP-hard. So we design and implement several algorithms, including algorithms with guaranteed approximation bounds, fast and dirty heuristics. We also formulate BMD variants as standard optimization problems that allow data practitioners to directly apply existing optimization solvers. Our research results can be used in many domains, including shopping pattern discovery, product-rating analysis, text mining, and role-based access control in information security.

【报告人简历】

Dr. Haibing Lu received his Ph.D. in Management Information Systems in 2011 from Rutgers University and earned his B.S. and M.S. degrees both in mathematics from Xi’an Jiaotong University, China, in 1998 and 2002 respectively. Dr. Lu joined the Department of Information Systems and Analytics (formerly Operations Management and Information Systems) in the Leavey School of Business at Santa Clara University in fall 2011. He was promoted to tenured associate professor in 2017, and department chair at the same time. He is a frequent recipient of the school’s Extraordinary Research Award and Extraordinary Teaching Award.

Dr. Lu’s research is at the confluence of data analytics, information privacy, and optimization. He has published over 40 well-cited research articles at leading journals, such as INFORMS Journal on Computing (JOC), IEEE Transaction on Dependable and Security Computing (TDSC), Journal of Computer Security (JCS), OMEGA and Expert Systems with Applications, and premier computer science conference proceedings, including IEEE Symposium on Security and Privacy (S&P), ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), SIAM International Conference on Data Mining (SDM), IEEE International Conference on Data Mining (ICDM), and IEEE International Conference on Data Engineering (ICDE).

编辑推荐

分享到：编辑：环球网校

上一篇：MBA校园：华中科技大学举办研究生“公管之声”演讲比赛通知

下一篇：MBA~新晋诺奖得主诺德豪斯和罗默：他们找到了解决这个时代最基本、最紧迫问题的方法

资料下载精选课程老师直播真题练习