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

A Novel Optimal routing using Hop-by-Hop Adaptive linking

I am presenting the first of its kind project, the first link-state routing solution carrying traffic through packetswitched networks. At each node, for every other node, the algorithm independently and iteratively upd...

Adaptive Query Image Searching Methods Using Improved Hash Coding and Unified Color and Intensity level Matrices

In this thesis we had implemented Hash coding with bit wise hamming distance for similarity measurement between the feature vectors of query and database, which will be more secured and real time based application. B...

Combination Methodology For Protected Formal Deduplication In Cloud Computing

Data Deduplication is an significant method in favour get rid of redundant data as an alternative of captivating files, it provisions merely distinct copy of file. Among the entire organizations many organizations, s...

Spontaneous Assessment Packet Origination

Nowadays systems aren't getting any slighter, they are expanding in size and it's transforming into a monotonous employment for system chairmen to adjust the system since they put trust in conventional instruments li...

Ladderal Structure Of Super Resolution With Support Of Inpainting

Inpainting is the process of reconstructing lost or deteriorated part of images based on the background information. i. e. image Inpainting fills the missing or damaged region in an image utilizing spatial informatio...

Download PDF file
  • EP ID EP16331
  • DOI -
  • Views 334
  • 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://europub.co.uk/articles/-A-16331