A FAST Algorithm for High Dimensional Data using Clustering-Based Feature Subset Selection

Abstract

Feature subset clustering is a powerful technique to reduce the dimensionality of feature vectors for text classification and involves identifying a subset of the most useful features that produces compatible results as the original entire set of features. A novel approach called supervised attribute clustering algorithm is proposed to improve the accuracy and check the probability of the patterns. The FAST algorithm works in two steps. In the first step, features are divided into clusters by using graph-theoretic clustering methods. In the second step, the most representative feature that is strongly related to target classes is selected from each cluster to form a subset of features. A feature selection algorithm may be evaluated from both the efficiency and effectiveness points of view. Efficiency is related to the time required to find a subset of features while the effectiveness is related to quality of subset of features.Features in different clusters are relatively independent; the clusteringbased strategy of FAST has a high probability of producing a subset of useful and independent features. To ensure the efficiency of FAST, we adopt the efficient minimum-spanning tree clustering method.

Authors and Affiliations

Puppala Priyanka, M Swapna

Keywords

Related Articles

Algorithm for Speckle Reduction and Image Enhancement in SAR Images Using Wavelet Transforms

Image Denoising and enhancement plays key role in the SAR imagery analysis. Detection of features is important and this can be done by image enhancement. The aim is to improve visibility of the low contrast features and...

Simulation based performance of AODV (Reactive) and DSDV (Proactive) routing protocol for MANET

Mobile Ad hoc network which runs on battery power and is the major source of entire nodes, the entire network and network lifetime [14] is dependent on that battery power, if any of the node present in the network runs...

Design of Fractional order Recursive Digital Differentiator using Continued Fraction Expansion

In this paper, new discretized models of fractional order differentiator (FOD) based on different operators are proposed. Specifically in this work, one-third and one-fourth order differentiator models based on Simpson...

Wear Analysis of Hip Joint Prosthesis: A Review

Total hip replacement (THR) is one of the most successful applications of biomaterials in the medical industry. In THR, a spherical head connected to the femoral stem articulates against a spherical cup/liner attached t...

Implementation of UART Using VHDL

UART (Universal Asynchronous Receiver Transmitter) is a kind of serial communication protocol; mostly used for short-distance, low speed, low-cost data exchange between computer and peripherals. During the actual indust...

Download PDF file
  • EP ID EP19027
  • DOI -
  • Views 284
  • Downloads 9

How To Cite

Puppala Priyanka, M Swapna (2014). A FAST Algorithm for High Dimensional Data using Clustering-Based Feature Subset Selection. International Journal for Research in Applied Science and Engineering Technology (IJRASET), 2(11), -. https://europub.co.uk./articles/-A-19027