An Effective Cluster Analysis Algorithm Based on Grid and Intensity
Chen Gang · Jisuanji gongcheng · 2003
After discussing the concepts, techniques and algorithms about clustering, a grid and density based cluster algorithm was proposed. It can automatically find out the subspaces containing interesting patterns and discover all clusters in these subspaces. Besides, it performs well when dealing with high dimensional data and has good scalability when the size of the data sets increases. As results, clusters found are presented to users in DNF expressions.'