Aggregated Probabilistic Fuzzy Relational Sentence Level Expectation Maximization Clustering Algorithm for Efficient Text Categorization

Abstract

Now a days, Text clustering becomes an important application to organize the data and to extract useful information from the available corpus. Many previous clustering techniques have difficulties in handling extreme outliers but fuzzy clustering algorithms tend to give them very small membership degree in surrounding clusters. In this paper we proposed an aggregated probabilistic Fuzzy relational sentence level expectation maximization clustering algorithm for efficient text categorization. It will give the accurate and maximum similarity by finding the relevance of sentences which belongs to a particular cluster. This technique leads to a fuzzy partition of the sentences and find out the accurate probability of the words belongs to a cluster. This algorithm is particularly used in finding maximum likelihood estimates of words in a given sentence. It gives the low search results with highest accuracy. The practical results show that the proposed method obtains better and accurate results for getting best sentence-wise text classification when compared with the existing methods.