1. 1. Abbasi and M. Younis, ``A survey on clustering algorithms for wireless sensor networks,'' Comput. Commun., vol. 0, nos. 14_15, pp. 2826_2841, Oct. 2007.
   2. C. C. Aggarwal and C. Zhai, ``A survey of text clustering algorithms,'' in Mining Text Data. New York, NY, USA: Springer-Verlag, 2012, pp. 77_128.
   3. J. Brank, M. Grobelnik, and D. Mladeni¢, ``Asurvey of ontology evaluation techniques,'' in Proc. Conf. Data Mining DataWarehouses (SiKDD), 2005.
   4. R. Xu and D. Wunsch, ``Survey of clustering algorithms,'' IEEE Trans. Neural Netw., vol. 16, no. 3, pp. 645_678, May 2005.
   5. J. C. Bezdek, R. Ehrlich, andW. Full, ``FCM: The fuzzy c-means clustering algorithm,'' Comput. Geosci., vol. 10, nos. 2_3, pp. 191_203, 1984.
   6. T. Zhang, R. Ramakrishnan, and M. Livny, ``BIRCH: An ef_cient data clustering method for very large databases,'' in Proc. ACM SIGMOD Rec., Jun. 1996, vol. 25, no. 2, pp. 103_114.
   7. A. Hinneburg and D. A. Keim, ``An ef_cient approach to clustering in large multimedia databases with noise,'' in Proc. ACM SIGKDD Conf. Knowl. Discovery Ad Data Mining (KDD), 1998, pp. 58_65.
   8. Alexander Hinneburg, Er Hinneburg, and Daniel A. Keim. An efficient approach to clustering in large multimedia databases with noise. In Proc. 4rd Int. Conf. on Knowl- edge Discovery and Data Mining, pages 58–65. AAAI Press, 1998.
   9. Alexander Hinneburg and Daniel A. Keim. Optimal grid-clustering: Towards breaking the curse of dimensionality in high-dimensional clustering. In VLDB'99, pages 506–517. Morgan Kaufmann, 1999
   10. A. P. Dempster, N. M. Laird, and D. B. Rubin, ``Maximum likelihood from incomplete data via the em algorithm,'' J. Roy. Statist. Soc., Ser. B, vol. 39, no. 1, pp. 1_38, 1977.
   11. M. Meil and D. Heckerman, ``An experimental comparison of several clustering and initialization methods,'' in Proc. 14th Conf. Uncertainty Artif. Intell. (UAI), 1998, pp. 386_395.
   12. J. Brank, M. Grobelnik, and D. Mladeni¢, ``Asurvey of ontology evaluation techniques,'' in Proc. Conf. Data Mining DataWarehouses (SiKDD), 2005.
   13. A. P. Dempster, N. M. Laird, and D. B. Rubin, ``Maximum likelihood from incomplete data via the em algorithm,'' J. Roy. Statist. Soc., Ser. B, vol. 39, no. 1, pp. 1_38, 1977.
   14. S. Guha, R. Rastogi, and K. Shim, ``Cure: An ef_cient clustering algorithm for large databases,'' in Proc. ACMSIGMOD Rec., Jun. 1998, vol. 27, no. 2, pp. 73_84.
   15. S. Guha, R. Rastogi, and K. Shim, ``Rock: A robust clustering algorithm for categorical attributes,'' Inform. Syst., vol. 25, no. 5, pp. 345_366, 2000.
   16. J. Han and M. Kamber, Data Mining: Concepts and Techniques, 2nd ed. San Mateo, CA, USA: Morgan Kaufmann, 2006.
   17. A. Hinneburg and D. A. Keim, ``An ef_cient approach to clustering in large multimedia databases with noise,'' in Proc. ACM SIGKDD Conf. Knowl. Discovery Ad Data Mining (KDD), 1998, pp. 58_65.
   18. Hinneburg and D. A. Keim, ``Optimal gridclustering: Towards breaking the curse of dimensionality in high-dimensional clustering,'' in Proc. 25th Int. Conf. Very Large Data Bases (VLDB), 1999, pp. 506_517.
   19. Z. Huang, ``A fast clustering algorithm to cluster very large categorical data sets in data mining,'' in Proc. SIGMODWorkshop Res. Issues Data Mining Knowl. Discovery, 1997, pp. 1_8.
   20. L. Hubert and P. Arabie, ``Comparing partitions,'' J. Classi_cation, vol. 2, no. 1, pp. 193_218, 1985.
   21. A. K. Jain and R. C. Dubes, Algorithms for Clustering Data. Upper Saddle River, NJ, USA: Prentice-Hall, 1988.
   22. G. Karypis, E.-H. Han, andV.Kumar, ``Chameleon: Hierarchical clustering using dynamic modelling,'' IEEE Comput., vol. 32, no. 8, pp. 68_75, Aug. 1999.
   23. L. Kaufman and P. J. Rousseeuw, Finding Groups in Data: An Introduction to Cluster Analysis. New York, NY, USA: Wiley, 2009
   24. T. Kohonen, ``The self-organizing map,'' Neurocomputing, vol. 21, no. 1, pp. 1_6, 1998
   25. J. MacQueen, ``Some methods for classi_cation and analysis of multivariate observations,'' in Proc. 5th Berkeley Symp. Math. Statist. Probab. Berkeley, CA, USA, 1967, pp. 281_297.
   26. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu, ``A density-based algorithm for discovering clusters in large spatial databases with noise,'' in Proc. ACM SIGKDD Conf. Knowl. Discovery Ad Data Mining (KDD), 1996, pp. 226_231.
   27. A. Fahad, Z. Tari, A. Almalawi, A. Goscinski, I. Khalil, and A. Mahmood, ``PPFSCADA: Privacy preserving framework for SCADA data publishing,'' Future Generat. Comput. Syst., vol. 37, pp. 496_511, Jul. 2014.
   28. Fahad, Z. Tari, I. Khalil, I. Habib, and H. Alnuweiri, ``Toward an ef_cient and scalable feature selection approach for internet traf_c classi _cation,'' Comput. Netw., vol. 57, no. 9, pp. 2040_2057, Jun. 2013.
   29. H. Fisher, ``Knowledge acquisition via incremental conceptual clustering,'' Mach. Learn., vol. 2, no. 2, pp. 139_172, Sep. 1987.
   30. J. H. Gennari, P. Langley, and D. Fisher, ``Models of incremental concept formation,'' Artif. Intell., vol. 40, nos. 1_3, pp. 11_61, Sep. 1989.