EXTENSION OF THE FUZZY C MEANS CLUSTERING ALGORITHM TO FIT WITH THE COMPOSITE GRAPH MODEL FOR WEB DOCUMENT REPRESENTATION
Journal: International Journal of Cognitive Research in Science, Engineering and Education (IJCRSEE) (Vol.1, No. 2)Publication Date: 2013-12-20
Authors : Kaushik Kishore Phukon; Hemanta K. Baruah;
Page : 173-179
Keywords : Graph; Web Document; Hard Partition; Fuzzy Partition; Fuzzy C- Means.;
Abstract
Clustering techniques are mostly unsupervised methods that can be used to organize data into groups based on similarities among the individual data items. Fuzzy c-means (FCM) clustering is one of well known unsupervised clustering techniques, which can also be used for unsupervised web document clustering. In this chapter we will introduce a modified method of clustering where the data to be clustered will be represented by graphs instead of vectors or other models. Specifically, we will extend the classical FCM clustering algorithm to work with graphs that represent web documents [1,2,3]. We wish to use graphs because they can allow us to retain information which is often discarded in simpler models.
Other Latest Articles
- PREPARING STUDENTS FOR THE TREATMENT OF A NEW TEACHER CONTENT, AN IMPORTANT PREREQUISITE FOR THE SUCCESSFUL IMPLEMENTATION OF THE TASK OF TEACHING
- PEDAGOGICAL PRACTICE WAY OF CONNECTING PEDAGOGICAL THEORY AND PRACTICE
- COMMUNICATIVE EFFECT ACHIEVED THROUGH SPEECH ACTS OF MANIPULATION
- PROBLEMS DISCONTINUITY ON THE FIRST LEVEL OF THE SCHOOL SYSTEM
- PSYCHOLOGICAL ASPECTS OF GIFTED CHILDREN
Last modified: 2015-04-14 19:46:26