Name
Abstract | ||
|---|---|---|
Learning meaningful and effective representations for transaction data is a crucial prerequisite for transaction classification and clustering tasks. Traditional methods which use frequent itemsets (FIs) as features often suffer from the data sparsity and high-dimensionality problems. Several supervised methods based on discriminative FIs have been proposed to address these disadvantages, but they require transaction labels, thus rendering them inapplicable to real-world applications where labels are not given. In this paper, we propose an unsupervised method which learns low-dimensional continuous vectors for transactions based on information of both singleton items and FIs. We demonstrate the superior performance of our proposed method in classifying transactions on four datasets compared with several state-of-the-art baselines. |
Year | Venue | Field |
|---|---|---|
2018 | PAKDD | Data mining,Embedding,Computer science,Artificial intelligence,Singleton,Cluster analysis,Database transaction,Rendering (computer graphics),Transaction data,Discriminative model,Machine learning |
DocType | Citations | PageRank |
Conference | 1 | 0.35 |
References | Authors | |
8 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dang Nguyen 0002 | 1 | 43 | 5.45 |
| Tu Dinh Nguyen | 2 | 134 | 20.58 |
| Wei Luo | 3 | 120 | 27.50 |
| Svetha Venkatesh | 4 | 4190 | 425.27 |