eTREE: Learning Tree-structured Embeddings
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..
| Medienart: |
|
|---|
Preprint| Erscheinungsjahr: |
2020 |
|---|---|
| Erschienen: |
2020 |
| Enthalten in: |
arXiv.org - (2020) vom: 20. Dez. Zur Gesamtaufnahme - year:2020 |
|---|
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Almutairi, Faisal M. [VerfasserIn] |
|---|
| Links: |
Volltext [kostenfrei] |
|---|
| Förderinstitution / Projekttitel: |
|
|---|
| PPN (Katalog-ID): |
XAR019606028 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | XAR019606028 | ||
| 003 | DE-627 | ||
| 005 | 20230429062649.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 201229s2020 xx |||||o 00| ||eng c | ||
| 035 | |a (DE-627)XAR019606028 | ||
| 035 | |a (DE-599)arXiv2012.10853 | ||
| 035 | |a (arXiv)2012.10853 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | |a 000 |q DE-84 | |
| 100 | 1 | |a Almutairi, Faisal M. |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a eTREE: Learning Tree-structured Embeddings |
| 264 | 1 | |c 2020 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 520 | |a 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. | ||
| 700 | 1 | |a Wang, Yunlong |e verfasserin |4 aut | |
| 700 | 1 | |a Wang, Dong |e verfasserin |4 aut | |
| 700 | 1 | |a Zhao, Emily |e verfasserin |4 aut | |
| 700 | 1 | |a Sidiropoulos, Nicholas D. |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t arXiv.org |g (2020) vom: 20. Dez. |
| 773 | 1 | 8 | |g year:2020 |g day:20 |g month:12 |
| 856 | 4 | 0 | |u https://arxiv.org/abs/2012.10853 |z kostenfrei |3 Volltext |
| 912 | |a GBV_XAR | ||
| 912 | |a SSG-OLC-PHA | ||
| 951 | |a AR | ||
| 952 | |j 2020 |b 20 |c 12 | ||
| 953 | |2 045F |a 000 | ||