Abstract

Clustering aims at grouping of data into clusters based on the similarity between them. It is the pattern of the data that governs grouping. In this paper, we propose method for clustering that is based on finding closeness between the data series. A novel method referred as Clustering with Closeness factor (CCF) is proposed that works in two phases and is not pre-bound with clusters numbers. The method identifies the pattern of data and performs clustering. With proper selection of threshold value, the approach can prove to be a big step for decision making.

References

• Camastra, F. and Verri, A. 2002. A novel kernel method for clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence, p 22-32.
• Kanung, T. Netanyahu, N. and Wu, A. 2002. An efficient k-means clustering algorithm, analysis and implementation. IEEE Transactions on Pattern Analysis and Machine Intelligence, p 881-892.
• Kulkarni, P., Kulkarni, M. 2002. Advance forecasting methods for resource management and medical decision-making. In Proceedings of National Conference on Logistics Management: Future Trends.
• Becker, H., Namman M., and Gravano, L. 2010. Learning similarity metrics for event identification in social media. In Proceedings of the Third ACM International Conference on Web Search and Data Mining, USA, p 291-300.
• Bharti, K., Jain, S., and Shukla, S. 2010. Fuzzy k-means clustering viaJ48 for intrusion detection system. International Journal of Computer Science and Information Technologies, Vol. 1, p 315-318.
• Lui, Y., Cai, J., Yin, J., and Fu, A. 2008. Clustering text data streams. Journal of Computer Science and Technology,( Jan 2008) , p 112-128.
• Deelers, S., Auwantanamongkol, S. 2007. Enhancing k-means algorithm with initial cluster centers derived from data partitioning along the data axis with highest variance. International Journal of Computer Science.
• Fahim, A., Saake, G., Salem, A., Torky, F., and Ramadam, M. 2008. K-means for spherical clusters with large variance in sizes. Journal of World Academy of Science, Engineering and Technology.
• Jain, A., Murthy, M., and Flynn, P. 1999. Data clustering: A review. ACM Computing Surveys, Vol. 31, No. 3.
• Lai, J., Huang, T., and Liaw, Y. 2009. A fast k-means clustering algorithm using cluster center displacement. Journal of Pattern Recognition, Vol. 41, No. 1, (Nov 2009), p 2551-2556.
• Chandra, E., Anuradha, V. 2011. A survey of clustering algorithms for data in spatial database management systems. International Journal of Computer Applications, Vol. 24, No. 9.
• Dave, R., and Krishnapuram, R. 1997. Robust clustering methods: A unified view. IEEE transactions on fuzzy systems, Vol. 5, No. 2.
• Geva, A. 1999. Hierarchical unsupervised fuzzy clustering. IEEE Transactions on Fuzzy Systems, Vol. 7, No. 6.
• Yank, M., and Wu, K. 2004. A similarity based robust clustering method. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 26, No. 4.
• Cai, D., He, X., and Han, J. 2011. Locally consistent concept factorization for document clustering. IEEE Transactions on Knowledge and Data Engineering, Vol. 23, No. 6, 902 – 913.
• He, Q., Chang, K., Lim E., and Banerjee, A. 2009. Keep it simple with time: A Re-examination of probabilistic topic detection models. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 10, No. 10.
• Zhang, K., Tsang, I., and Kwok, J. 2009. Maximum margin clustering made practical. IEEE Transactions on Neural Networks, Vol. 20, No. 4, (April 2009).
• Frank, A., Asuncion, A. 2010. UCI Machine Learning Repository [http://archive.ics.uci.edu/ml]. Irvine, CA: University of California, School of Information and Computer Science.