Abstract
We propose a robust and efficient algorithm called ROCKET for clustering large-scale transaction databases. ROCKET is a divisive hierarchical algorithm that makes the most of recent hardware architecture. ROCKET handles the cases with the small and the large number of similar transaction pairs separately and efficiently. Through experiments, we show that ROCKET achieves high-quality clustering with a dramatic performance improvement.
Original language | English |
---|---|
Pages (from-to) | 2048-2051 |
Number of pages | 4 |
Journal | IEICE Transactions on Information and Systems |
Volume | E94-D |
Issue number | 10 |
DOIs | |
State | Published - Oct 2011 |
Keywords
- Divisive hierarchical clustering
- Large-scale transaction databases
- Parallelization