• No results found

high dimensional feature sets

Feature Subset Selection using Rough Sets for High Dimensional Data

Feature Subset Selection using Rough Sets for High Dimensional Data

... Correlation-based Feature subset Selection (CFS) [7], Fast Correlation-Based Filter (FCBF) [9], and Conditional Mutual Information Maximization (CMIM)[8] are examples that take into consideration the redundant ...

5

1.
													Optimal feature selection algorithm for high  dimensional data sets using particle swarm optimization

1. Optimal feature selection algorithm for high dimensional data sets using particle swarm optimization

... In this section the performance of our FMI-PSO algorithm is compared with the existing FCBF algorithm using four different data sets (LC, CTG,ORL and COLON). LC data set contains multivariate data set about lung ...

12

FEATURE SELECTION BOOSTER ALGORITHM FOR HIGH DIMENSIONAL DATA CLASSIFICATION

FEATURE SELECTION BOOSTER ALGORITHM FOR HIGH DIMENSIONAL DATA CLASSIFICATION

... a high dimensional data, though there are many classification problems and a feature selection (FS) algorithm has been developed in the past two ...decades. Feature selection algorithm results ...

11

Feature Subset Selection for High Dimensional Data using Clustering Techniques

Feature Subset Selection for High Dimensional Data using Clustering Techniques

... data sets process of identifying patterns through computational process involving methods at the intersection of artificial intelligence, machine learning, statistics and database system ...

7

Feature Subset Selection for High Dimensional Data Using Clustering Techniques

Feature Subset Selection for High Dimensional Data Using Clustering Techniques

... data sets involving methods at the intersection of artificial intelligence, machine learning, statistics and database system ...by high intra-cluster similarity and ...

7

A Framework To Integrate Feature Selection Algorithm For Classification Of  High Dimensional Data

A Framework To Integrate Feature Selection Algorithm For Classification Of High Dimensional Data

... and high-dimensional ...this high-dimensional unsupervised function choice stays a tough task due to the absence of label facts based on which feature relevance is frequently ...

7

A Survey on Clustered Feature Selection
          Algorithms for High Dimensional Data

A Survey on Clustered Feature Selection Algorithms for High Dimensional Data

... filter feature selection methods, the application of cluster analysis clearly give practical demonstration and explanation to be more effective than traditional feature selection ...the high ...

7

Neighborhood Component Feature Selection for High-Dimensional Data

Neighborhood Component Feature Selection for High-Dimensional Data

... neighbor-based feature weighting meth- ods, including RELIEF [7], Simba [8], RGS [9], I- RELIEF [10], LMFW [11], Lmba [12] and FSSun [13], have been successfully developed and shown the better performance on ...

8

Neighborhood Component Feature Selection for High-Dimensional Data

Neighborhood Component Feature Selection for High-Dimensional Data

... Four different types of classification algorithms are employed to classify data sets before and after feature selection. They are (i) the probability-based Naive Bayes (NB), (ii) the tree-based C4.5, (iii) ...

5

Title: A Framework for Mining High Dimensional Data for Feature Subset Selection

Title: A Framework for Mining High Dimensional Data for Feature Subset Selection

... data sets. Identifying such fetures in a high dimensional dataset play an important role in real world ...such feature subset and selection is a challenging ...

6

Dynamic Feature Induction: The Last Gist to the State of the Art

Dynamic Feature Induction: The Last Gist to the State of the Art

... development sets (Sections ...to feature group- ing, which has been shown to be beneficial in learn- ing high-dimensional data (Zhong and Kwok, 2011; Suzuki and Nagata, ...

11

CLUSTERING BASED FEATURE SELECTION AND IDENTIFICATION OF SUBSET FOR HIGH DIMENSIONAL DATA

CLUSTERING BASED FEATURE SELECTION AND IDENTIFICATION OF SUBSET FOR HIGH DIMENSIONAL DATA

... data sets and to deal with multi-class problems, but fails to identify redundant ...good feature subset is one that contains features highly correlated with the target, yet uncorrelated with each ...

5

Improving Efficiency In High Dimensional Data Sets

Improving Efficiency In High Dimensional Data Sets

... as feature selection. Without feature selection [1] there is no work done on the ...the feature are checked with the already existing features and fulfills the ...

6

Feature Selection for Small Sample Sets with High Dimensional Data Using Heuristic Hybrid Approach

Feature Selection for Small Sample Sets with High Dimensional Data Using Heuristic Hybrid Approach

... hybrid feature selection approach is ...sample sets with high dimensional data where traditional methods are not ...with high cross-correlation, all of them except one will be ...a ...

8

Hadoop neural network for parallel and distributed feature selection

Hadoop neural network for parallel and distributed feature selection

... MI feature se- lector was over 100 times faster than a standard implementation (Hodge et ...of feature selectors on large and high dimensional data sets that cannot be processed on ...

13

A Review Paper on Feature Selection Methodologies and Their Applications

A Review Paper on Feature Selection Methodologies and Their Applications

... Sentiment analysis is capturing favorability using natural language processing. It is not just a topic based categorization. It deals with the computational treatment of opinion, sentiment, and subjectivity in text. It ...

5

Predicting Specificity in Classroom Discussion

Predicting Specificity in Classroom Discussion

... den state of the LSTM unit at the end of the turn at talk as embedding, feeding it to a soft- max classifier for predicting specificity, and back- propagating errors. Cross-entropy was used as the objective function to ...

10

Detecting Outliers in High Dimensional Data Sets using Z Score Methodology

Detecting Outliers in High Dimensional Data Sets using Z Score Methodology

... Timothy de Vries et al. [2] projected an innovative methodology called Projection Indexed Nearest Neighbors (PINN) and calculating the extended nearest neighbor sets to get precise value in KNN distances. They ...

6

Recurrent Kalman networks:factorized inference in high dimensional deep feature spaces

Recurrent Kalman networks:factorized inference in high dimensional deep feature spaces

... a high-dimensional fac- torized latent state representation for which the Kalman updates simplify to scalar operations and thus avoids hard to backpropagate, computation- ally heavy and potentially unstable ...

9

Scrutable Feature Sets for Stance Classification

Scrutable Feature Sets for Stance Classification

... novel feature set for stance classifica- tion of argumentative texts; ...our feature set is that it is scrutable: The reasons for a classifica- tion can be explained to a human user in natural ...

10

Show all 10000 documents...

Related subjects