{"title":"Predicting the Change on Stock Market Index Using Emotions of Market Participants with Regularization Methods","authors":"Yu Li, Rui Ma, Honghao Zhao, Shi Qiu, Ziyang Hu","doi":"10.1109/CIS.2017.00141","DOIUrl":"https://doi.org/10.1109/CIS.2017.00141","url":null,"abstract":"Stock market index as the composite of a series of representative stocks plays a very crucial role in the financial market. Predicting the change of stock market index is vital for investors and stock holders to capture the trend of stocks which they are interested. Recently research from behavioral finance suggests that emotions of market participates can influence stock market index. However, variable selection becomes a major challenge. Normally, lots of key words related to emotions can be extracted from the social media, meaning that the number of predictor variables p for the data mining methods is very large. Traditional variable selection methods require that the number of observations n is sufficient lager and regularization methods could select variables for high dimensional conditions. However, it is common that n is close to p when analyzing the emotions data within a specific time period. Under this condition, both variable selection methods are applicable, but few research has been done on it. In this paper, we compare the traditional variable selection method with the regularization method under the condition that n is close to p. Then we apply typical data mining methods to predict the SSE Composite Index in China with the selected variables. The results show that the regularization methods give much better performance compared with traditional variable infliction factor (VIF) analysis.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"353 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132643390","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}
Muhammad Waqar, H. Dawood, Ping Guo, M. Shahnawaz, M. Ghazanfar
{"title":"Prediction of Stock Market by Principal Component Analysis","authors":"Muhammad Waqar, H. Dawood, Ping Guo, M. Shahnawaz, M. Ghazanfar","doi":"10.1109/CIS.2017.00139","DOIUrl":"https://doi.org/10.1109/CIS.2017.00139","url":null,"abstract":"The categorization of high dimensional data present a fascinating challenge to machine learning models as frequent number of highly correlated dimensions or attributes can affect the accuracy of classification model. In this paper, the problem of high dimensionality of stock exchange is investigated to predict the market trends by applying the principal component analysis (PCA) with linear regression. PCA can help to improve the predictive performance of machine learning methods while reducing the redundancy among the data. Experiments are carried out on a high dimensional spectral of 3 stock exchanges such as: New York Stock Exchange, London Stock Exchange and Karachi Stock Exchange. The accuracy of linear regression classification model is compared before and after applying PCA. The experiments show that PCA can improve the performance of machine learning in general if and only if relative correlation among input features is investigated and careful selection is done while choosing principal components. Root mean square error (RMSE) is used as an evaluation metric to evaluate the classification model.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133179904","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}
{"title":"Optimal Control Model of Pension Funds Under Continuous Time","authors":"Haiyan Zhang, Ya-juan Yang","doi":"10.1109/CIS.2017.00082","DOIUrl":"https://doi.org/10.1109/CIS.2017.00082","url":null,"abstract":"In this paper, we consider an retirement, investment and consumption problem based on the basic pension policy of China in continuous time, where the utility function of insured per-son is formulated as an additive of consumption and terminal wealth. In our model, the problem is represented as an optimal stochastic control problem of forward-backward stochastic differential equation(FBSDE). We establish the associated Hamilton-Jacobi-Bellman (HJB) equation via dynamic programming principle. The HJB equation isafullynonlinearpartialdifferentialequation, and we obtain it's numerical solution of the value function as well as the optimal strategies by means of finite difference method. Finally, we analyze the effects of market parameters on the optimal investment, consumption and reinsurance strategies and give some economic explanations.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132383972","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}
{"title":"Evaluation of Fiber Tracking Results from UKF Tractography Methods","authors":"Na Wang, Wenyao Zhang, Wen Zhao","doi":"10.1109/CIS.2017.00140","DOIUrl":"https://doi.org/10.1109/CIS.2017.00140","url":null,"abstract":"Tractography is an important way to get insight into white matter of brain. Many techniques like the promising UKF tractography have been developed for this purpose. In this paper, four measure metrics including spatial metric, tangent metric, curve metric, and Hausdorff distance, are used to evaluate and compare the accuracy of UKF tractography with different tensor models. And a synthetic diffusion-weighted imaging dataset and a real brain dataset are used to test the tractography methods. Quantitative and qualitative test results indicate that UKF tractography based on two-tensor model needs to be further improved in accuracy though it has advantages in processing cross fibers. This is a helpful hint for future study of UKF tractography.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132389934","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}
{"title":"A New Algorithm for Computing All Solutions of an Absolute Value Equation","authors":"Jing Li, Jie Liu, Meili Wang, Fei Wei","doi":"10.1109/CIS.2017.00089","DOIUrl":"https://doi.org/10.1109/CIS.2017.00089","url":null,"abstract":"In this paper, a new strategy is put forward for solving the NP-hard absolute value equation (AVE) Ax—|x|=b which has 2n solutions. Via maths classified discussion, we can translate the AVE into 2n general linear equations, and solve each of these. Numerical results show that the strategy can be easy to get 2n solutions of the absolute value equation.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133035291","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}
{"title":"A Method of Improved CNN Traffic Classification","authors":"Huiyi Zhou, Yong Wang, Xiaochun Lei, Yuming Liu","doi":"10.1109/CIS.2017.00046","DOIUrl":"https://doi.org/10.1109/CIS.2017.00046","url":null,"abstract":"A traffic classification algorithm based on improved convolution neural network is proposed in this paper. It aims to improve the traditional traffic classification method. Firstly, the min-max normalization method is used to process the traffic data and map them into gray image, which will be used as the input data of convolution neural network to realize the independent feature learning. Then, an improved structure of the classical convolution neural network is proposed, both of the parameters of the feature map and the full connection layer are designed to select the optimal classification model to realize the traffic classification. Compared with the traditional classification method, the experimental results show that the proposed CNN traffic classification method can improve the accuracy and reduce the time of classification.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131053338","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}
{"title":"Traffic Identification of Mobile Apps Based on Variational Autoencoder Network","authors":"Ding Li, Yuefei Zhu, Wei Lin","doi":"10.1109/CIS.2017.00069","DOIUrl":"https://doi.org/10.1109/CIS.2017.00069","url":null,"abstract":"Traffic identification is a fundamental issue in network security. Traditional methods, such as depth packet inspection (DPI) and flow-based classifiers, have difficulties in labeling massive samples and extracting features manually. Motivated by the achievements in computer vision, we focus on mobile app traffic, proposing a deep learning model based on variational autoencoder network (VEAN). Our contributions are two-fold. First, we propose a novel method of transforming mobile app traffic flows into vision-meaningful images, and thus enable the machine to identify the traffic in a human way. Then, based on the transformation method, we create an open dataset named IMTD17. Second, an improved network model is proposed, where variational autoencoder (VAE) algorithm is introduced into a two-stage learning. The model realizes the learning from massive unlabeled data, and the feasibility of the replacement for manual feature extraction is illustrated by the visualization analysis of the latent features. The experimental results show that the identification accuracy can reach 99.6%, which satisfies the practical requirement.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115166892","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}
{"title":"Cost-Sharing Contract of Supply Chain Based on Carbon Emission Control","authors":"Dan Wu, Yuxiang Yang","doi":"10.1109/CIS.2017.00080","DOIUrl":"https://doi.org/10.1109/CIS.2017.00080","url":null,"abstract":"This paper studies the single cycle decision of the two-level supply chain cooperative emission reduction under the carbon emissions trading policy. Designed by Stackelberg game of retailer-led, manufacturer's follow-up, the analysis compares changes of the manufacturer's emission reductions, the retailer's order quantity, and both profit when whether there is a cost-sharing contract. The study found that after the contract was provided, under certain conditions, the profits of both parties can get a Pareto improvement and the manufacturer's product emission reductions and the optimal order quantity of the retailer and the ratio of the optimal cost sharing.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125404649","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}
{"title":"Evolutionary Multi-tasking Single-Objective Optimization Based on Cooperative Co-evolutionary Memetic Algorithm","authors":"Qunjian Chen, Xiaoliang Ma, Zexuan Zhu, Yiwen Sun","doi":"10.1109/CIS.2017.00050","DOIUrl":"https://doi.org/10.1109/CIS.2017.00050","url":null,"abstract":"Evolutionary multi-tasking optimization has recently emerged as a promising new topic in the field of evolutionary computation. It is a promising framework for solving different optimization problems simultaneously. Compared with the classic evolutionary algorithms, evolutionary multi-tasking optimization (MTO) can take advantage of implicit genetic transfer in the optimization process and get better performance. Distinct tasks are solved simultaneously by utilizing similarities and differences across different tasks. In this paper, an evolutionary multi-tasking single-objective optimization based on cooperative co-evolutionary memetic algorithm (EMTSO-CCMA) is proposed. A local search method based on quasi-Newton is proposed to accelerate the convergence of the proposed algorithm. The effectiveness of the proposed algorithm is shown in this paper by comparing with the multifactorial evolutionary algorithm.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116871129","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}
Bo Zhao, Chao Ji, Lidan Li, Qianya Guo, Li-Yu Daisy Liu, Jing Zhou
{"title":"Scaled Context Region for Correlation Filter Tracking","authors":"Bo Zhao, Chao Ji, Lidan Li, Qianya Guo, Li-Yu Daisy Liu, Jing Zhou","doi":"10.1109/CIS.2017.00077","DOIUrl":"https://doi.org/10.1109/CIS.2017.00077","url":null,"abstract":"Robust target tracking is a challenging problem in visual object tracking. Most existing methods cannot find a balance between accuracy and speediness. In this paper, we follow discriminative scale space tracking and adopt scaled context region in correlation filter tracking instead of fixed region to increase the accuracy of tracking result. The scale of context region varies according to peak-sidelobe-ratio and size of the target. Meanwhile, the computational cost does not increase too much in order to retain high computational speed. Quantitatively and qualitatively experiments are conducted to demonstrate the robustness and real-time performance of our method.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122094716","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}