Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 295067, 9 pages
http://dx.doi.org/10.1155/2013/295067
Research Article

Smooth Splicing: A Robust SNN-Based Method for Clustering High-Dimensional Data

1School of Mathematics, Hefei University of Technology, Hefei 230009, China
2Institute of Intelligent Machines, Chinese Academy of Sciences, Hefei 230031, China
3Department of Automation, University of Science and Technology of China, Hefei 230027, China

Received 8 October 2012; Revised 20 May 2013; Accepted 20 May 2013

Academic Editor: Jun Zhao

Copyright © 2013 JingDong Tan and RuJing Wang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. L. Kaufman and P. J. Rousseeuw, Finding Groups in Data: An Introduction to Cluster Analysis, Wiley-Interscience Press, New York, NY, USA, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. M. Liu, X. Jiang, and A. C. Kot, “A multi-prototype clustering algorithm,” Pattern Recognition, vol. 42, no. 5, pp. 689–698, 2009. View at Publisher · View at Google Scholar · View at Scopus
  3. J. MacQueen, “Some methods for classification and analysis of multivariate observations,” in Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, 1967.
  4. P. J. Rousseeuw, “Silhouettes: a graphical aid to the interpretation and validation of cluster analysis,” Journal of Computational and Applied Mathematics, vol. 20, pp. 53–65, 1987. View at Google Scholar · View at Scopus
  5. S. Guha, R. Rastogi, and K. Shim, “CURE: an efficient clustering algorithm for large databases,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 73–84, 1998.
  6. S. Guha, R. Rastogi, and K. Shim, “Rock: a robust clustering algorithm for categorical attributes,” Information Systems, vol. 25, no. 5, pp. 345–366, 2000. View at Publisher · View at Google Scholar · View at Scopus
  7. G. Karypis, E. Han, and V. Kumar, “Chameleon: hierarchical clustering using dynamic modeling,” Computer, vol. 32, no. 8, pp. 68–75, 1999. View at Publisher · View at Google Scholar · View at Scopus
  8. T. Zhang and R. Ramakrishnan, “BIRCH: an efficient data clustering method for very large databases,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 103–114, 1996.
  9. M. Ankerst, M. M. Breunig, H. Kriegel, and J. Sander, “OPTICS: ordering points to identify the clustering structure,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 49–60, 1999.
  10. M. Ester, H. P. Kriegel, J. Sander, and X. Xu, “A density-based algorithm for discovering clusters in large spatial databases with noise,” in Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining, pp. 226–231, 1996.
  11. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan, “Automatic subspace clustering of high dimensional data,” Data Mining and Knowledge Discovery, vol. 11, no. 1, pp. 5–33, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  12. L. Moussiades and A. Vakali, “Clustering dense graphs: a web site graph paradigm,” Information Processing and Management, vol. 46, no. 3, pp. 247–267, 2010. View at Publisher · View at Google Scholar · View at Scopus
  13. O. Etzioni and M. Perkowitz, “Category translation: learning to understand information on the internet,” in Proceedings of the 15th International Joint Conference on Artificial Intelligence, 1995.
  14. M. E. Houle, “The relevant-set correlation model for data clustering,” Statistical Analysis and Data Mining, vol. 1, no. 3, pp. 157–176, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  15. H. Kriegel, P. Kröger, and A. Zimek, “Clustering high-dimensional data: a survey on subspace clustering, pattern-based clustering, and correlation clustering,” ACM Transactions on Knowledge Discovery from Data, vol. 3, no. 1, article 1, pp. 1–58, 2009. View at Publisher · View at Google Scholar · View at Scopus
  16. M. E. Houle, H. Kriegel, P. Kröger, E. Schubert, and A. Zimek, “Can shared-neighbor distances defeat the curse of dimensionality?” in Proceedings of the 22nd International Conference on Scientific and Statistical Database Management, 2009.
  17. J. Han, M. Kamber, and J. Pei, Data Mining: Concepts and Techniques, Morgan Kaufmann, 2006.
  18. R. A. Jarvis and E. A. Patrick, “Clustering using a similarity measure based on shared nearest neighbors,” IEEE Transactions on Computers, vol. 22, no. 11, pp. 1025–1034, 1973. View at Google Scholar · View at Scopus
  19. L. Ertoz, M. Steinbach, and V. Kumar, “A new shared nearest neighbor clustering algorithm and its applications,” in Proceedings of the Workshop on Clustering High Dimensional Data and Its Applications at 2nd SIAM International Conference on Data Mining, 2001.
  20. L. Ertoz, M. Steinbach, and V. Kumar, “Finding clusters of different sizes, shapes, and densities in noisy, high dimensional data,” in Proceedings of the 2nd SIAM International Conference on Data Mining, San Francisco, Calif, USA, May 2003.
  21. D. Reinhard, Graph Theory, Springer, Berlin, Germany, 2005. View at MathSciNet
  22. S. Hu, R. Tong, T. Ju, and J. Sun, “Approximate merging of a pair of Bezier curves,” Computer-Aided Design, vol. 33, no. 2, pp. 125–136, 2001. View at Publisher · View at Google Scholar · View at Scopus
  23. H. P. Zhang, H. K. Yu, D. Y. Xiong, and Q. Liu, “HHMM-based Chinese lexical analyzer ICTCLAS,” in Proceedings of the 2nd SIGHAN Workshop on Chinese Language Processing (SIGHAN '03), 2003.
  24. G. Salton and M. J. McGill, Introduction to Modern Information Retrieval, McGraw-Hill, 1983.