Imminent Rift Assortment Algorithm for Elevated Facet Data Using Wanton Collecting

Abstract

Feature subset clustering is a powerful technique to reduce the dimensionality of feature vectors for text classification. In this paper, we propose a similaritybased self-constructing algorithm for feature clustering with the help of K-Means strategy. The words in the feature vector of a document set are grouped into clusters, based on similarity test. Words that are similar to each other are grouped into the same cluster, and make a head to each cluster data sets. By the FAST algorithm, the derived membership functions match closely with and describe properly the real distribution of the training data. Besides, the user need not specify the number of extracted features in advance, and trial-and-error for determining the appropriate number of extracted features can then be avoided. Experimental results show that our FAST algorithm implementation can run faster and obtain better-extracted features than other methods.

Authors and Affiliations

Matta Rambabu| Student of M.Tech Department of Computer Science Engineering G.V.R & S college of Engineering & Technology, GUNTUR, Mayyappa Chakravarthi| Department of Computer Science Engineering G.V.R&S college of Engineering & Technology, GUNTUR

Keywords

Related Articles

MODELLING AND SIMULATION OF LOSSLESS DAMPING REDUCTION BY VECTOR CONTROLLED AC MOTOR DRIVE WITH AN EFFICIENT LC FILTER

In this paper Active damping technique is used to damp out the unwanted resonant frequency oscillations and proposed for lossless damping of vectorcontrolled ac drives with an efficient LC-Filter. This paper mainly co...

Utilization Of Ring Signatures To Construct Homomorphic Authenticators In ORUTA To Verify The Integrity of Shared Data

It is practiced for users to influence cloud storage services to contribute to data with others in a group as data sharing develop into a standard feature in most cloud storage offerings including Drop box, iCloud an...

Closed Loop Fuzzy Logic Control of 3-∅ BLDC Motor Driven by High Voltage Gain Interleaved Boost Converter

This paper deals the Brush Less DC Motor (BLCDM) driven by an efficient closed loop fuzzy logic based high voltage gain interleaved boost converter. The proposed high voltage gain interleaved boost converter in this...

Web-based social networking foundations makes clients unable to fittingly control to whom these items are really shared or not. Computational components that can combine the protection inclinations of numerous clients...

Challenges and Issues of Data Security in Cloud Computing

Cloud computing is still in its infancy in spite of gaining tremendous momentum recently, high security is one of the major obstacles for opening up the new era of the long dreamed vision of computing as a utility. A...

Download PDF file
  • EP ID EP16331
  • DOI -
  • Views 353
  • Downloads 13

How To Cite

Matta Rambabu, Mayyappa Chakravarthi (2014). Imminent Rift Assortment Algorithm for Elevated Facet Data Using Wanton Collecting. International Journal of Science Engineering and Advance Technology, 2(10), 490-494. https://www.europub.co.uk/articles/-A-16331