ROCKET: A Robust Parallel Algorithm for Clustering Large-Scale Transaction Databases
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E94-D No.10 pp.2048-2051
- Publication Date
- 2011/10/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E94.D.2048
- Type of Manuscript
- LETTER
- Category
- Artificial Intelligence, Data Mining
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Woong-Kee LOH, Yang-Sae MOON, Heejune AHN, "ROCKET: A Robust Parallel Algorithm for Clustering Large-Scale Transaction Databases" in IEICE TRANSACTIONS on Information,
vol. E94-D, no. 10, pp. 2048-2051, October 2011, doi: 10.1587/transinf.E94.D.2048.
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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E94.D.2048/_p
Copy
@ARTICLE{e94-d_10_2048,
author={Woong-Kee LOH, Yang-Sae MOON, Heejune AHN, },
journal={IEICE TRANSACTIONS on Information},
title={ROCKET: A Robust Parallel Algorithm for Clustering Large-Scale Transaction Databases},
year={2011},
volume={E94-D},
number={10},
pages={2048-2051},
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.},
keywords={},
doi={10.1587/transinf.E94.D.2048},
ISSN={1745-1361},
month={October},}
Copy
TY - JOUR
TI - ROCKET: A Robust Parallel Algorithm for Clustering Large-Scale Transaction Databases
T2 - IEICE TRANSACTIONS on Information
SP - 2048
EP - 2051
AU - Woong-Kee LOH
AU - Yang-Sae MOON
AU - Heejune AHN
PY - 2011
DO - 10.1587/transinf.E94.D.2048
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E94-D
IS - 10
JA - IEICE TRANSACTIONS on Information
Y1 - October 2011
AB - 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.
ER -
English
