Future Computing and Informatics Journal最新文献

筛选
英文 中文
Applying spatial intelligence for decision support systems 将空间智能应用于决策支持系统
Future Computing and Informatics Journal Pub Date : 2018-12-01 DOI: 10.1016/j.fcij.2018.11.001
Amira M. Idrees , Mohamed H. Ibrahim , Ahmed I. El Seddawy
{"title":"Applying spatial intelligence for decision support systems","authors":"Amira M. Idrees ,&nbsp;Mohamed H. Ibrahim ,&nbsp;Ahmed I. El Seddawy","doi":"10.1016/j.fcij.2018.11.001","DOIUrl":"10.1016/j.fcij.2018.11.001","url":null,"abstract":"<div><p>Data mining is one of the vital techniques that could be applied in different fields such as medical, educational and industrial fields. Extracting patterns from spatial data is very useful to be used for discovering the trends in the data. However, analyzing spatial data is exhaustive due to its details as it is related to locations with a special representation such as longitude and latitude. This paper aims at proposing an approach for applying data mining techniques over spatial data to find trends in the data for decision support. Basic information considering spatial data is presented with presenting the proposed approach aiming to be applied in the Egyptian organizations to prove its applicability.</p></div>","PeriodicalId":100561,"journal":{"name":"Future Computing and Informatics Journal","volume":"3 2","pages":"Pages 384-390"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.fcij.2018.11.001","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79810625","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
Antlion optimization and boosting classifier for spam email detection 垃圾邮件检测的Antlion优化和增强分类器
Future Computing and Informatics Journal Pub Date : 2018-12-01 DOI: 10.1016/j.fcij.2018.11.006
Amany A. Naem , Neveen I. Ghali , Afaf A. Saleh
{"title":"Antlion optimization and boosting classifier for spam email detection","authors":"Amany A. Naem ,&nbsp;Neveen I. Ghali ,&nbsp;Afaf A. Saleh","doi":"10.1016/j.fcij.2018.11.006","DOIUrl":"10.1016/j.fcij.2018.11.006","url":null,"abstract":"<div><p>Spam emails are not necessary, though they are harmful as they include viruses and spyware, so there is an emerging need for detecting spam emails. Several methods for detecting spam emails were suggested based on the methods of machine learning, which were submitted to reduce non-relevant emails and get results of high precision for spam email classification. In this work, a new predictive method is submitted based on antlion optimization (ALO) and boosting termed as ALO-Boosting for solving spam emails problem. ALO is a computational model imitates the preying technicality of antlions to ants in the life cycle. Where ALO was utilized to modify the actual place of the population in the separate seeking area, thus obtaining the optimum feature subset for the better classification submit based on boosting classifier. Boosting classifier is a classification algorithm that points to a group of algorithms which modifies soft learners into powerful learners. The proposed procedure is compared against support vector machine (SVM), k-nearest neighbours algorithm (KNN), and bootstrap aggregating (Bagging) on spam email datasets in a set of implementation measures. The experimental outcomes show the ability of the proposed method to successfully detect optimum features with the smallest value of selected features and a high precision of measures for spam email classification based on boosting classifier.</p></div>","PeriodicalId":100561,"journal":{"name":"Future Computing and Informatics Journal","volume":"3 2","pages":"Pages 436-442"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.fcij.2018.11.006","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89340397","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 20
Time series forecasting using artificial neural networks methodologies: A systematic review 使用人工神经网络方法的时间序列预测:系统回顾
Future Computing and Informatics Journal Pub Date : 2018-12-01 DOI: 10.1016/j.fcij.2018.10.003
Ahmed Tealab
{"title":"Time series forecasting using artificial neural networks methodologies: A systematic review","authors":"Ahmed Tealab","doi":"10.1016/j.fcij.2018.10.003","DOIUrl":"10.1016/j.fcij.2018.10.003","url":null,"abstract":"<div><p>This paper studies the advances in time series forecasting models using artificial neural network methodologies in a systematic literature review. The systematic review has been done using a manual search of the published papers in the last 11 years (2006–2016) for the time series forecasting using new neural network models and the used methods are displayed. In the covered period in the study, the results obtained found 17 studies that meet all the requirements of the search criteria. Only three of the obtained proposals considered a process different to the autoregressive of a neural networks model. These results conclude that, although there are many studies that presented the application of neural network models, but few of them proposed new neural networks models for forecasting that considered theoretical support and a systematic procedure in the construction of model. This leads to the importance of formulating new models of neural networks.</p></div>","PeriodicalId":100561,"journal":{"name":"Future Computing and Informatics Journal","volume":"3 2","pages":"Pages 334-340"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.fcij.2018.10.003","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86415846","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 279
WITHDRAWN: Tabu search based optimization of PID parameters for temperature control of non-isothermal CSTR 基于禁忌搜索的非等温CSTR温度控制PID参数优化
Future Computing and Informatics Journal Pub Date : 2018-12-01 DOI: 10.1016/J.FCIJ.2018.11.007
Mohit Jain, Vijander Singh, A. Rani
{"title":"WITHDRAWN: Tabu search based optimization of PID parameters for temperature control of non-isothermal CSTR","authors":"Mohit Jain, Vijander Singh, A. Rani","doi":"10.1016/J.FCIJ.2018.11.007","DOIUrl":"https://doi.org/10.1016/J.FCIJ.2018.11.007","url":null,"abstract":"","PeriodicalId":100561,"journal":{"name":"Future Computing and Informatics Journal","volume":"227 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75693745","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
A linguistic approach for opinionated documents summary 固执己见的文献摘要的语言学方法
Future Computing and Informatics Journal Pub Date : 2018-12-01 DOI: 10.1016/j.fcij.2017.10.004
Mahmoud Othman , Hesham Hassan , Ramadan Moawad , Amira M. Idrees
{"title":"A linguistic approach for opinionated documents summary","authors":"Mahmoud Othman ,&nbsp;Hesham Hassan ,&nbsp;Ramadan Moawad ,&nbsp;Amira M. Idrees","doi":"10.1016/j.fcij.2017.10.004","DOIUrl":"10.1016/j.fcij.2017.10.004","url":null,"abstract":"<div><p>Now, the web pages contain opinions on almost anything, at review sites, forums, discussion groups, and blogs which called user generated content. They contain valuable information for different users such as persons or organizations, the processes of collecting, analyzing and classifying them to positive or negative opinions in addition to summarizing the opinions are considered a very important research issue. Summarizing opinions helps users to explore the opinion of others about the key aspects of a topic or an entity. The proposed opinion summarization system receives a document that contains sentences expressing opinions about an entity and generates a summary considering the important aspects, their relations, their sentiments and the textual evidences, as expressed in the reviews. In this paper we present a linguistic approach to summarize the opinionated documents across different domains, our evaluation based on a dataset of hotels, cars and various products reviews. The reviews collected from Tripadvisor, Amazon and Edmunds, each review document consist of a set of unordered, redundant reviews sentence, there are approximately 100 sentences per review document. The summary depends on the type of the opinion which is direct, comparative, or superlative. Each type is assigned to a specialist who is responsible for the summary.</p></div>","PeriodicalId":100561,"journal":{"name":"Future Computing and Informatics Journal","volume":"3 2","pages":"Pages 152-158"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.fcij.2017.10.004","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73847188","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 21
WITHDRAWN: Forecasting of nonlinear time series using artificial neural network 摘要:非线性时间序列的人工神经网络预测
Future Computing and Informatics Journal Pub Date : 2018-12-01 DOI: 10.1016/j.fcij.2017.06.001
Ahmed Tealab , Hesham Hefny , Amr Badr
{"title":"WITHDRAWN: Forecasting of nonlinear time series using artificial neural network","authors":"Ahmed Tealab ,&nbsp;Hesham Hefny ,&nbsp;Amr Badr","doi":"10.1016/j.fcij.2017.06.001","DOIUrl":"10.1016/j.fcij.2017.06.001","url":null,"abstract":"<div><p>The Publisher regrets that this article is an accidental duplication of an article that has already been published in &lt;FCIJ, 2 (2017) 39 - 47&gt;, <span>http://dx.doi.org/10.1016/j.fcij.2017.05.001</span><svg><path></path></svg>. The duplicate article has therefore been withdrawn.</p><p>The full Elsevier Policy on Article Withdrawal can be found at <span>https://www.elsevier.com/about/our-business/policies/article-withdrawal</span><svg><path></path></svg></p></div>","PeriodicalId":100561,"journal":{"name":"Future Computing and Informatics Journal","volume":"3 2","pages":"Pages 143-151"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.fcij.2017.06.001","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81634887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
TGA: Team game algorithm TGA:团队游戏算法
Future Computing and Informatics Journal Pub Date : 2018-12-01 DOI: 10.1016/j.fcij.2018.03.002
M.J. Mahmoodabadi , M. Rasekh , T. Zohari
{"title":"TGA: Team game algorithm","authors":"M.J. Mahmoodabadi ,&nbsp;M. Rasekh ,&nbsp;T. Zohari","doi":"10.1016/j.fcij.2018.03.002","DOIUrl":"10.1016/j.fcij.2018.03.002","url":null,"abstract":"<div><p>Lately, there is a growing interest in conducting research on optimization algorithms due to their wide range of engineering applications. One of the optimization algorithms' categories is evolutionary algorithms which are inspired from the natural behavior of animals and humans. Further, each of the evolutionary algorithms has its own advantages and disadvantages in convergence accuracy and computational time. In the present paper, a novel solution search algorithm taken from the team games is introduced. This evolutionary algorithm named Team Game Algorithm (TGA) involves passing a ball, making mistakes and substitution operators. Comparing the TGA's results to the outcomes of other well-known algorithms for unimodal and multimodal test functions elucidates the successful design of the proposed heuristic algorithm.</p></div>","PeriodicalId":100561,"journal":{"name":"Future Computing and Informatics Journal","volume":"3 2","pages":"Pages 191-199"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.fcij.2018.03.002","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76293265","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 29
A fast SIFT based method for copy move forgery detection 基于SIFT的快速复制移动伪造检测方法
Future Computing and Informatics Journal Pub Date : 2018-12-01 DOI: 10.1016/j.fcij.2018.03.001
Hesham A. Alberry , Abdelfatah A. Hegazy , Gouda I. Salama
{"title":"A fast SIFT based method for copy move forgery detection","authors":"Hesham A. Alberry ,&nbsp;Abdelfatah A. Hegazy ,&nbsp;Gouda I. Salama","doi":"10.1016/j.fcij.2018.03.001","DOIUrl":"10.1016/j.fcij.2018.03.001","url":null,"abstract":"<div><p>Image forensics is an important area of research used to indicate if a particular image is original or subjected to any kind of tampering. Images are essential part of judgment in tribunals. For forensic analysis, image forgery-detection techniques used to identify the forged images. In this paper, an effective algorithm to indicate Copy Move Forgery in digital image presented. The Scale Invariant Feature Transform (SIFT) and Fuzzy C-means (FCM) for clustering are utilized in the proposed algorithm. A number of numerical experiments performed using the MICC-220 dataset. The authors created an additional dataset, which consisted of 353 color images. The proposed algorithm tested by using both datasets where the average detection time on the MICC-220 data set is reduced by 14.67% over the existing traditional SIFT-based algorithm. For the created dataset, the average detection time reduced by 15.91% over the existing traditional SIFT-based algorithm.</p></div>","PeriodicalId":100561,"journal":{"name":"Future Computing and Informatics Journal","volume":"3 2","pages":"Pages 159-165"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.fcij.2018.03.001","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76302676","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
An optimization approach for automated unit test generation tools using multi-objective evolutionary algorithms 使用多目标进化算法的自动化单元测试生成工具的优化方法
Future Computing and Informatics Journal Pub Date : 2018-12-01 DOI: 10.1016/j.fcij.2018.02.004
Samar Ali Abdallah , Ramadan Moawad , Esaam Eldeen Fawzy
{"title":"An optimization approach for automated unit test generation tools using multi-objective evolutionary algorithms","authors":"Samar Ali Abdallah ,&nbsp;Ramadan Moawad ,&nbsp;Esaam Eldeen Fawzy","doi":"10.1016/j.fcij.2018.02.004","DOIUrl":"10.1016/j.fcij.2018.02.004","url":null,"abstract":"<div><p>High code coverage is measured by the process of software testing typically using automatic test case generation tools. This standard approach is usually used for unit testing to improve software reliability. Most automated test case generation tools focused just on code coverage without considering its cost and redundancy between generated test cases. To obtain optimized high code coverage and to ensure minimum cost and redundancy a Multi-Objectives Evolutionary Algorithm approach (MOEA) is set in motion. An efficient approach is proposed and applied to different algorithms from MOEA Frame from the separate library with three fitness functions for Coverage, Cost, and Redundancy. Four MEOA algorithms have been proven reliable to reach above the 90 percent code coverage: NSGAII, Random, SMSEMOA,v and ε-MOEA. These four algorithms are the key factors behind the MOEA approach.</p></div>","PeriodicalId":100561,"journal":{"name":"Future Computing and Informatics Journal","volume":"3 2","pages":"Pages 178-190"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.fcij.2018.02.004","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88862636","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Partition based clustering of large datasets using MapReduce framework: An analysis of recent themes and directions 使用MapReduce框架的基于分区的大型数据集聚类:最近的主题和方向分析
Future Computing and Informatics Journal Pub Date : 2018-12-01 DOI: 10.1016/j.fcij.2018.06.002
Tanvir Habib Sardar, Zahid Ansari
{"title":"Partition based clustering of large datasets using MapReduce framework: An analysis of recent themes and directions","authors":"Tanvir Habib Sardar,&nbsp;Zahid Ansari","doi":"10.1016/j.fcij.2018.06.002","DOIUrl":"10.1016/j.fcij.2018.06.002","url":null,"abstract":"<div><p>Data clustering is one of the fundamental techniques in scientific analysis and data mining, which describes a dataset according to similarities among its objects. Partition based clustering algorithms are the most popular and widely used clustering technique. In this information era, due to the digitization of every field, the huge volume of data is available to data analysts. The quick growth of such datasets makes decade old computing platforms, programming paradigms, and clustering algorithms become inadequate to obtain knowledge from these datasets. To cluster such large datasets, Hadoop distributed platform, MapReduce programming paradigm and modified clustering algorithms are being used to shrink the computational time by distributing clustering job across multiple computing nodes. This paper provides a comprehensive review of Hadoop and MapReduce and their components. This paper aims to survey recent research works on partition based clustering algorithms which use MapReduce as their programming paradigm. In many recent works, the traditional partition based clustering algorithms like K-means, K-prototypes, K-medoids, K-modes and Fuzzy C-means are modified for MapReduce paradigm in order to obtain different clustering objectives on different datasets for reducing the computational time. The contribution of this paper is (1) to provide an overview of clustering challenges in real world large dataset clustering and the role of MapReduce programming paradigm and its supporting platforms in dealing the challenges for several tasks in different datasets and (2) to review recent works in partition based clustering using MapReduce paradigm for different clustering objectives for different datasets employing different strategies.</p></div>","PeriodicalId":100561,"journal":{"name":"Future Computing and Informatics Journal","volume":"3 2","pages":"Pages 247-261"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.fcij.2018.06.002","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78811683","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 23
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学术文献互助群
群 号:481959085
Book学术官方微信