Feature Subset Selection with Fast Algorithm Implementation
Journal Title: INTERNATIONAL JOURNAL OF COMPUTER TRENDS & TECHNOLOGY - Year 2013, Vol 6, Issue 1
Abstract
The Title “Feature Subset Selection with FAST Algorithm Implementation” has intended to show the things occurred in between the searches happened in the place of client and server. The users clearly know about the process of how to sending a request for the particular thing, and how to get a response for that request or how the system shows the results explicitly. But no one knows about the internal process of searching records from a large database. This system clearly shows how an internal process of the searching process works. In text classification, the dimensionality of the feature vector is usually huge to manage. The Problems need to be handled are as follows: a) the current problem of the existing feature clustering methods b) The desired number of extracted features has to be specified in advance c) When calculating similarities, the variance of the underlying cluster is not considered d) How to reduce the dimensionality of feature vectors for text classification and run faster. These Problems are handled by means of applying the FAST Algorithm in hands with Association Rule Mining.
Authors and Affiliations
K. Suman , S. Thirumagal
Keywords
Related Articles
- EP ID EP141476
- DOI -
- Views 106
- Downloads 0
A Puzzle Based Authentication Scheme for Cloud Computing
This article presents puzzle based authentication scheme in which cloud user registers and solves the puzzle, puzzle solving time and sequence of image block is stored and validated by local server and the cloud user get...
Energy Efficient Optimal Multicast Routing Protocol for MANETs
Power-efficient multicast routing is just one of the essential issues in the subject of mobile ad hoc networks. Multicasting is actually a phrase which means delivering data packets to several mobile nodes from an projec...
Large-Girth Column-Weight Two QC-LDPC Codes
This article presents a method for constructing large girth column-weight 2 QC-LDPC codes. A distance graph is first constructed using an existing method. The distance graph is then converted into a Tanner graph. The pr...
ACO, Its Modification and Variants
Ant colony optimization (ACO) is a P based metaheuristic algorithm which has been proven as a successful technique and applied to a number of combinatorial optimization problems and is also applied to the Traveling sales...
Optimizing Resource Allocation in IAAS Clouds
Cloud computing is a phenomenon which bestows new model of computing. It has various service modes. The service model which provides on-demand access to computing resources is known as infrastructure-as-a-service (IaaS)....