An efficient clustering algorithm for market basket data based on small large ratios
Resource
Proceedings - IEEE Computer Society's International Computer Software and Applications Conference
Journal
IEEE Computer Society's International Computer Software and Applications Conference
Pages
505-510
Date Issued
2001-10
Date
2001-10
Author(s)
DOI
N/A
Abstract
In this paper we devise an efficient algorithm for clustering market-basket data items. In view of the nature of clustering market basket data, we devise in this paper a novel measurement, called the small-large (abbreviated as SL) ratio, and utilize this ratio to perform the clustering. With this SL ratio measurement, we develop an efficient clustering algorithm for data items to minimize the SL ratio in each group. The proposed algorithm not only incurs an execution time that is significantly smaller than that by prior work but also leads to the clustering results of very good quality.
Type
conference paper
File(s)![Thumbnail Image]()
Loading...
Name
00960660.pdf
Size
556.28 KB
Format
Adobe PDF
Checksum
(MD5):c982c61804c9a3af37c4e4cd5d034b4b
