Clustering For Non sentence Data Sets Using HFRECCA (Hierarchical Fuzzy Relational Eigenvector Centrality based Clustering Algorithm)
Journal Title: International Journal of Research in Computer and Communication Technology - Year 2014, Vol 3, Issue 10
Abstract
Clustering is the process of grouping or aggregating of data items. Sentence clustering mainly used in variety of applications such as classify and categorization of documents, automatic summary generation, organizing the documents, etc. In text processing, sentence clustering plays a vital role this is used in text mining activities. Size of the clusters may change from one cluster to another. The traditional clustering algorithms have some problems in clustering the input dataset. The problems such as, instability of clusters, complexity and sensitivity. To overcome the drawbacks of these clustering algorithms, this paper proposes a algorithm called Hierarchical Fuzzy Relational Eigenvector Centrality-based Clustering Algorithm (HFRECCA) is extension of FRECCA which is used for the clustering of sentences. Contents present in text documents contain hierarchical structure and there are many terms present in the documents which are related to more than one theme hence HFRECCA will be useful algorithm for natural language documents.
Authors and Affiliations
K. Anusha, A. K. Mahalakshmi
Keywords
Related Articles
- EP ID EP28043
- DOI -
- Views 245
- Downloads 0
K-Medoid Clustering Shows Negative Impact In Missing Data Imputation
Missing Data Imputation imputes the missing values from the known values. Rather than imputing from the whole dataset, imputation techniques are applied in the clusters generated by using clustering algorithm. In this...
Design of Punctuality Enhanced Bus Transportation System Using GSM and Zigbee
Public traffic system depends mainly on driver’s manual operation, which will encounter many problems regarding the punctuality of the bus’s arrival and departure of the bus at bus stations. Paper proposes a supervi...
Securing a Network by Modeling and Containment of Worms Using Preference Scanning
Self-propagating codes, called worms. In this paper, we present an inclination branching process model for characterizing the propagation of Internet worms. Basically user knows the name and the definition of worms, b...
http://www.ijrcct.org/index.php/ojs/article/download/1245/pdf
It is pleasing to offer differentiated access services such thatdata access policies are distinct over user attributes or roles,which are direct by the key authorities. We propose a securedata recovery scheme using C...
Location Monitoring algorithms for Wireless Sensor Networks
In this work we propose a privacy-preserving location monitoring system for wireless sensor networks. Here we design two in network location anonymization algorithms, namely, resource- and quality-aware algorithms, t...