Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2015, Article ID 107650, 5 pages
http://dx.doi.org/10.1155/2015/107650
Research Article

Scalable Clustering of High-Dimensional Data Technique Using SPCM with Ant Colony Optimization Intelligence

1Department of Computer Applications, Gnanamani College of Technology, AK Samuthiram, Pachal, Namakkal District, Tamil Nadu 637 018, India
2Department of Computer Science and Engineering, Kongu Engineering College, Perundurai, Erode, Tamil Nadu 638 052, India

Received 13 April 2015; Accepted 21 April 2015

Academic Editor: Venkatesh Jaganathan

Copyright © 2015 Thenmozhi Srinivasan and Balasubramanie Palanisamy. 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. 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 · View at Scopus
  2. C. C. Aggarwal, J. L. Wolf, P. S. Yu, C. Procopiuc, and J. S. Park, “Fast algorithms for projected clustering,” in Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD '99), pp. 61–72, 1999. View at Publisher · View at Google Scholar
  3. M. Ester, H. P. Kriegel, and X. Xu, “A database interface for clustering in large spatial databases,” in Proceedings of the 1st International Conference on Knowledge Discovery in Databases and Data Mining, Montreal, Canada, 1995.
  4. T. Zhang, R. Ramakrishnan, and M. Livny, “BIRCH: an efficient data clustering method for very large databases,” in Proceedings of the ACM SIGMOD Conference on Management of Data, Montreal, Canada, 1996.
  5. K. Y. Yip, D. W. Cheung, and M. K. Ng, “A review on projected clustering algorithms,” International Journal of Applied Mathematics, vol. 13, pp. 24–35, 2003. View at Google Scholar
  6. 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, June 1998.
  7. H. Liu and L. Yu, “Toward integrating feature selection algorithms for classification and clustering,” IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 4, pp. 491–502, 2005. View at Publisher · View at Google Scholar · View at Scopus
  8. M. Bouguessa and S. Wang, “Mining projected clusters in high-dimensional spaces,” IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 4, pp. 507–522, 2009. View at Publisher · View at Google Scholar · View at Scopus
  9. M. L. Yiu and N. Mamoulis, “Iterative projected clustering by subspace mining,” IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 2, pp. 176–189, 2005. View at Publisher · View at Google Scholar · View at Scopus
  10. K. Y. L. Yip, D. W. Cheung, and M. K. Ng, “HARP: a practical projected clustering algorithm,” IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 11, pp. 1387–1397, 2004. View at Publisher · View at Google Scholar · View at Scopus
  11. E. Ng, A. Fu, and R. Wong, “Projective clustering by histograms,” IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 3, pp. 369–383, 2005. View at Publisher · View at Google Scholar
  12. C. M. Procopiuc, M. Jones, P. K. Agarwal, and T. M. Murali, “A Monte Carlo algorithm for fast projective clustering,” in Proceedings of the ACM SIGMOD International Conference on Managment of Data, pp. 418–427, June 2002. View at Scopus
  13. H. Wang, W. Wang, J. Yang, and P. S. Yu, “Clustering by pattern similarity in large data sets,” in Proceedings of the ACM SIGMOD International Conference on Managment of Data (ACM SIGMOD '02), pp. 394–405, June 2002. View at Scopus
  14. V. S. Tseng and C.-P. Kao, “A novel similarity-based fuzzy clustering algorithm by integrating PCM and mountain method,” IEEE Transactions on Fuzzy Systems, vol. 15, no. 6, pp. 1188–1196, 2007. View at Publisher · View at Google Scholar · View at Scopus
  15. J. Venkatesh, K. Sridharan, and S. B. Manooj Kumaar, “Location based services prediction in mobile mining: determining precious information,” European Journal of Social Sciences, vol. 37, no. 1, pp. 80–92, 2013. View at Google Scholar
  16. R. T. Ng and J. Han, “Efficient and effective clustering methods for spatial data mining,” in Proceedings of the 20th International Conference on Very Large Data Bases (VLDB '94), pp. 144–155, Santiago, Chile, 1994.
  17. D. Ryabko, “Clustering processes,” in Proceedings of the 27th International Conference on Machine Learning (ICML '10), pp. 919–926, Haifa, Israel, June 2010. View at Scopus
  18. R. R. Yager and D. P. Filev, “Approximate clustering via the mountain method,” IEEE Transactions on Systems, Man and Cybernetics, vol. 24, no. 8, pp. 1279–1284, 1994. View at Publisher · View at Google Scholar · View at Scopus
  19. M. Dorigo and K. Socha, “An introduction to ant colony optimization,” in Approximation Algorithms and Metaheuristics, T. F. Gonzalez, Ed., CRC Press, 2007. View at Google Scholar
  20. K. Y. Yip, D. W. Cheung, M. K. Ng, and K. H. Cheung, “Identifying projected clusters from gene expression profiles,” Journal of Biomedical Informatics, vol. 37, no. 5, pp. 345–357, 2004. View at Publisher · View at Google Scholar · View at Scopus