Web Intell.Pub Date : 2022-05-12DOI: 10.3233/web-210481
B. Devi, M. Preetha
{"title":"Impact of self adaptive-elephant herding optimization towards neural network for facial emotion recognition","authors":"B. Devi, M. Preetha","doi":"10.3233/web-210481","DOIUrl":"https://doi.org/10.3233/web-210481","url":null,"abstract":"FACIAL expression is one of the most efficient, universal and fundamental indicators to identify their emotions and intentions in humans. Various experiments have already been performed on automatic Facial Emotion Recognition (FER) owing to useful significance in medical diagnosis, stress monitoring for drivers, sociable robots, and other human-computer interface devices. Here, this proposed framework consists of two processes namely; “(i) proposed feature extraction and (ii) classification”. Here, a major novelty relies in the initial phase (i.e. feature extraction phase), where the Proposed Local Vector Pattern (Proposed- LVP) based features are extracted. In addition to the proposed-LVP, the other Discrete Wavelet Transform (DWT) and Gray Level Co-occurrence Matrix (GLCM) based features are also extracted. Besides, the Principal Component Analysis (PCA) method is used for reducing the dimension of the features. Further, they are subjected to classification process, where Optimized Neural Network (NN) is used. More particularly, a new Improved Elephant Herding Optimization (EHO) model termed as Self Adaptive-EHO (SA-EHO) is used to train the NN model via selecting the optimal weights. At last, the proposed work performance is computed over the other traditional systems with respect to the positive measures like “accuracy, sensitivity, specificity and precision”; negative measures like “False Positive Rate (FPR), False Negative Rate (FNR) and False Discovery Rate (FDR)”; other measures like “Negative Predictive Value (NPV), F1-score and Matthew’s Correlation Coefficient (MCC)”, respectively.","PeriodicalId":245783,"journal":{"name":"Web Intell.","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116103372","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}
Web Intell.Pub Date : 2022-04-14DOI: 10.3233/web-210478
Zhonghui Hu, Rui Zhang, Xichang Li, Zhi-ting Yu, Xiaojie Li, Wenfeng Zhao, Xudong Zhang, Lin Li
{"title":"Conflict detection in Task Heterogeneous Information Networks","authors":"Zhonghui Hu, Rui Zhang, Xichang Li, Zhi-ting Yu, Xiaojie Li, Wenfeng Zhao, Xudong Zhang, Lin Li","doi":"10.3233/web-210478","DOIUrl":"https://doi.org/10.3233/web-210478","url":null,"abstract":"Task scheduling problems are involved in various fields, such as personal travel planning, UAV group path planning, intelligent furniture task scheduling and so on. As most of these task scheduling problems are subject to constraints of time, space and resource, conflicts often arise. However, the existing methods are typically limited to specific areas or geared to meet one or two types of constraints. As a result, they are unable to solve all conflicts systematically. This paper proposes a Task Heterogeneous Information Network (THIN) to model scheduling tasks and constraints comprehensively. Then, by dynamically exploring and converting Task Heterogeneous Information Networks, a series of algorithms are designed to detect and resolve all types of conflicts. Finally, conflict-free task plans are produced as outputs. Experiments have been conducted on datasets of different sizes, and the results show that our methods are effective.","PeriodicalId":245783,"journal":{"name":"Web Intell.","volume":"190 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133772610","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}
Web Intell.Pub Date : 2022-04-13DOI: 10.3233/web-210479
Zilong Jiang, Wei Deng, Wei Dai
{"title":"MLIM: A CTR prediction model describing evolution law of user interest","authors":"Zilong Jiang, Wei Deng, Wei Dai","doi":"10.3233/web-210479","DOIUrl":"https://doi.org/10.3233/web-210479","url":null,"abstract":"With the advent of the digital economy era, business systems such as web advertising and recommendation system have put forward the demand for predicting the click through rate (CTR) of items. However, the current CTR prediction research is not enough to mine user behavior, resulting in the lack of accuracy of user interest representation. In this paper, we propose a CTR prediction model, called MLIM, which can deep mine the evolution law of user interest. Specifically, we first use BiGRU to obtain the low-level user interest representation in the interest extraction layer, and then continue to use attention mechanism, BiGRU and sliding time window multi-components collaborative modeling in the interest evolution layer to obtain multi-level user interest representation with richer information, which can improve the accuracy of CTR prediction to a certain extent. Comprehensive experiments on two real datasets show that the proposed model achieves better performance than the mainstream baselines integrating user behavior analysis.","PeriodicalId":245783,"journal":{"name":"Web Intell.","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121777307","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}
Web Intell.Pub Date : 2022-04-08DOI: 10.3233/web-210477
Nhi N. Y. Vo, Guandong Xu, D. Le
{"title":"Causal inference for the impact of economic policy on financial and labour markets amid the COVID-19 pandemic","authors":"Nhi N. Y. Vo, Guandong Xu, D. Le","doi":"10.3233/web-210477","DOIUrl":"https://doi.org/10.3233/web-210477","url":null,"abstract":"The COVID-19 pandemic has turned the world upside down since the beginning of 2020, leaving most nations worldwide in both health crises and economic recession. Governments have been continually responding with multiple support policies to help people and businesses overcoming the current situation, from “Containment”, “Health” to “Economic” policies, and from local and national supports to international aids. Although the pandemic damage is still not under control, it is essential to have an early investigation to analyze whether these measures have taken effects on the early economic recovery in each nation, and which kinds of measures have made bigger impacts on reducing such negative downturn. Therefore, we conducted a time series based causal inference analysis to measure the effectiveness of these policies, specifically focusing on the “Economic support” policy on the financial markets for 80 countries and on the United States and Australia labour markets. Our results identified initial positive causal relationships between these policies and the market, providing a perspective for policymakers and other stakeholders.","PeriodicalId":245783,"journal":{"name":"Web Intell.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116953967","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}
Web Intell.Pub Date : 2022-04-07DOI: 10.3233/web-210480
C. Banchhor, N. Srinivasu
{"title":"A comprehensive study of data intelligence in the context of big data analytics","authors":"C. Banchhor, N. Srinivasu","doi":"10.3233/web-210480","DOIUrl":"https://doi.org/10.3233/web-210480","url":null,"abstract":"Modern systems like the Internet of Things, cloud computing, and sensor networks generate a huge data archive. The knowledge extraction from these huge archived data requires modified approaches in algorithm design techniques. The field of study in which analysis of such huge data is carried out is called big data analytics, which helps to optimize the performance with reduced cost and retrieves the information efficiently. The enhancement of traditional data analytics needs to modify to suit big data analytics because it may not manage huge amounts of data. The real thought is how to design the data mining algorithms suitable to handle big data analysis. This paper discusses data analytics at the initial level, to begin with, the insights about the analysis process for big data. Big data analytics have a current research edge in the knowledge extraction field. This paper highlights the challenges and problems associated with big data analysis and provide inner insights into several techniques and methods used.","PeriodicalId":245783,"journal":{"name":"Web Intell.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123936601","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}
Web Intell.Pub Date : 2022-01-07DOI: 10.3233/web-210471
Huixian Wang, Hongjiang Zheng
{"title":"Advanced ant colony algorithm for high dimensional abnormal data mining in Internet of things","authors":"Huixian Wang, Hongjiang Zheng","doi":"10.3233/web-210471","DOIUrl":"https://doi.org/10.3233/web-210471","url":null,"abstract":"This paper proposes a deep mining method of high-dimensional abnormal data in Internet of things based on improved ant colony algorithm. Preprocess the high-dimensional abnormal data of the Internet of things and extract the data correlation feature quantity; The ant colony algorithm is improved by updating the pheromone and state transition probability; With the help of the improved ant colony algorithm, the feature response signal of high-dimensional abnormal data in Internet of things is extracted, the judgment threshold of high-dimensional abnormal data in Internet of things is determined, and the objective function is constructed to optimize the mining depth, so as to realize the deep data mining. The results show that the average error of the proposed method is only 0.48%.","PeriodicalId":245783,"journal":{"name":"Web Intell.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134373444","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}
Web Intell.Pub Date : 2022-01-07DOI: 10.3233/web-210472
Jingyi Li
{"title":"Research on dynamic and secure storage of financial data based on cloud platform","authors":"Jingyi Li","doi":"10.3233/web-210472","DOIUrl":"https://doi.org/10.3233/web-210472","url":null,"abstract":"Traditional financial data storage methods are prone to data leakage and narrow data coverage. Therefore, this paper proposes a dynamic and secure storage method of financial data based on cloud platform.In order to improve the ability of enterprise data management, the paper constructs a financial cloud computing platform, mining financial data by rough set theory, and analyzing the results of frequent pattern mining of financial data by fuzzy attribute characteristics.According to the granularity theory, the financial data is classified and processed, and the CSA cloud risk model is established to realize the dynamic and secure storage of financial data.The experimental results show that. The maximum data storage delay of this method is no more than 4.1 s, the maximum data leakage risk coefficient is no more than 0.5, the number of data types can reach 30, and the data storage coverage is improved.","PeriodicalId":245783,"journal":{"name":"Web Intell.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129981779","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}
Web Intell.Pub Date : 2022-01-06DOI: 10.3233/web-210474
K. Vhatkar, G. Bhole
{"title":"A comprehensive survey on container resource allocation approaches in cloud computing: State-of-the-art and research challenges","authors":"K. Vhatkar, G. Bhole","doi":"10.3233/web-210474","DOIUrl":"https://doi.org/10.3233/web-210474","url":null,"abstract":"The allocation of resources in the cloud environment is efficient and vital, as it directly impacts versatility and operational expenses. Containers, like virtualization technology, are gaining popularity due to their low overhead when compared to traditional virtual machines and portability. The resource allocation methodologies in the containerized cloud are intended to dynamically or statically allocate the available pool of resources such as CPU, memory, disk, and so on to users. Despite the enormous popularity of containers in cloud computing, no systematic survey of container scheduling techniques exists. In this survey, an outline of the present works on resource allocation in the containerized cloud correlative is discussed. In this work, 64 research papers are reviewed for a better understanding of resource allocation, management, and scheduling. Further, to add extra worth to this research work, the performance of the collected papers is investigated in terms of various performance measures. Along with this, the weakness of the existing resource allocation algorithms is provided, which makes the researchers to investigate with novel algorithms or techniques.","PeriodicalId":245783,"journal":{"name":"Web Intell.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124000959","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}
Web Intell.Pub Date : 2021-12-30DOI: 10.3233/web-210476
Lin Li, Sijie Long, Jianxiu Bi, Guowei Wang, Jianwei Zhang, Xiaohui Tao
{"title":"A federated learning based semi-supervised credit prediction approach enhanced by multi-layer label mean","authors":"Lin Li, Sijie Long, Jianxiu Bi, Guowei Wang, Jianwei Zhang, Xiaohui Tao","doi":"10.3233/web-210476","DOIUrl":"https://doi.org/10.3233/web-210476","url":null,"abstract":"Learning based credit prediction has attracted great interest from academia and industry. Different institutions hold a certain amount of credit data with limited users to build model. An institution has the requirement to obtain data from other institutions for improving model performance. However, due to the privacy protection and subject to legal restrictions, they encounter difficulties in data exchange. This affects the performance of credit prediction. In order to solve the above problem, this paper proposes a federated learning based semi-supervised credit prediction approach enhanced by multi-layer label mean, which can aggregate parameters of each institution via joint training while protecting the data privacy of each institution. Moreover, in actual production and life, there are usually more unlabeled credit data than labeled ones, and the distribution of their feature space presents multiple data-dense divisions. To deal with these, local meanNet model is proposed with a multi-layer label mean based semi-supervised deep learning network. In addition, this paper introduces a cost-sensitive loss function in the supervised part of the local mean model. Conducted on two public credit datasets, experimental results show that our proposed federated learning based approach has achieved promising credit prediction performance in terms of Accuracy and F1 measures. At the same time, the framework design mode that splits data aggregation and keys uniformly can improve the security of data privacy and enhance the flexibility of model training.","PeriodicalId":245783,"journal":{"name":"Web Intell.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129641430","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}
Web Intell.Pub Date : 2021-12-28DOI: 10.3233/web-210473
Nagaraju Pamarthi, N. N. Rao
{"title":"Exponential Ant-Lion Rider Optimization for Privacy Preservation in Cloud Computing","authors":"Nagaraju Pamarthi, N. N. Rao","doi":"10.3233/web-210473","DOIUrl":"https://doi.org/10.3233/web-210473","url":null,"abstract":"The innovative trend of cloud computing is outsourcing data to the cloud servers by individuals or enterprises. Recently, various techniques are devised for facilitating privacy protection on untrusted cloud platforms. However, the classical privacy-preserving techniques failed to prevent leakage and cause huge information loss. This paper devises a novel methodology, namely the Exponential-Ant-lion Rider optimization algorithm based bilinear map coefficient Generation (Exponential-AROA based BMCG) method for privacy preservation in cloud infrastructure. The proposed Exponential-AROA is devised by integrating Exponential weighted moving average (EWMA), Ant Lion optimizer (ALO), and Rider optimization algorithm (ROA). The input data is fed to the privacy preservation process wherein the data matrix, and bilinear map coefficient Generation (BMCG) coefficient are multiplied through Hilbert space-based tensor product. Here, the bilinear map coefficient is obtained by multiplying the original data matrix and with modified elliptical curve cryptography (MECC) encryption to maintain data security. The bilinear map coefficient is used to handle both the utility and the sensitive information. Hence, an optimization-driven algorithm is utilized to evaluate the optimal bilinear map coefficient. Here, the fitness function is newly devised considering privacy and utility. The proposed Exponential-AROA based BMCG provided superior performance with maximal accuracy of 94.024%, maximal fitness of 1, and minimal Information loss of 5.977%.","PeriodicalId":245783,"journal":{"name":"Web Intell.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128441493","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}