scholarly journals Optimizing the Feature Selection Process for Better Accuracy in Datasets with a Large Number of Features (Student Abstract)

2020 ◽  
Vol 34 (10) ◽  
pp. 13767-13768
Author(s):  
Xi Chen ◽  
Afsaneh Doryab
Keyword(s):  
Feature Selection ◽  
Experimental Evaluation ◽  
Selection Process ◽  
High Accuracy ◽  
Frequent Pattern ◽  
Selection Methods ◽  
Feature Sets ◽  
Novel Approach ◽  
Data Points ◽  
Small Set

Most feature selection methods only perform well on datasets with relatively small set of features. In the case of large feature sets and small number of data points, almost none of the existing feature selection methods help in achieving high accuracy. This paper proposes a novel approach to optimize the feature selection process through Frequent Pattern Growth algorithm to find sets of features that appear frequently among the top features selected by the main feature selection methods. Our experimental evaluation on two datasets containing a small and very large number of features shows that our approach significantly improves the accuracy results of the dataset with a very large number of features.

scholarly journals A Unified View of Causal and Non-causal Feature Selection

2021 ◽  
Vol 15 (4) ◽  
pp. 1-46
Author(s):  
Kui Yu ◽  
Lin Liu ◽  
Jiuyong Li
Keyword(s):  
Feature Selection ◽  
Bayesian Network ◽  
Synthetic Data ◽  
Selection Methods ◽  
Bayesian Network Model ◽  
Real World Data ◽  
Feature Sets ◽  
Unified View ◽  
Optimal Feature ◽  
Different Levels

In this article, we aim to develop a unified view of causal and non-causal feature selection methods. The unified view will fill in the gap in the research of the relation between the two types of methods. Based on the Bayesian network framework and information theory, we first show that causal and non-causal feature selection methods share the same objective. That is to find the Markov blanket of a class attribute, the theoretically optimal feature set for classification. We then examine the assumptions made by causal and non-causal feature selection methods when searching for the optimal feature set, and unify the assumptions by mapping them to the restrictions on the structure of the Bayesian network model of the studied problem. We further analyze in detail how the structural assumptions lead to the different levels of approximations employed by the methods in their search, which then result in the approximations in the feature sets found by the methods with respect to the optimal feature set. With the unified view, we can interpret the output of non-causal methods from a causal perspective and derive the error bounds of both types of methods. Finally, we present practical understanding of the relation between causal and non-causal methods using extensive experiments with synthetic data and various types of real-world data.

scholarly journals Incorporating Pathway Information into Feature Selection towards Better Performed Gene Signatures

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Suyan Tian ◽  
Chi Wang ◽  
Bing Wang
Keyword(s):  
Gene Expression ◽  
Feature Selection ◽  
Gene Expression Data ◽  
Gene Selection ◽  
Selection Process ◽  
Biological Knowledge ◽  
Expression Data ◽  
Selection Methods ◽  
Its Gene ◽  
Active Research

To analyze gene expression data with sophisticated grouping structures and to extract hidden patterns from such data, feature selection is of critical importance. It is well known that genes do not function in isolation but rather work together within various metabolic, regulatory, and signaling pathways. If the biological knowledge contained within these pathways is taken into account, the resulting method is a pathway-based algorithm. Studies have demonstrated that a pathway-based method usually outperforms its gene-based counterpart in which no biological knowledge is considered. In this article, a pathway-based feature selection is firstly divided into three major categories, namely, pathway-level selection, bilevel selection, and pathway-guided gene selection. With bilevel selection methods being regarded as a special case of pathway-guided gene selection process, we discuss pathway-guided gene selection methods in detail and the importance of penalization in such methods. Last, we point out the potential utilizations of pathway-guided gene selection in one active research avenue, namely, to analyze longitudinal gene expression data. We believe this article provides valuable insights for computational biologists and biostatisticians so that they can make biology more computable.

scholarly journals CUR: Group Profiling with Community-based Users’ Representation

2018 ◽  
Author(s):  
João Emanoel Ambrósio Gomes ◽  
Ricardo B. C. Prudêncio ◽  
André C. A. Nascimento
Keyword(s):  
Feature Selection ◽  
Relevant Feature ◽  
Selection Methods ◽  
Community Based ◽  
Feature Sets ◽  
Network Community ◽  
Representation Method ◽  
Selection Algorithms ◽  
Content Information ◽  
Better Than

Group profiling methods aim to construct a descriptive profile for communities in social networks. Before the application of a profiling algorithm, it is necessary to collect and preprocess the users’ content information, i.e., to build a representation of each user in the network. Usually, existing group profiling strategies define the users’ representation by uniformly processing the entire content information in the network, and then, apply traditional feature selection methods over the user features in a group. However, such strategy may ignore specific characteristics of each group. This fact can lead to a limited representation for some communities, disregarding attributes which are relevant to the network perspective and describing more clearly a particular community despite the others. In this context, we propose the community-based user’s representation method (CUR). In this proposal, feature selection algorithms are applied over user features for each network community individually, aiming to assign relevant feature sets for each particular community. Such strategy will avoid the bias caused by larger communities on the overall user representation. Experiments were conducted in a co-authorship network to evaluate the CUR representation on different group profiling strategies and were assessed by hu- man evaluators. The results showed that profiles obtained after the application of the CUR module were better than the ones obtained by conventional users’ representation on an average of 76.54% of the evaluations.

scholarly journals Demand Forecasting for a Mixed-Use Building Using Agent-Schedule Information with a Data-Driven Model

Energies ◽  
2020 ◽  
Vol 13 (4) ◽  
pp. 780 ◽  
Author(s):  
Zihao Li ◽  
Daniel Friedrich ◽  
Gareth P. Harrison
Keyword(s):  
Feature Selection ◽  
Energy Consumption ◽  
Selection Process ◽  
Demand Forecasting ◽  
Electricity Demand ◽  
Data Driven ◽  
Feature Sets ◽  
Demand Prediction ◽  
Heat Demand ◽  
Mixed Use

There is great interest in data-driven modelling for the forecasting of building energy consumption while using machine learning (ML) modelling. However, little research considers classification-based ML models. This paper compares the regression and classification ML models for daily electricity and thermal load modelling in a large, mixed-use, university building. The independent feature variables of the model include outdoor temperature, historical energy consumption data sets, and several types of ‘agent schedules’ that provide proxy information that is based on broad classes of activity undertaken by the building’s inhabitants. The case study compares four different ML models testing three different feature sets with a genetic algorithm (GA) used to optimize the feature sets for those ML models without an embedded feature selection process. The results show that the regression models perform significantly better than classification models for the prediction of electricity demand and slightly better for the prediction of heat demand. The GA feature selection improves the performance of all models and demonstrates that historical heat demand, temperature, and the ‘agent schedules’, which derive from large occupancy fluctuations in the building, are the main factors influencing the heat demand prediction. For electricity demand prediction, feature selection picks almost all ‘agent schedule’ features that are available and the historical electricity demand. Historical heat demand is not picked as a feature for electricity demand prediction by the GA feature selection and vice versa. However, the exclusion of historical heat/electricity demand from the selected features significantly reduces the performance of the demand prediction.

Enhanced Filter Feature Selection Methods for Arabic Text Categorization

2018 ◽  
Vol 8 (2) ◽  
pp. 1-24 ◽  
Author(s):  
Abdullah Saeed Ghareb ◽  
Azuraliza Abu Bakara ◽  
Qasem A. Al-Radaideh ◽  
Abdul Razak Hamdan
Keyword(s):  
Feature Selection ◽  
Text Categorization ◽  
Selection Process ◽  
High Dimensional Data ◽  
Relevant Information ◽  
High Dimensional ◽  
Arabic Text ◽  
Relevant Feature ◽  
Associative Classification ◽  
Selection Methods

The filtering of a large amount of data is an important process in data mining tasks, particularly for the categorization of unstructured high dimensional data. Therefore, a feature selection process is desired to reduce the space of high dimensional data into small relevant subset dimensions that represent the best features for text categorization. In this article, three enhanced filter feature selection methods, Category Relevant Feature Measure, Modified Category Discriminated Measure, and Odd Ratio2, are proposed. These methods combine the relevant information about features in both the inter- and intra-category. The effectiveness of the proposed methods with Naïve Bayes and associative classification is evaluated by traditional measures of text categorization, namely, macro-averaging of precision, recall, and F-measure. Experiments are conducted on three Arabic text datasets used for text categorization. The experimental results showed that the proposed methods are able to achieve better and comparable results when compared to 12 well known traditional methods.

Fake News detection using n-grams for PAN@CLEF competition

2021 ◽  
pp. 1-8
Author(s):  
Sergio Damian ◽  
Hiram Calvo ◽  
Alexander Gelbukh
Keyword(s):  
Feature Selection ◽  
State Of The Art ◽  
Selection Process ◽  
The State ◽  
Accuracy Score ◽  
Fake News ◽  
Selection Methods ◽  
Solution Approach ◽  
Explainable Artificial Intelligence ◽  
Relevant Topic

The paper presents a classifier for fake news spreaders detection in social media. Detecting fake news spreaders is an important task because this kind of disinformation aims to change the reader’s opinion about a relevant topic for the society. This work presents a classifier that can compete with the ones that are found in the state-of-the-art. In addition, this work applies Explainable Artificial Intelligence (XIA) methods in order to understand the corpora used and how the model estimates results. The work focuses on the corpora developed by members of the PAN@CLEF 2020 competition. The score obtained surpasses the state-of-the-art with a mean accuracy score of 0.7825. The solution uses XIA methods for the feature selection process, since they present more stability to the selection than most of traditional feature selection methods. Also, this work concludes that the detection done by the solution approach is generally based on the topic of the text.

scholarly journals Return of the features

2018 ◽  
Vol 616 ◽  
pp. A97 ◽  
Author(s):  
A. D’Isanto ◽  
S. Cavuoti ◽  
F. Gieseke ◽  
K. L. Polsterer
Keyword(s):  
Machine Learning ◽  
Feature Selection ◽  
Selection Process ◽  
Sloan Digital Sky Survey ◽  
Learning Models ◽  
Classification Problems ◽  
Forward Selection ◽  
Feature Sets ◽  
Physical Context ◽  
Machine Learning Models

Context. The explosion of data in recent years has generated an increasing need for new analysis techniques in order to extract knowledge from massive data-sets. Machine learning has proved particularly useful to perform this task. Fully automatized methods (e.g. deep neural networks) have recently gathered great popularity, even though those methods often lack physical interpretability. In contrast, feature based approaches can provide both well-performing models and understandable causalities with respect to the correlations found between features and physical processes. Aims. Efficient feature selection is an essential tool to boost the performance of machine learning models. In this work, we propose a forward selection method in order to compute, evaluate, and characterize better performing features for regression and classification problems. Given the importance of photometric redshift estimation, we adopt it as our case study. Methods. We synthetically created 4520 features by combining magnitudes, errors, radii, and ellipticities of quasars, taken from the Sloan Digital Sky Survey (SDSS). We apply a forward selection process, a recursive method in which a huge number of feature sets is tested through a k-Nearest-Neighbours algorithm, leading to a tree of feature sets. The branches of the feature tree are then used to perform experiments with the random forest, in order to validate the best set with an alternative model. Results. We demonstrate that the sets of features determined with our approach improve the performances of the regression models significantly when compared to the performance of the classic features from the literature. The found features are unexpected and surprising, being very different from the classic features. Therefore, a method to interpret some of the found features in a physical context is presented. Conclusions. The feature selection methodology described here is very general and can be used to improve the performance of machine learning models for any regression or classification task.

Multi-objective Cuckoo Search-based Streaming Feature Selection for Multi-label Dataset

2021 ◽  
Vol 15 (6) ◽  
pp. 1-24
Author(s):  
Dipanjyoti Paul ◽  
Rahul Kumar ◽  
Sriparna Saha ◽  
Jimson Mathew
Keyword(s):  
Feature Selection ◽  
Selection Process ◽  
Dimensional Space ◽  
Continuous Process ◽  
Feature Selection Method ◽  
Cuckoo Search ◽  
Selection Method ◽  
Selection Methods ◽  
Multi Objective ◽  
Social Media Networks

The feature selection method is the process of selecting only relevant features by removing irrelevant or redundant features amongst the large number of features that are used to represent data. Nowadays, many application domains especially social media networks, generate new features continuously at different time stamps. In such a scenario, when the features are arriving in an online fashion, to cope up with the continuous arrival of features, the selection task must also have to be a continuous process. Therefore, the streaming feature selection based approach has to be incorporated, i.e., every time a new feature or a group of features arrives, the feature selection process has to be invoked. Again, in recent years, there are many application domains that generate data where samples may belong to more than one classes called multi-label dataset. The multiple labels that the instances are being associated with, may have some dependencies amongst themselves. Finding the co-relation amongst the class labels helps to select the discriminative features across multiple labels. In this article, we develop streaming feature selection methods for multi-label data where the multiple labels are reduced to a lower-dimensional space. The similar labels are grouped together before performing the selection method to improve the selection quality and to make the model time efficient. The multi-objective version of the cuckoo search-based approach is used to select the optimal feature set. The proposed method develops two versions of the streaming feature selection method: ) when the features arrive individually and ) when the features arrive in the form of a batch. Various multi-label datasets from various domains such as text, biology, and audio have been used to test the developed streaming feature selection methods. The proposed methods are compared with many previous feature selection methods and from the comparison, the superiority of using multiple objectives and label co-relation in the feature selection process can be established.

scholarly journals Comparative Study of Microarray Based Disease Prediction - A Survey

2019 ◽  
pp. 189-197
Author(s):  
T. Sneka ◽  
K. Palanivel
Keyword(s):  
Feature Selection ◽  
Selection Process ◽  
Genetic Diseases ◽  
Noisy Data ◽  
High Dimensional ◽  
Disease Prediction ◽  
Selection Methods ◽  
Classification Techniques ◽  
Clustering And Classification ◽  
Supervised Methods

Recognition of genetic expression becomes an important issue for research while diagnosing genetic diseases. Microarrays are considered as the representation for identifying gene behaviors that may help in detection process. Hence, it is used in analyzing samples that may be normal or affected, also in diagnosing various gene-based diseases. Various clustering and classification techniques were used to face the challenges in handling microarray. High dimensional data is one of the major issues caused while handling microarray. Also because of this issue, possibilities of redundant, irrelevant and noisy data may occur. To solve this problem feature selection process which optimally extracts the features is introduced in clustering in classification techniques. This survey observes some various techniques of classification, clustering of genes and feature selection methods such as supervised, unsupervised and semi-supervised methods. To determine the suitable semi-supervised algorithm that combines and analyze for detecting new or difficult mutated disease. This survey shows that how semi-supervised approach evolves and outperforms the existing algorithms.

Sign in / Sign up

Export Citation Format

Share Document