Exhaustive k-nearest-neighbour subspace clustering

References

• Jain AK, Dubes RC. Algorithms for clustering data. New Jersey: Prentice-Hall; 1988.
   Google Scholar
• Jain AK. Data clustering: 50 years beyond K-means. Pattern Recogn Lett. 2010;31(8):651–666. doi: 10.1016/j.patrec.2009.09.011
   Web of Science ®Google Scholar
• Jain AK, Topchy A, Law MHC, Buhmann JM. Landscape of clustering algorithms. In: Kittler J, Petrou M, Nixon MS, editors. Proceedings of the 17th international conference on pattern recognition. Washington: IEEE Computer Society; 2004. p. 260–263.
   Google Scholar
• Xu R, Wunsch II DC. Clustering. New York: Wiley; 2009.
   Google Scholar
• Beyer K, Goldstein J, Ramakrishnan R, Shaft U. When is nearest neighbor meaningful? In: Beeri C, Buneman P, editors. 7th international conference on database theory. Lecture Notes in Computer Science, Vol. 1540. Berlin: Springer; 1999. p. 217–235.
   Google Scholar
• Hinneburg A, Addarwal CC, Keim DA. What is the nearest neighbor in high dimensional spaces? In: El Abbadi A, Brodie ML, Chakravarthy S, Dayal U, Kamel N, Schlageter G, Whang KY, editors. 26th international conference on very large data bases. San Francisco: Morgan Kaufmann; 2000. p. 506–515.
   Google Scholar
• Aggarwal CC, Hinneburg A, Keim DA. On the surprising behavior of distance metrics in high dimensional space. In: Van den Bussche J, Vianu V, editors. 8th international conference on database theory. Lecture Notes in Computer Science, Vol. 1973. Berlin: Springer; 2001. p. 420–434.
   Google Scholar
• Houle ME, Kriegel HP, Kröger P, Schubert E, Zimek A. Can shared-neighbor dinstances defeat the curse of dimensionality? In: Gertz M, Ludäscher B, editors. 22nd international conference on scientific and statistical database management. Lecture Notes in Computer Science, Vol. 6187. Berlin: Springer; 2010. p. 482–500.
   Google Scholar
• Agrawal R, Gehrke J, Gunopulos D, Raghavan P. Automatic subspace clustering of high dimensional data for data mining applications. ACM SIGMOD International Conference on Management of Data, Seattle, WA. New York: ACM Press; 1998. p. 94–105.
   Google Scholar
• Ng EKK, Fu AWC, Wong RCW. Projective clustering by histograms. IEEE Trans Knowl Data Eng. 2005;17:369–383. doi: 10.1109/TKDE.2005.47
   Web of Science ®Google Scholar
• Madeira SC, Oliveira AL. Biclustering algorithms for biological data analysis: a survey. IEEE/ACM Trans Comput Biol Bioinformatics. 2004;1(1):24–45. doi: 10.1109/TCBB.2004.2
   PubMed Web of Science ®Google Scholar
• Everitt BS, Landau S, Leese M. Cluster analysis. 4th ed. New York: Oxford University Press; 2001.
   Google Scholar
• de Souto MCP, Costa IG, de Araujo DSA, Ludermir TB, Schliep A. Clustering cancer gene expression data: a comparative study. BMC Bioinformatics. 2008;9(1):497. doi: 10.1186/1471-2105-9-497
   PubMed Web of Science ®Google Scholar
• Kraus JM, Kestler HA. A highly efficient multi-core algorithm for clustering extremely large datasets. BMC Bioinformatics. 2010;11(1):169+.
   PubMed Web of Science ®Google Scholar
• Kraus JM, Müssel C, Palm G, Kestler HA. Multi-objective selection for collecting cluster alternatives. Comput. Statist. 2011;26(2):341–353. doi: 10.1007/s00180-011-0244-6
   Web of Science ®Google Scholar
• Kestler HA, Müller A, Schwenker F, Gress TM, Mattfeldt T, Palm G. Cluster analysis of comparative genomic hybridization data. Lecture Notes NATO ASI: Aritificial Intelligence and Heuristic Methods for Bioinformatics. Amsterdam: IOS Press; 2001; Abstract, p. S–40.
   Google Scholar
• Lange T, Roth V, Braun ML, Buhmann JM. Stability-based validation of clustering solutions. Neural Comput. 2004;16(6):1299–1323. doi: 10.1162/089976604773717621
   PubMed Web of Science ®Google Scholar
• Bertoni A, Valentini G. Random projections for assessing gene expression cluster stability. Neural Networks, 2005. IJCNN ’05. Proceedings. 2005 IEEE International Joint Conference on, Vol. 1, Montreal, QC. Piscataway, NJ: IEEE; 2005. p. 149–154.
   Google Scholar
• Kriegel HP, Kröger P, Zimek A. Clustering high-dimensional data: a survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM Trans Knowl Discovery Data. 2009;3(1):1–58. doi: 10.1145/1497577.1497578
   Web of Science ®Google Scholar
• Deb K. Multi-objective optimization using evolutionary algorithms. New York: Wiley; 2004.
   Google Scholar
• Müssel C, Lausser L, Maucher M, Kestler HA. Multi-objective parameter selection for classifiers. J Statist Softw. 2012;46(5):1–27.
   PubMed Web of Science ®Google Scholar
• Pareto V. Manuale Di Economia Politica. Milano: Societa Editrice Libraria; 1906.
   Google Scholar
• MacQueen JB. Some methods for classification and analysis of multivariate observations. In: Neyman J, Cam LL, editors. 5th Berkeley symposium on math, statistics and probability,Vol. 1. Berkeley: University of California Press; 1967. p. 281–297.
   Google Scholar
• Mizoguchi R, Shimura M. A nonparametric algorithm for detecting clusters using hierarchical structure. IEEE Trans Pattern Anal Mach Intell. 1980;2(4):292–300. doi: 10.1109/TPAMI.1980.4767028
   PubMed Web of Science ®Google Scholar
• Franti P, Virmajoki O, Hautamaki V. Fast agglomerative clustering using a k-nearest neighbor graph. IEEE Trans Pattern Anal Mach Intell. 2006;28(11):1875–1881. doi: 10.1109/TPAMI.2006.227
   PubMed Web of Science ®Google Scholar
• Jarvis R, Patrick E. Clustering using a similarity measure based on shared near neighbors. IEEE Trans Comput. 1973;22(11):1025–1034. doi: 10.1109/T-C.1973.223640
   Web of Science ®Google Scholar
• Bubeck S, von Luxburg U. Nearest neighbor clustering: a baseline method for consistent clustering with arbitrary objective functions. J Mach Learn Res. 2009;10:657–698.
   Web of Science ®Google Scholar
• Tran T, Wehrens R, Buydens L. KNN-kernel density-based clustering for high-dimensional multivariate data. Comput Statist Data Anal. 2006;51(2):513–525. doi: 10.1016/j.csda.2005.10.001
   Web of Science ®Google Scholar
• Tibshirani R, Walther G, Hastie T. Estimating the number of clusters in a data set via the gap statistic. J R Statist Soc (Ser B). 2001;63(2):411–423. doi: 10.1111/1467-9868.00293
   Web of Science ®Google Scholar
• Smyth P. Clustering using Monte Carlo cross-validation. In: Simoudis E, Han J, Fayyad U, editors. Proceedings of the 2nd international conference on knowledge discovery and data mining. Washington: AAAI Press; 1996. p. 126–133.
   Google Scholar
• Jain AK, Moreau JV. Bootstrap technique in cluster analysis. Pattern Recogn. 1987;20(5):547–568. doi: 10.1016/0031-3203(87)90081-1
   Web of Science ®Google Scholar
• Ultsch A. Clustering with SOM: U*C. In: Workshop on self-organizing maps. Paris; 2005. p. 75–82.
   Google Scholar
• Frank A, Asuncion A. UCI machine learning repository. 2010. http://archive.ics.uci.edu/ml.
   Google Scholar
• Silva J, Marques de Sa J, Jossinet J. Classification of breast tissue by electrical impedance spectroscopy. Med Biol Eng Comput. 2000;38:26–30. doi: 10.1007/BF02344684
   PubMed Web of Science ®Google Scholar
• Charytanowicz M, Niewczas J, Kulczycki P, Kowalski PA, Lukasik S, Zak S. Complete gradient clustering algorithm for features analysis of x-ray images. In: Pietka E, Kawa J, editors. Information technologies in biomedicine. Advances in Intelligent and Soft Computing, Vol. 69. Berlin: Springer; 2010. p. 15–24.
   Google Scholar