• JITENDRASINH G RAULJI
• VAIBHAVI M PANDYA

Large data are any data that you cannot load into your computer’s working memory. This is not an objective definition, but a definition that is practical and one that easy to understand. For data mining and pattern recognition communities, to search data and image clustering is used as one of the primary tasks in various applications, and so, clustering algorithms that scale well to data are important and useful. For improved Fuzzy C-Means and to find cluster center first randomly select the observed object and compute the density of the observed object. The density of the observed object is compared with given density parameter. It is found that the density is not less than the given density parameter, the observed object can be seen as the cluster center. For selecting the second cluster center, it is required to satisfying the above constraints. For more specify or easy input to the Fuzzy C-Mean we have tried to apply the decision tree approach.

Fuzzy C-Mean, Data mining, Decision tree

"Improving Performance of Fuzzy C-mean Algorithm using K- D tree Approach", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.7, Issue 12, page no.179-187, December-2020, Available :http://www.jetir.org/papers/JETIR2012224.pdf

"Improving Performance of Fuzzy C-mean Algorithm using K- D tree Approach", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.7, Issue 12, page no. pp179-187, December-2020, Available at : http://www.jetir.org/papers/JETIR2012224.pdf