摘要
The clustering of customer transaction data is very important to retail and e-commerce companies. The authors propose a local PurTree spectral clustering algorithm for massive customer transaction data that uses a purchase tree to represent customer transaction data and a PurTree distance to compute the distance between two trees. The new method learns a data similarity matrix from the local distances and the level weights in the PurTree distance simultaneously. An iterative optimization algorithm is proposed to optimize the proposed model. The authors conducted experiments to compare their method with four commonly used clustering method for transaction data on six real-life datasets. The experimental results show that the new method outperformed other clustering algorithms.
| 源语言 | 英语 |
|---|---|
| 期刊论文编号 | 7887642 |
| 页(从-至) | 37-44 |
| 页数 | 8 |
| 期刊 | IEEE Intelligent Systems |
| 卷 | 32 |
| 期 | 2 |
| DOI | |
| 出版状态 | 已出版 - 1 3月 2017 |
| 已对外发布 | 是 |
学术指纹
探究 'Local PurTree Spectral Clustering for Massive Customer Transaction Data' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver