Clustering Subspace for High Dimensional Categorical Data Using Neuro-Fuzzy Classification

International Journal of Computer Trends and Technology (IJCTT)          
© - November Issue 2013 by IJCTT Journal
Volume-5 Issue-1                           
Year of Publication : 2013
Authors :Ms. K.Karunambiga , Mrs. M.Suganya


Ms. K.Karunambiga , Mrs. M.Suganya."Clustering Subspace for High Dimensional Categorical Data Using Neuro-Fuzzy Classification"International Journal of Computer Trends and Technology (IJCTT),V5(1):12-15 November Issue 2013 .ISSN Published by Seventh Sense Research Group.

Abstract:- Clustering has been used extensively as a vital tool of data mining.Data gathering has been deliberated widely, but mostly all identified usual clustering algorithms lean towards to break down in high dimensional spaces because of the essential sparsity of the data points. Present subspace clustering methods for handling high-dimensional data focus on numerical dimensions.The minimum spanning tree based clustering algorithms, because they do not adopt that data points are clustered around centers or split by a regular geometric curve and have been widely used in training.The present techniques allow these algorithms to extend much more easily with both the number of instances in the dataset and the number of attributes. But the performance minimizesoon with the size of the subspaces in which the groups are found. Theimportant parameter needed by these algorithms is the density threshold and it is not easy to set, particularly across all dimensions of the dataset. The aim of this paper is proposed method investigate the performance of different Neuro-Fuzzy classification methods for the distinction of benign and malign tissue in genes.


References -

[1] A. K. Jain and R. C. Dubes.Algorithms for clustering data.Prentice-Hall, Inc., 1988.
[2] D. Nauck, R. Kruse, “NEFCLASS - A Neuro-Fuzzy approach for the classification of data,“ presented at the Symposium on Applied Computing, Nashville, USA, 1995
[3]Z. Song and N. Roussopoulos. K-nearest neighbor search for moving query point. In SSTD, pages 79–96, 2001
[4]C. C. Aggarwal. Towards meaningful high-dimensional nearest neighbor search by human-computer interaction. In Data Engineering, 2002.Proceedings.18th International Conference on, pages 593{604, 2002.
[5]. M. K. Jiawei Han. Data Mining : Concepts and Techniques, chapter 8, pages 335393. Morgan Kaufmann Publishers, 2001.
[6] D. Nauck, “Fuzzy Neuro Systems: An Overview,“ in Fuzzy Systems in Computer Science. Vieweg, Wiesbaden, 1994
[7] G.H. John, R. Kohavi, and K. Pfleger, “Irrelevant Features and the Subset Selection Problem,” Proc. 11th Int’l Conf. Machine Learning, pp. 121-129, 1994.
[8] K. Kira and L.A. Rendell, “The Feature Selection Problem:Traditional Methods and a New Algorithm,” Proc. 10th Nat’l Conf. Artificial Intelligence, pp. 129-134, 1992.
[9] R. Kohavi and G.H. John, “Wrappers for Feature Subset Selection,” Artificial Intelligence, vol. 97, nos. 1/2, pp. 273-324, 1997.

Keywords :— ranking query, web database, immersed web