arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2012.10853cs.LGcs.AI
收藏

eTREE:学习树结构嵌入

eTREE: Learning Tree-structured Embeddings

University of Minnesota(明尼苏达大学);IQVIA Inc.(艾昆纬公司);University of Virginia(弗吉尼亚大学)

Faisal M. Almutairi, Yunlong Wang, Dong Wang, Emily Zhao, Nicholas D. Sidiropoulos

摘要:

矩阵分解(MF)在广泛的机器学习和数据采掘模型中起着重要的作用。MF通常用于获取项目嵌入和特征表示,因为它能够捕获维度之间的相关性和高阶统计依赖性。在许多应用中,项目的类别呈现分层树结构。例如,人类疾病可以分为粗略的类别,例如,细菌和病毒。这些类别可以进一步分为更细的类别,例如,病毒感染可以是呼吸道、胃肠道和排泄性病毒疾病。在电子商务、产品、电影、书籍等方面,被分组到分层类别中,例如,服装项目按性别,然后按类型(正式,休闲等)划分。虽然在某些应用中可能知道不同项的树结构和类别,但在许多其他应用中,它们必须与嵌入一起学习。在这项工作中,我们提出了eTREE,一个模型,它结合了(通常被忽视的)树结构,以提高嵌入的质量。我们利用非负MF(NMF)的特殊唯一性来证明eTREE的可识别性。该模型不仅利用了树结构的先验知识,而且以无监督的数据驱动方式学习层次聚类。我们得到一个有效的算法解决方案和可扩展的实现eTREE,利用并行计算,计算缓存,热启动策略。我们展示了eTREE对来自不同应用领域的真实数据的有效性:医疗保健,推荐系统和教育。我们还证明了从eTREE获得的领域专家解释的树的意义。

英文摘要:

Matrix factorization (MF) plays an important role in a wide range of machine learning and data mining models. MF is commonly used to obtain item embeddings and feature representations due to its ability to capture correlations and higher-order statistical dependencies across dimensions. In many applications, the categories of items exhibit a hierarchical tree structure. For instance, human diseases can be divided into coarse categories, e.g., bacterial, and viral. These categories can be further divided into finer categories, e.g., viral infections can be respiratory, gastrointestinal, and exanthematous viral diseases. In e-commerce, products, movies, books, etc., are grouped into hierarchical categories, e.g., clothing items are divided by gender, then by type (formal, casual, etc.). While the tree structure and the categories of the different items may be known in some applications, they have to be learned together with the embeddings in many others. In this work, we propose eTREE, a model that incorporates the (usually ignored) tree structure to enhance the quality of the embeddings. We leverage the special uniqueness properties of Nonnegative MF (NMF) to prove identifiability of eTREE. The proposed model not only exploits the tree structure prior, but also learns the hierarchical clustering in an unsupervised data-driven fashion. We derive an efficient algorithmic solution and a scalable implementation of eTREE that exploits parallel computing, computation caching, and warm start strategies. We showcase the effectiveness of eTREE on real data from various application domains: healthcare, recommender systems, and education. We also demonstrate the meaningfulness of the tree obtained from eTREE by means of domain experts interpretation.

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

↑