A Fast Clustering-Based Feature Subset Selection Algorithm for H, Puducherry

A Fast Clustering-Based Feature Subset Selection Algorithm for H

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


Feature selection involves identifying a subset of the most useful features that produces compatible results as the original entire set of features. A feature selection algorithm may be evaluated from both the efficiency and effectiveness points of view. While the efficiency concerns the time required to find a subset of features, the effectiveness is related to the quality of the subset of features. Based on these criteria, a fast clustering-based feature selection algorithm (FAST) is proposed and experimentally evaluated in this paper. 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. Features in different clusters are relatively independent, the clustering-based 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 (MST) clustering method. The efficiency and effectiveness of the FAST algorithm are evaluated through an empirical study. Extensive experiments are carried out to compare FAST and several representative feature selection algorithms, namely, FCBF, ReliefF, CFS, Consist, and FOCUS-SF, with respect to four types of well-known classifiers, namely, the probabilitybased Naive Bayes, the tree-based C4.5, the instance-based IB1, and the rule-based RIPPER before and after feature selection. The results, on 35 publicly available real-world high-dimensional image, microarray, and text data, demonstrate that the FAST not only produces smaller subsets of features but also improves the performances of the four types of classifiers.



#45, Kamaraj Salai, Thattanchavady, JIPMER Road, Puducherry-9

Mobile : (0)9952649690

Email: jpinfotechprojects@gmail.com,

Web: www.jpinfotech.org

Ad ID: 176765483  A Fast Clustering-Based Feature Subset Selection Algorithm for H, Puducherry
Ad ID: 176765483
Advertiser: jpinfotech
Joined Locanto
longer than 3 years ago
Contact jpinfotech
Your message
Your name
Your email address
(not seen by the receiver)

Safety Tips
If an offer seems too good to be true, verify its authenticity first. Use the contact form to communicate with the ad poster to protect your identity. Never send inquiries using emails and phone numbers on the ad. Use the contact form and Locanto’s “My Messages”. Beware of poorly-written English ads and replies. Most scams originate overseas. Report ads and messages that are suspicious. The best way to pay for an item is by C.O.D.= Cash On Delivery. Buy locally. Arrange a safe place to meet up and finish a transaction. Never pay using Western Union and other similar untraceable payment options. Consider an item sold only if a payment has been cleared and verified. No foreign checks, please. If an item can be shipped, always get it done via registered post.