ObCom 2011: Global Trends in Information Systems and Software Applications pp 256-266 | Cite as
An Efficient Numerical Method for the Prediction of Clusters Using K-Means Clustering Algorithm with Bisection Method
Abstract
The development of modern IT-based analysis methods, data mining, has been outstanding over the last decade. Using computers to analyze masses of information to discover trends and patterns. The current trend in business collaboration shares the data and mines results to gain mutual benefit. The main goal of the work is to introduce a bisection method which is capable of transforming a non-anonymous data set into adult data set. In this model, transform a table so that no one can make high probability association between records in the table and the corresponding entities. In order to achieve these goals we are implemented a bracket rule identifier for the prediction of the cluster. For this a suitable metric has been developed to estimate information loss by suppression which works well for both numeric and categorical data.
Keywords
Data Clustering K-means Cluster analysis Bisection methods SupressionPreview
Unable to display preview. Download preview PDF.
References
- 1.Dunham, M.H.: Data Mining- Introductory and Advanced Concepts. Pearson Education (2006)Google Scholar
- 2.Velmurugan, R., Santhanam, T.: Computational plexity between k-means and k-medoid clustering algorithm for normal and uniform distribution of data points. Journal of Computer Science 6(3), 363–368 (2010); ISSN 1549-3636CrossRefGoogle Scholar
- 3.Borah, S., Ghose, M.K.: Performance analysis of AIM-K-Means and K-means inquality cluster generation. J. Comput. 1, 175–178 (2009)Google Scholar
- 4.Park, H.S., Lee, J.S., Jun, C.H.: A K-means like algorithm for K-medoids clustering and its performance (2006)Google Scholar
- 5.Rakhlin, A., Caponnetto, A.: Stability of k-Means clustering. Adv. Neural Inform. Process. Syst. 12, 216–222 (2007)Google Scholar
- 6.Xiong, H., Wu, J., Chen, J.: K-Means clustering versus validation measures: A data distribution perspective. IEEE Trans. Syst. Man Cybernet. Part B 39, 318–331 (2009)CrossRefGoogle Scholar
- 7.Yuan, F., Meng, Z.H., Zhang, H.X., Dong, C.R.: A New Algorithm to Get the Initial Centroids. In: Proc. of the 3rd International Conference on Machine Learning and Cybernetics, pp. 26–29 (August 2004)Google Scholar
- 8.Almgren, A.S., Bell, J.B., Colella, P., Howell, L.H.: Adaptive projection method for the incompressible Euler equations. In: Proceedings of the Eleventh AIAA Computational Fluid Dynamics Conference, AIAA, p. 530 (June 1993)Google Scholar
- 9.Almgren, A.S., Bell, J.B., Crutchfield, W.Y.: Approximate projection methods. 1. Inviscid analysis. SIAM J. Sci. Comput. 22(4) (2000)Google Scholar
- 10.Almgren, A.S., Bell, J.B., Szymczak, W.G.: A numerical method for the incompressible Navier–Stokes equations based on an approximate projection. SIAM J. Sci. Comput. 17(2) (1996)Google Scholar
- 11.Baštinec, J., Diblík, J.: Asymptotic formulae for a particular solution of linear non homogeneous discrete equations. Advances in difference equations, IV., Comput. Math.Appl. 45(6-9), 1163–1169 (2003)MATHGoogle Scholar
- 12.Baštinec, J., Diblík, J., Ružičková, M.: Initial data generating bounded solutions of linear discrete equations. Opuscula Math. 26(3), 395–406 (2006)MathSciNetMATHGoogle Scholar
- 13.Diblík, J.: Discrete retract principle for systems of discrete equations. Comput. Math. Appl. 42(3-5), 515–528 (2001); Advances in Difference equations, IIIMathSciNetCrossRefMATHGoogle Scholar
- 14.DiblÍk, J.: Asymptotic behaviour of solutions of discrete equations. Funct. Differ. Equ. (11), 37–48 (2004)MathSciNetMATHGoogle Scholar
- 15.Petersen, J., Bodson, M.: Control allocation for systems with coplanar controls. In: In AIAA Guidance, Navigation and Control Conference Proceedings. AIAA Paper 2000-4540 (2000)Google Scholar
- 16.Petersen, J., Bodson, M.: Fast implementation of direct allocation with extension to coplanar controls. Journalof Guidance, Control, and Dynamics 25(3), 464–473 (2002)CrossRefGoogle Scholar
- 17.Friedman, A., Wolff, R., Schuster, A.: Providing k-Anonymity in Data Mining. Int’l J. Very Large Data Bases 17(4), 789–804 (2008)CrossRefGoogle Scholar