2021 Fifth International Conference On Intelligent Computing in Data Sciences (ICDS)最新文献

筛选
英文 中文
Feature selection based on attributes clustering 基于属性聚类的特征选择
2021 Fifth International Conference On Intelligent Computing in Data Sciences (ICDS) Pub Date : 2021-10-20 DOI: 10.1109/ICDS53782.2021.9626770
Youssef Asnaoui, Yassine Akhiat, Ahmed Zinedine
{"title":"Feature selection based on attributes clustering","authors":"Youssef Asnaoui, Yassine Akhiat, Ahmed Zinedine","doi":"10.1109/ICDS53782.2021.9626770","DOIUrl":"https://doi.org/10.1109/ICDS53782.2021.9626770","url":null,"abstract":"Feature selection is an important preprocessing step in machine learning; it aims to remove redundant and irrelevant features, improve the efficiency of machine-learning algorithms, and increase the model’s interpretability. In this paper, we proposed a new feature selection algorithm based on attributes clustering. Our method consists of two main steps. In the first step, we separate all attributes into K groups (clusters). The next step consists of choosing the best subset of features from the clusters. The performance of the proposed method is evaluated on seven standard benchmark datasets from the UCI repository.","PeriodicalId":351746,"journal":{"name":"2021 Fifth International Conference On Intelligent Computing in Data Sciences (ICDS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130760548","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Towards a Blockchain based Intelligent and Secure Voting
2021 Fifth International Conference On Intelligent Computing in Data Sciences (ICDS) Pub Date : 2021-10-20 DOI: 10.1109/ICDS53782.2021.9626751
Asmae El Fezzazi, Amina Adadi, M. Berrada
{"title":"Towards a Blockchain based Intelligent and Secure Voting","authors":"Asmae El Fezzazi, Amina Adadi, M. Berrada","doi":"10.1109/ICDS53782.2021.9626751","DOIUrl":"https://doi.org/10.1109/ICDS53782.2021.9626751","url":null,"abstract":"Blockchain and machine learning (ML) have emerged as two disruptive technologies that could transform various sectors. Blockchain is known as peer to peer decentralized, distributed ledger technology that enables to store and exchange anything of value, it is deterministic, permanent and immutable. On the other hand, ML is the ability of computers to learn without being programmed, and it is probabilistic. Hence, when blockchain and ML converge, they surely would benefit from each other. Blockchain can enhance security of ML platforms, and ML can provide automation and optimization to the blockchain solutions. In this work, we advocate the importance of enhancing blockchain with ML algorithms, as a proof of principle we address the issue of secure and intelligent e-voting.The use of blockchain technology has brought tremendous different application domains, e-voting is one of them. Most existing e-Voting systems require central authority during the process of authentication and verification of the voter. In this paper we propose a safe online voting approach based on blockchain and ML to provide a solution to this issue. We use blockchain to ensure integrity and transparency of the votes, and ML for automating the verification process of eligible voters based on AI-powered oracle platform for face authentication. The proposed solution offers automation, security, and mobility to the voting system.","PeriodicalId":351746,"journal":{"name":"2021 Fifth International Conference On Intelligent Computing in Data Sciences (ICDS)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130771332","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Acceptance and Rejection Zones for a Classifier’s Predictions in Deep Learning 深度学习中分类器预测的接受区和拒绝区
2021 Fifth International Conference On Intelligent Computing in Data Sciences (ICDS) Pub Date : 2021-10-20 DOI: 10.1109/ICDS53782.2021.9626739
A. Samake, L. Boulmane
{"title":"Acceptance and Rejection Zones for a Classifier’s Predictions in Deep Learning","authors":"A. Samake, L. Boulmane","doi":"10.1109/ICDS53782.2021.9626739","DOIUrl":"https://doi.org/10.1109/ICDS53782.2021.9626739","url":null,"abstract":"A big challenge in deep learning is to estimate the reliability of a classifier’s predictions. In this paper, we propose to approach this problem through the concept of acceptance, rejection and abstain zones. Given a new example, a reliability score is defined from the cosine similarities between the activation values of the model output layer and those of its correct and incorrect predictions on the test set. The corresponding zone to a prediction is determined by its reliability score. Then the prediction is accepted, for the acceptance zone. Otherwise it is rejected for the reject zone and not considered for the abstain zone. In order to empirically examine our proposition, we carried out a case study in text classification. The results obtained show the relevance of the proposed approach.","PeriodicalId":351746,"journal":{"name":"2021 Fifth International Conference On Intelligent Computing in Data Sciences (ICDS)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114592728","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
An effective modified possibilistic Fuzzy C-Means clustering algorithm for noisy data problems 一种有效的改进可能性模糊c均值聚类算法
2021 Fifth International Conference On Intelligent Computing in Data Sciences (ICDS) Pub Date : 2021-10-20 DOI: 10.1109/ICDS53782.2021.9626706
Souad Azzouzi, J. EL-Mekkaoui, A. Hjouji, A. E. Khalfi
{"title":"An effective modified possibilistic Fuzzy C-Means clustering algorithm for noisy data problems","authors":"Souad Azzouzi, J. EL-Mekkaoui, A. Hjouji, A. E. Khalfi","doi":"10.1109/ICDS53782.2021.9626706","DOIUrl":"https://doi.org/10.1109/ICDS53782.2021.9626706","url":null,"abstract":"Clustering is a machine learning method that consists in grouping data points by similarity. Different Fuzzy C-Means clustering algorithms have been proposed, for example FCM, PCM, PFCM, most of those algorithms encounter several problems like choice of the adequate distance, efficiency against noise and outliers. In this study, we propose a new robust algorithm named Modified Possibilistic Fuzzy C-Means algorithm (MPFCM) based on possibilistic approach, which improves PFCM algorithm and overcomes those shortcomings. MPFCM is an extension of PFCM algorithm. Furthermore, the MPFCM allows to use more sophisticated norms for different complex problems. In another hand, MPFCM detects cluster centers more accurately in noisy data environment and with nonlinearly separable input data space. Experiments and results showed the effectiveness of our proposed algorithm MPFCM.","PeriodicalId":351746,"journal":{"name":"2021 Fifth International Conference On Intelligent Computing in Data Sciences (ICDS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116753097","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Filter design for two-dimensional discrete-time T-S fuzzy systems described by FM LSS model 用FM LSS模型描述二维离散T-S模糊系统的滤波器设计
2021 Fifth International Conference On Intelligent Computing in Data Sciences (ICDS) Pub Date : 2021-10-20 DOI: 10.1109/ICDS53782.2021.9626748
R. Chakib, A. El‐Amrani
{"title":"Filter design for two-dimensional discrete-time T-S fuzzy systems described by FM LSS model","authors":"R. Chakib, A. El‐Amrani","doi":"10.1109/ICDS53782.2021.9626748","DOIUrl":"https://doi.org/10.1109/ICDS53782.2021.9626748","url":null,"abstract":"This our work is concerned with the problem of filter design in two-dimensional (2D) discrete-time non-linear systems in Takagi-Sugeno (T-S) fuzzy model described by Fornasini-Marchesini local state-space (FM LSS) Model. The problem to be solved in the paper is to find a $H_{infty}$ filter model such that the filtering error system is asymptotically stable and has a reduced $H_{infty}$ performance index. Via the use of the Lyapunov functions approach and parameterize slack matrices, new design conditions guaranteeing the $H_{infty}$ T-S fuzzy filter method of FM LSS model are developed by solving linear matrix inequalities (LMIs). At last, the simulation results are provided to show the effectiveness and the validity of the proposed T-S fuzzy of FM LSS model strategy by a practical application has been made.","PeriodicalId":351746,"journal":{"name":"2021 Fifth International Conference On Intelligent Computing in Data Sciences (ICDS)","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115437326","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Facial expression recognition Using Machine Learning 使用机器学习进行面部表情识别
2021 Fifth International Conference On Intelligent Computing in Data Sciences (ICDS) Pub Date : 2021-10-20 DOI: 10.1109/ICDS53782.2021.9626709
Hajar Chouhayebi, J. Riffi, Mohamed Adnane Mahraz, Ali Yahyaouy, H. Tairi
{"title":"Facial expression recognition Using Machine Learning","authors":"Hajar Chouhayebi, J. Riffi, Mohamed Adnane Mahraz, Ali Yahyaouy, H. Tairi","doi":"10.1109/ICDS53782.2021.9626709","DOIUrl":"https://doi.org/10.1109/ICDS53782.2021.9626709","url":null,"abstract":"Facial expression recognition (FER) plays an important role in computer vision. In this paper, we compare the result of two proposed methods of representing Facial landmarks detection and Feature Extraction. The first method is based on image processing (for example, histogram equalization, thresholding, color conversion, morphological operations, etc.) and the second one used the Dlib library to detect facial landmarks. We examine each feature descriptor by considering two classifications methods such as Support Vector Machine (SVM) and the Multi-layer Perceptron (MLP) with three facial expression databases(10k US Adult Faces Database, the MUG Facial Expression and personal database) to classified three different facial expressions: happiness, surprise and neutrality.The Experimental results demonstrate that the first proposed method shows 91.5% accuracy and more than 96% accuracy for the second method.","PeriodicalId":351746,"journal":{"name":"2021 Fifth International Conference On Intelligent Computing in Data Sciences (ICDS)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124798649","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Sentiment-Based Neural Network Approach for Predicting the Severity of Bug Reports 基于情绪的预测Bug报告严重性的神经网络方法
2021 Fifth International Conference On Intelligent Computing in Data Sciences (ICDS) Pub Date : 2021-10-20 DOI: 10.1109/ICDS53782.2021.9626730
A. Baarah, Ahmad Aloqaily, Hala Zyod, Nasser Mustafa
{"title":"Sentiment-Based Neural Network Approach for Predicting the Severity of Bug Reports","authors":"A. Baarah, Ahmad Aloqaily, Hala Zyod, Nasser Mustafa","doi":"10.1109/ICDS53782.2021.9626730","DOIUrl":"https://doi.org/10.1109/ICDS53782.2021.9626730","url":null,"abstract":"During the software maintenance process, bugs encountered by software users need to be solved according to their severity level to improve the quality of the software. Therefore, bug reports with high severity should have the highest priority to be fixed. A numerous number of bug reports are submitted daily through Bug Tracking Systems (BTS) such as Bugzilla. The bug triager examines the incoming bug reports manually and verifies whether the assigned severity level is correct or not. This manual process is time-consuming, requires much effort and is possibly error-prone. However, a limited number of research works have considered the sentiments of the bug reporters in predicting the severity of bug reports. This paper proposes two approaches based on sentiment analysis, the Lexicon-based and Multilayer Perceptron (MLP) neural network approaches. The sentiment analysis process determines and measures the sentiment words and their sentiment scores according to the popular sentiment lexicon called SentiWordNet. The proposed approaches are validated on the Eclipse open-source project, and the sentiment-based models performance is evaluated. According to the experimental results, the sentiment-based MLP outperforms the Lexicon-based approach (baseline approach). The F-measure has been improved significantly from 0.52 for the Lexicon-based approach to 0.81 when applying the MLP approach.","PeriodicalId":351746,"journal":{"name":"2021 Fifth International Conference On Intelligent Computing in Data Sciences (ICDS)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130839549","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Arabic handwritten text line segmentation using a multi-agent system and a directed CNN 使用多智能体系统和有向CNN的阿拉伯手写文本线分割
2021 Fifth International Conference On Intelligent Computing in Data Sciences (ICDS) Pub Date : 2021-10-20 DOI: 10.1109/ICDS53782.2021.9626747
Mohsine Elkhayati, Y. Elkettani
{"title":"Arabic handwritten text line segmentation using a multi-agent system and a directed CNN","authors":"Mohsine Elkhayati, Y. Elkettani","doi":"10.1109/ICDS53782.2021.9626747","DOIUrl":"https://doi.org/10.1109/ICDS53782.2021.9626747","url":null,"abstract":"Segmentation of text lines is a critical phase in Arabic handwriting recognition systems. Incorrect line segmentation generates errors in later phases, leading to total changes in the meaning of the text. Line segmentation in printed Arabic documents is an easier task compared to handwritten ones. Segmentation of lines from Arabic handwriting is difficult due to many challenging issues including overlaps, touches, skew/tilt in lines, diacritics, etc. To implement this phase, this paper proposes a robust approach (A2) that is based on a multi-agent system and Convolutional Neural Networks (CNN). The proposed approach is an enhanced version of the approach proposed in [1] (A1). In A1, the agents rely mainly on a morphological analysis algorithm to segment lines. Instead of that, the new approach adapts the External Features-based CNN (EFNet) architecture [2] inside the multi-agent system in order to enhance the performance of the segmentation algorithm. In terms of segmentation score, A2 brought better results compared to A1 on two benchmark databases (KHATT and HAPD). It also outperformed other recent methods in the literature.","PeriodicalId":351746,"journal":{"name":"2021 Fifth International Conference On Intelligent Computing in Data Sciences (ICDS)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121981178","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Word Embedding for Social Bot Detection Systems 用于社交机器人检测系统的词嵌入
2021 Fifth International Conference On Intelligent Computing in Data Sciences (ICDS) Pub Date : 2021-10-20 DOI: 10.1109/ICDS53782.2021.9626752
Zineb Ellaky, F. Benabbou, Sara Ouahabi, N. Sael
{"title":"Word Embedding for Social Bot Detection Systems","authors":"Zineb Ellaky, F. Benabbou, Sara Ouahabi, N. Sael","doi":"10.1109/ICDS53782.2021.9626752","DOIUrl":"https://doi.org/10.1109/ICDS53782.2021.9626752","url":null,"abstract":"In recent years, the growth of online social network (OSN) has been very phenomenal with great social and economic impact. However, some accounts are created for malicious activities whose objective is to influence elections, sully reputations, spread fake information or attack legitimate users. Practitioners as well as researchers are attracted by this problem and attempt to propose some solutions to prevent any OSN malicious activity. Fake account can be managed by bots, but all bots are not malicious systematically. In this paper we study the impact of using word embedding with different Machine Learning (ML) techniques on the of social bot detection performance. The experiments are based only on comment features from Cresci-17 dataset. For this purpose, we used the most ML algorithms such as Logistic Regression (LR), Decision Tree (DT), k-Nearest Neighbors (KNN), Support Vector Machine (SVM), Random Forest (RF), Naive Bayes (NB),Adaboost, XGBoost and MultiLayer Perceptron (MLP) with different word embedding methods such as BOW, TF-IDF, Doc2Vec, Bert, Word2Vec, and FastText. The results showed that RF and DT algorithms performed the highest precision of 99.96% with Bert, and Doc2Vec gave performed a precision score of100%.","PeriodicalId":351746,"journal":{"name":"2021 Fifth International Conference On Intelligent Computing in Data Sciences (ICDS)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121154044","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Preordonance correlation filter for feature selection in the high dimensional classification problem 基于先验相关滤波的高维分类问题特征选择
2021 Fifth International Conference On Intelligent Computing in Data Sciences (ICDS) Pub Date : 2021-10-20 DOI: 10.1109/ICDS53782.2021.9626705
Hasna Chamlal, T. Ouaderhman, F. Aaboub
{"title":"Preordonance correlation filter for feature selection in the high dimensional classification problem","authors":"Hasna Chamlal, T. Ouaderhman, F. Aaboub","doi":"10.1109/ICDS53782.2021.9626705","DOIUrl":"https://doi.org/10.1109/ICDS53782.2021.9626705","url":null,"abstract":"Feature selection is a crucial pre-processing phase in the analysis of high-dimensional datasets. Due to the presence of insignificant and redundant features in the dataset, the classification performance of learning algorithms is generally not satisfactory. The main purpose of feature selection is to surmount the high dimensionality problem by saving relevant features and removing irrelevant and redundant ones from the original features. This research proposes a novel filter feature selection algorithm, termed Preordonance Correlation Filter (PCF), utilized to pinpoint the most discriminating features from the high-dimensional dataset. The performance of the proposed PCF approach is investigated on three artificial datasets of high dimensions. Experimental results demonstrate that the PCF algorithm is able to successfully identify the right significant features and discard the irrelevant ones from all of the three simulated datasets.","PeriodicalId":351746,"journal":{"name":"2021 Fifth International Conference On Intelligent Computing in Data Sciences (ICDS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125209658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信