ROCKET: A Robust Parallel Algorithm for Clustering Large-Scale Transaction Databases

Citations

WEB OF SCIENCE

1
Citations

SCOPUS

1

초록

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.

키워드

divisive hierarchical clusteringlarge-scale transaction databasesparallelization
제목
ROCKET: A Robust Parallel Algorithm for Clustering Large-Scale Transaction Databases
저자
Loh, Woong-KeeMoon, Yang-SaeAhn, Heejune
DOI
10.1587/transinf.E94.D.2048
발행일
2011-10
유형
Article
저널명
IEICE Transactions on Information and Systems
E94D
10
페이지
2048 ~ 2051