Fast Single-Link Clustering Method Based on Tolerance Rough Set Model
暂无分享,去创建一个
[1] Anil K. Jain,et al. Data clustering: a review , 1999, CSUR.
[2] Andrzej Skowron,et al. Tolerance Approximation Spaces , 1996, Fundam. Informaticae.
[3] Daniel Vanderpooten,et al. A Generalized Definition of Rough Approximations Based on Similarity , 2000, IEEE Trans. Knowl. Data Eng..
[4] Jörg Sander,et al. Data Bubbles for Non-Vector Data: Speeding-up Hierarchical Clustering in Arbitrary Metric Spaces , 2003, VLDB.
[5] John A. Hartigan,et al. Clustering Algorithms , 1975 .
[6] Hans-Peter Kriegel,et al. Fast Hierarchical Clustering Based on Compressed Data and OPTICS , 2000, PKDD.
[7] Hans-Peter Kriegel,et al. OPTICS: ordering points to identify the clustering structure , 1999, SIGMOD '99.
[8] William M. Rand,et al. Objective Criteria for the Evaluation of Clustering Methods , 1971 .
[9] Tu Bao Ho,et al. Nonhierarchical document clustering based on a tolerance rough set model , 2002, Int. J. Intell. Syst..
[10] Jerzy W. Grzymala-Busse,et al. Rough Sets , 1995, Commun. ACM.
[11] Tian Zhang,et al. BIRCH: an efficient data clustering method for very large databases , 1996, SIGMOD '96.
[12] Jan Komorowski,et al. Principles of Data Mining and Knowledge Discovery , 2001, Lecture Notes in Computer Science.
[13] Tsau Young Lin,et al. Rough Sets and Data Mining: Analysis of Imprecise Data , 1996 .
[14] Pradeep Kumar,et al. Rough clustering of sequential data , 2007, Data Knowl. Eng..