Research article · Mar 2014
Research articlePublished Mar 2014
Graph Clustering and Feature Selection for High Dimensional Data
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
Feature selection techniques are used to select important items in the transactional data values. The features are used for the classification process. Clustering techniques are used for the feature selection process. Graph based clustering techniques are used to group up the transactional data with similarity values. Correlation similarity measures are used to identify the relevant and irrelevant features. Features And Subspace on Transactions (FAST) clustering-based feature selection algorithm is used to cluster the high dimensional data and feature selection process. FAST algorithm is divided into 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 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. Minimum-Spanning Tree (MST) clustering method is adopted to ensure the efficiency of FAST. Feature subset selection algorithm is used to identify the features from the clusters. The feature selection process is improved with a set of correlation measures. Dynamic feature intervals can be used to distinguish features. Redundant feature filtering mechanism is used to filter the similar features. Custom threshold is used to improve the cluster accuracy
Ask about this article
Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.
Similar by topic
Research article · Jan 2015
A Novel Collective Neighbor Clustering in High Dimensional Data
Research article · Dec 2014
Ant Possibilistic Fuzzy Clustered Forecasting on High Dimensional Data
Research article · Mar 2014
A Relevant Clustering Algorithm for High- Dimensional Data
Research article · Feb 2014
An Efficient Fast Clustering-Based Feature Subset Selection Algorithm for High- Dimensional Data
More from this journal
The newest in International Journal of Innovative Research in Computer and Communication Engineering.
Commentary · 2023
Computer Vision and Pattern Recognition
Commentary · 2023
Computer Network and Network Optimization
Perspective · 2023
Cloud Computing and Big Data Analysis
Conferences in this field
Upcoming conferences in this field.
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalInternational Journal of Innovative Research in Computer and Communication Engineering
- SubjectComputer Science & IT
- SubjectEngineering
- SubjectSocial Sciences & Humanities
- BylineArticles whose byline prints “K. Jaganath”
- BylineArticles whose byline prints “Mr. P. Sasikumar”
