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.

Feature selection in multimedia: The state-of-the-art review

2017 ◽  
Vol 67 ◽  
pp. 29-42 ◽  
Author(s):  
Pui Yi Lee ◽  
Wei Ping Loh ◽  
Jeng Feng Chin
Keyword(s):  
Feature Selection ◽  
State Of The Art ◽  
The State

scholarly journals Comparative Quality Estimation for Machine Translation Observations on Machine Learning and Features

2017 ◽  
Vol 108 (1) ◽  
pp. 307-318 ◽  
Author(s):  
Eleftherios Avramidis
Keyword(s):  
Machine Learning ◽  
Feature Selection ◽  
Machine Translation ◽  
State Of The Art ◽  
Linear Method ◽  
The State ◽  
Quality Estimation ◽  
Art Methods ◽  
Improved Performance

AbstractA deeper analysis on Comparative Quality Estimation is presented by extending the state-of-the-art methods with adequacy and grammatical features from other Quality Estimation tasks. The previously used linear method, unable to cope with the augmented features, is replaced with a boosting classifier assisted by feature selection. The methods indicated show improved performance for 6 language pairs, when applied on the output from MT systems developed over 7 years. The improved models compete better with reference-aware metrics.Notable conclusions are reached through the examination of the contribution of the features in the models, whereas it is possible to identify common MT errors that are captured by the features. Many grammatical/fluency features have a good contribution, few adequacy features have some contribution, whereas source complexity features are of no use. The importance of many fluency and adequacy features is language-specific.

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.

Benefiting feature selection by the discovery of false irrelevant attributes

2015 ◽  
Vol 13 (04) ◽  
pp. 1550023 ◽  
Author(s):  
Lidia S. Chao ◽  
Derek F. Wong ◽  
Philip C. L. Chen ◽  
Wing W. Y. Ng ◽  
Daniel S. Yeung
Keyword(s):  
Feature Selection ◽  
Execution Time ◽  
Classification Accuracy ◽  
State Of The Art ◽  
Classification Task ◽  
Selection Methods ◽  
Empirical Results ◽  
Selection Accuracy ◽  
Irrelevant Attributes ◽  
Selection Methodology

The ordinary feature selection methods select only the explicit relevant attributes by filtering the irrelevant ones. They trade the selection accuracy for the execution time and complexity. In which, the hidden supportive information possessed by the irrelevant attributes may be lost, so that they may miss some good combinations. We believe that attributes are useless regarding the classification task by themselves, sometimes may provide potentially useful supportive information to other attributes and thus benefit the classification task. Such a strategy can minimize the information lost, therefore is able to maximize the classification accuracy. Especially for the dataset contains hidden interactions among attributes. This paper proposes a feature selection methodology from a new angle that selects not only the relevant features, but also targeting at the potentially useful false irrelevant attributes by measuring their supportive importance to other attributes. The empirical results validate the hypothesis by demonstrating that the proposed approach outperforms most of the state-of-the-art filter based feature selection methods.

scholarly journals Support Vector Machine Based Feature Extraction For Gender Recognition From Objects Using Lasso Classifier

2020 ◽  
Author(s):  
Damodara Krishna Kishore Galla ◽  
BabuReddy Mukamalla ◽  
Rama Prakasha Reddy Chegireddy
Keyword(s):  
Support Vector Machine ◽  
Feature Selection ◽  
Face Recognition ◽  
Selection Process ◽  
Recognition System ◽  
Classification Model ◽  
Support Vector ◽  
Gender Classification ◽  
Accuracy Score ◽  
Lasso Regression

Abstract The blind people has their difficulty to identify the object moving around them, therefore with a high accuracy score object detection and human face recognition system will helps them in identifying the things around them with ease. Facial record images are immobile an difficult assignment for biometric authentication systems due to various types of characteristics are dimensions, pose, expressions, illustrations and age etc. In facial and other united images includes different objects classifications. In this research article, a minimum distance trainer for feature selection by accessing SVM feature optimization process. For feature selection process SVM (support vector machine) was considered for improving its feature interpretability and computational efficiency., then LASSO classifier applied to perform object recognition and gender classification. Original face image database used for the gender classification. This approach was implemented with dual classification model (1) Recognizing or classifying human faces from various objects and (2) Classifying gender through face recognition] is made possible with the help of combining modified SIFT feature in combination with ridge regression (RR), elastic net (EN), lasso regression(LR) and lasso regression with Gaussian Support Vector Machines (LRGS) based classification.

scholarly journals Guiding Attention in Sequence-to-Sequence Models for Dialogue Act Prediction

2020 ◽  
Vol 34 (05) ◽  
pp. 7594-7601
Author(s):  
Pierre Colombo ◽  
Emile Chapuis ◽  
Matteo Manica ◽  
Emmanuel Vignon ◽  
Giovanna Varni ◽  
...  
Keyword(s):  
Machine Translation ◽  
Random Fields ◽  
Conditional Random Fields ◽  
State Of The Art ◽  
The State ◽  
Attention Mechanism ◽  
Accuracy Score ◽  
Beam Search ◽  
Conversational Agents ◽  
Neural Machine Translation

The task of predicting dialog acts (DA) based on conversational dialog is a key component in the development of conversational agents. Accurately predicting DAs requires a precise modeling of both the conversation and the global tag dependencies. We leverage seq2seq approaches widely adopted in Neural Machine Translation (NMT) to improve the modelling of tag sequentiality. Seq2seq models are known to learn complex global dependencies while currently proposed approaches using linear conditional random fields (CRF) only model local tag dependencies. In this work, we introduce a seq2seq model tailored for DA classification using: a hierarchical encoder, a novel guided attention mechanism and beam search applied to both training and inference. Compared to the state of the art our model does not require handcrafted features and is trained end-to-end. Furthermore, the proposed approach achieves an unmatched accuracy score of 85% on SwDA, and state-of-the-art accuracy score of 91.6% on MRDA.

A Systematic Study of Feature Selection Methods for Learning to Rank Algorithms

2018 ◽  
Vol 8 (3) ◽  
pp. 46-67 ◽  
Author(s):  
Mehrnoush Barani Shirzad ◽  
Mohammad Reza Keyvanpour
Keyword(s):  
Feature Selection ◽  
State Of The Art ◽  
Learning To Rank ◽  
Future Research ◽  
Selection Methods ◽  
Ranking Models ◽  
Ranking Systems ◽  
Efficiency And Effectiveness ◽  
Selection For

This article describes how feature selection for learning to rank algorithms has become an interesting issue. While noisy and irrelevant features influence performance, and result in an overfitting problem in ranking systems, reducing the number of features by illuminating irrelevant and noisy features is a solution. Several studies have applied feature selection for learning to rank, which promote efficiency and effectiveness of ranking models. As the number of features and consequently the number of irrelevant and noisy features is increasing, systematic a review of Feature selection for learning to rank methods is required. In this article, a framework to examine research on feature selection for learning to rank (FSLR) is proposed. Under this framework, the authors review the most state-of-the-art methods and suggest several criteria to analyze them. FSLR offers a structured classification of current algorithms for future research to: a) properly select strategies from existing algorithms using certain criteria or b) to find ways to develop existing methodologies.

Unsupervised authorship attribution using feature selection and weighted cosine similarity

2021 ◽  
pp. 1-11
Author(s):  
Carolina Martín-del-Campo-Rodríguez ◽  
Grigori Sidorov ◽  
Ildar Batyrshin
Keyword(s):  
Machine Learning ◽  
Feature Selection ◽  
Computational Model ◽  
Clustering Algorithm ◽  
State Of The Art ◽  
Extraction Methods ◽  
Cosine Similarity ◽  
Authorship Attribution ◽  
Selection Methods ◽  
Cosine Similarity Measure

This paper presents a computational model for the unsupervised authorship attribution task based on a traditional machine learning scheme. An improvement over the state of the art is achieved by comparing different feature selection methods on the PAN17 author clustering dataset. To achieve this improvement, specific pre-processing and features extraction methods were proposed, such as a method to separate tokens by type to assign them to only one category. Similarly, special characters are used as part of the punctuation marks to improve the result obtained when applying typed character n-grams. The Weighted cosine similarity measure is applied to improve the B 3 F-score by reducing the vector values where attributes are exclusive. This measure is used to define distances between documents, which later are occupied by the clustering algorithm to perform authorship attribution.

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.

scholarly journals Multi-Label Feature Selection Based on High-Order Label Correlation Assumption

Entropy ◽  
2020 ◽  
Vol 22 (7) ◽  
pp. 797
Author(s):  
Ping Zhang ◽  
Wanfu Gao ◽  
Juncheng Hu ◽  
Yonghao Li
Keyword(s):  
Feature Selection ◽  
State Of The Art ◽  
Classification Performance ◽  
High Order ◽  
Selection Methods ◽  
Label Data ◽  
Cumulative Summation ◽  
Label Correlations ◽  
Classification Information ◽  
Correlation Term

Multi-label data often involve features with high dimensionality and complicated label correlations, resulting in a great challenge for multi-label learning. Feature selection plays an important role in multi-label learning to address multi-label data. Exploring label correlations is crucial for multi-label feature selection. Previous information-theoretical-based methods employ the strategy of cumulative summation approximation to evaluate candidate features, which merely considers low-order label correlations. In fact, there exist high-order label correlations in label set, labels naturally cluster into several groups, similar labels intend to cluster into the same group, different labels belong to different groups. However, the strategy of cumulative summation approximation tends to select the features related to the groups containing more labels while ignoring the classification information of groups containing less labels. Therefore, many features related to similar labels are selected, which leads to poor classification performance. To this end, Max-Correlation term considering high-order label correlations is proposed. Additionally, we combine the Max-Correlation term with feature redundancy term to ensure that selected features are relevant to different label groups. Finally, a new method named Multi-label Feature Selection considering Max-Correlation (MCMFS) is proposed. Experimental results demonstrate the classification superiority of MCMFS in comparison to eight state-of-the-art multi-label feature selection methods.

Sign in / Sign up

Export Citation Format

Share Document