Cluster Description Formats, Problems and Algorithms
暂无分享,去创建一个
Clustering is one of the major data mining tasks. So far, the database and data mining literature lacks systematic study of cluster descriptions, which are essential to provide the user with understandable knowledge of the clusters and support further interactive exploration. In this paper, we introduce novel description formats leading to more descriptive power. We define two alternative problems of generating cluster descriptions, Minimum Description Length and Maximum Description Accuracy, providing different trade-offs between interpretability and accuracy. We also present heuristic algorithms for both problems, together with their empirical evaluation and comparison to state-of-the-art algorithms.
[1] Dimitrios Gunopulos,et al. Automatic subspace clustering of high dimensional data for data mining applications , 1998, SIGMOD '98.
[2] Heikki Mannila,et al. A database perspective on knowledge discovery , 1996, CACM.
[3] Laks V. S. Lakshmanan,et al. The Generalized MDL Approach for Summarization , 2002, VLDB.
[4] Alberto O. Mendelzon,et al. Concise descriptions of subsets of structured sets , 2003, PODS.
[5] Leo Breiman,et al. Classification and Regression Trees , 1984 .