@article {SAM:SAM11149, title = {Nearest-neighbors medians clustering}, journal = {Statistical Analysis and Data Mining}, volume = {5}, number = {4}, year = {2012}, pages = {349{\textendash}362}, publisher = {Wiley Subscription Services, Inc., A Wiley Company}, keywords = {cluster analysis, local median, nearest neighbors, number of clusters}, issn = {1932-1872}, doi = {10.1002/sam.11149}, url = {http://dx.doi.org/10.1002/sam.11149}, author = {Pena, Daniel and Viladomat, J{\'u}lia and Zamar, Ruben} } @article { ISI:000249912400024, title = {CLUES: A non-parametric clustering method based on local shrinking}, journal = {COMPUTATIONAL STATISTICS \& DATA ANALYSIS}, volume = {52}, number = {1}, year = {2007}, month = {SEP 15}, pages = {286-298}, publisher = {ELSEVIER SCIENCE BV}, type = {Article}, address = {PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS}, abstract = {A novel non-parametric clustering method based on non-parametric local shrinking is proposed. Each data point is transformed in such a way that it moves a specific distance toward a cluster center. The direction and the associated size of each movement are determined by the median of its K-nearest neighbors. This process is repeated until a pre-defined convergence criterion is satisfied. The optimal value of the number of neighbors is determined by optimizing some commonly used index functions that measure the strengths of clusters generated by the algorithm. The number of clusters and the final partition are determined automatically without any input parameter except the stopping rule for convergence. Experiments on simulated and real data sets suggest that the proposed algorithm achieves relatively high accuracies when compared with classical clustering algorithms. (c) 2007 Elsevier B.V. All rights reserved.}, keywords = {automatic clustering, K-nearest neighbors, local shrinking, number of clusters}, issn = {0167-9473}, doi = {10.1016/j.csda.2006.12.016}, author = {Wang, Xiologang and Qiu, Weiliang and Zamar, Ruben H.} }