{"title":"Research on Stock Selection Strategy Based on AdaBoost Algorithm","authors":"Yanyu Chen, Xuechen Li, Wei Sun","doi":"10.1145/3424978.3425084","DOIUrl":"https://doi.org/10.1145/3424978.3425084","url":null,"abstract":"In this paper, we propose a new direction of stock selection strategy, coining the AdaBoost-Decision Tree (Ada-DT) model, which uses the AdaBoost lifting algorithm and Decision Tree to predict stock movements and select superior stocks. As for financial investment, people are more sensitive to losses than the same amount of gains. Therefore, we add this consideration to the use of AdaBoost algorithm. We use quality indicators, growth indicators, per-share indicators, and sentiment indicators, 24 in total, as the feature space, and try to identify the stocks that may outperform the broader market and have high yield from the Shanghai Stock Exchange (SSE) 50 constituent stocks. The stock selection result of Ada-DT is that the average correct rate of the out-of-sample test set is 72.84%, and the AUC is 0.634. At the same time, we compare the Ada-DT with AdaBoost-Support Vector Machine (Ada-SVM) prediction model and find that Ada-DT provides a higher correct rate and better cumulative returns, indicating that the Ada-DT algorithm is reasonable for complex nonlinear stock markets.","PeriodicalId":178822,"journal":{"name":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127641601","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":"The Application of Three Machine Learning Algorithms in Student Performance Evaluation","authors":"Xinghui Wu, Zaifeng Shi, Yuping Zhou, Haihua Xing","doi":"10.1145/3424978.3425072","DOIUrl":"https://doi.org/10.1145/3424978.3425072","url":null,"abstract":"At present, the research of machine learning is a hot topic. In this paper, three machine learning algorithms, decision tree, support vector machine and random forest, are used to predict the students' achievement data sets. The results in the early stage of the data were analyzed to predict the average results in the later stage of the professional courses. The results show that the classification performance of the three classifier models is high, among which the random forest classifier is the best in the accuracy rate, precision rate, recall rate and F1 value. Moreover, the comprehensive forecast result and the course importance order can guide the student to carry on the pertinence remediation, and it's helpful for students to make specific explanations in class.","PeriodicalId":178822,"journal":{"name":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133350889","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":"Segmented Representation of Time Series Based on Key Morphological Points","authors":"Lei Tu, Hongxin Xu, Yide Di","doi":"10.1145/3424978.3425099","DOIUrl":"https://doi.org/10.1145/3424978.3425099","url":null,"abstract":"Time series data has the characteristics of high dimension and high noise, data mining directly from the original series is not only time-consuming but also inefficient. Therefore, it is necessary to preprocess the original time series. Among various compression methods, PLR based on feature points has been widely studied because of its simplicity, high efficiency, and easy interpretation. However, most of the feature-based linear representation methods have the problem of low accuracy of the selected segmentation points. Based on the idea of traditional important extreme point extraction method, this paper proposes a time series segment representation algorithm based on key morphological points. The algorithm extracts the key extremum and key stationary value, which can greatly reduce the noise and retain the key points. Compared with IP, SEEP, KP and IEP algorithms, the proposed algorithm is tested in 9 different fields of UCR. The results show that under 98% compression rate, the algorithm has the least fitting error on seven groups of data, and second only to the best case in one group of data, so the algorithm can better fit the original sequence at high compression rate; In addition, the DTW distance calculation results on 9 types of data show that the algorithm can correctly classify 7 types of data, it has the best classification accuracy. The comparison results of difference value of the similarity of different classes show that it has better robustness and can be easily applied to the subsequent application research of the sequence.","PeriodicalId":178822,"journal":{"name":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115093159","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":"Discovery of Travelling Companions from Trajectories with Different Sampling Rates","authors":"Jiangang Yu, Yihao Guo, Xinning Zhu, Yifan You, Dinghe Xiao","doi":"10.1145/3424978.3425027","DOIUrl":"https://doi.org/10.1145/3424978.3425027","url":null,"abstract":"Discovery of travelling companions from trajectories can provide empirical support for various applications, such as COVID-19 contact tracing, suspects tracking and detection, tourist behavior analysis, etc. One challenge is trajectories of travelling companions are from different data sets with different sampling rates and granularities. Most current researches for discovery of travelling companions focus on using snapshot-based clustering methods to identify travelling groups, or using trajectory similarity algorithms to mine companion relationships. However, the constantly changing sampling rate limits the application of clustering methods in the companion relationship mining. Although some similarity algorithms can mitigate this negative impact, they usually focus on the spatial distribution of trajectories and the time complexity is very high. In this paper, we designed a Spatio-Temporal Trajectory Companion DEtection Framework (STCDEF) to detect travelling companions from trajectories with different sampling rates, which can effectively reduce the time consumption caused by the matching mechanism. Within the STCDEF, an approximate trajectory similarity algorithm, Fast Spatio-Temporal Similarity (FSTS) measure, is presented. Moreover, the concept of Mutual Following Degree (MFD) is introduced into STCDEF to detect travelling companions with FSTS, so as to further improve the efficiency when dealing with trajectories of varying sampling rates.","PeriodicalId":178822,"journal":{"name":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115659720","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":"Design and Implementation of Remote Medicine Monitoring System Based on Internet of Things","authors":"Lei Wang, Kunqin Li, Xianxiang Chen","doi":"10.1145/3424978.3425128","DOIUrl":"https://doi.org/10.1145/3424978.3425128","url":null,"abstract":"Intravenous drip, commonly known as infusion, is one of the most commonly used treatment and rescue measures in clinical practice. In the process of infusion, newborns, children, adults and the elderly have different requirements for infusion speed. Patients with poor metabolism of cardiopulmonary function and renal function need special attention, because infusion speed is not only related to the patient's heart load capacity, but also affects the efficacy of drugs, and even some patients will have drug reactions due to too fast infusion dripping speed. Besides, some problems such as untimely dosing, manual control of dripping speed and inconvenient call for medical staff exist in the process of infusion. Aiming at the above problems, in this paper, a remote medical monitoring system based on STC89C52 is proposed and designed. In the ward, sensors are used to detect the liquid level and dripping speed of liquid during infusion. Through ZigBee CC2530 wireless transmission, the infusion information is sent to the nurse end to realize remote monitoring. If there is too little medicine left or the infusion dripping speed is too fast during infusion, the alarm occurred in time, and meanwhile the infusion dripping speed can be controlled. After tested, the system runs stably, and the required functions such as real-time liquid level monitoring, real-time dripping speed monitoring, intelligent dripping speed adjustment and automatic alarm can be realized, which indicates that by using this system, the problems of the traditional infusion system can be solved, which has a strong practical value.","PeriodicalId":178822,"journal":{"name":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115682173","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":"Manufacturing State Recognition of Machine Center Based on Revised WPT and PCA","authors":"Jingshu Wang, T. Cheng, Bin Xing, Xiaolin Hu","doi":"10.1145/3424978.3425086","DOIUrl":"https://doi.org/10.1145/3424978.3425086","url":null,"abstract":"The abnormal manufacturing state recognition of machine center is of great significance to reduce downtime and ensure quality of productions. A revised wavelet packet transform and principal component analysis method has been developed to extract features from vibration signals of machine center. The revised wavelet packet transform employs local discriminant bases method to select optimal wavelet packet nodes. The principal component analysis is conducted for features dimensionality reduction to obtain the final features. A BP neural network is used to classify manufacturing states based on final features of three different manufacturing processes. The comparison result indicates that the revised WPT and PCA method is an efficient feature extraction method for manufacturing stage recognition of machine tools.","PeriodicalId":178822,"journal":{"name":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125066752","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":"Hybrid-grouping-matching Heuristic for the Storage Assignment in Gravity AS/RSs with Duration-of-stay Storage Policy","authors":"Li Li, Zhuxi Chen, Tingyu Zhang","doi":"10.1145/3424978.3424996","DOIUrl":"https://doi.org/10.1145/3424978.3424996","url":null,"abstract":"The gravity automated storage and retrieval systems (the gravity AS/RSs) has high space utilization and high storage density. In the gravity AS / RSs, unit-loads in each bin slide from storage end to retrieval end driven by the gravity. The unit-load in each bin follow the first-in-first-out principle, which means that the improper sequences of stored unit-loads brings extra travel time for removing blocking unit-loads. In duration-of-stay (DOS) storage policy, arrivals and departures of unit-loads are determined in advance. Therefore, a hybrid grouping-matching heuristic (hybrid-GM) is proposed in this paper to generate appropriate sequences of stored unit-loads in bins. Simulation experiments are conducted to evaluate the performance of the proposed heuristic.","PeriodicalId":178822,"journal":{"name":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122943792","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}
K. Shakhgeldyan, B. Geltser, V. Rublev, Basil Shirobokov, Dan Geltser, A. Kriger
{"title":"Feature Selection Strategy for Intrahospital Mortality Prediction after Coronary Artery Bypass Graft Surgery on an Unbalanced Sample","authors":"K. Shakhgeldyan, B. Geltser, V. Rublev, Basil Shirobokov, Dan Geltser, A. Kriger","doi":"10.1145/3424978.3425090","DOIUrl":"https://doi.org/10.1145/3424978.3425090","url":null,"abstract":"The aim of the study is to develop models of intrahospital mortality (IHM) prediction on an unbalanced sample of patients with coronary artery disease (CAD) post coronary artery bypass graft (CABG) surgery. Methods. Models for IHM prediction were built following the analysis of 866 electronic case histories based on the analysis of CAD patients, revascularized with the CABG operation. The patient cohort consisted of two groups. The first included 35 (4%) patients who died within the first 30 days after CABG, the second - 831 (96%) patients with a favorable operation outcome. We analyzed 99 factors, including the results of clinical, laboratory and instrumental studies obtained before CABG. For feature compilation, classical filtering and model selection methods were used (wrapper method). The primary drawback to applying a classical approach was the unbalanced sample as one cohort only consisted of 4% of subjects. In that case, it was not possible to apply the cross-validation procedure with three types of samples, standard quality metrics and multi-category factors. Results. Features searching approach using the multi-stage selection procedure, which combined the validation of predefined predictors, filtering methods and multifactor model development based on logistic regression, random forest (RF) and artificial neural networks (ANNs) was proposed. The models' accuracy was evaluated by a combined quality metric. RF and ANNs based models allowed not only to build more accurate forecasting tools, but also assisted in verifying five additional IHM predictors.","PeriodicalId":178822,"journal":{"name":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","volume":"200 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122146392","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":"Comparison Research between AEKF and EKF on Application of Fuzzy Controller","authors":"S. Wan, Jian Cao","doi":"10.1145/3424978.3425054","DOIUrl":"https://doi.org/10.1145/3424978.3425054","url":null,"abstract":"This paper compares AEKF with EKF. Because the fuzzy logic has a processing nonlinear, time-variety and indetermination ability, and then have to blend expert the ability of inspire type experience, and can carry out many targets reason logically and make use of the fuzzy intelligence technique blends expert the ability of inspire type experience, will to the request of trajectory, lead carry of restriction and target of random mobile, the target characteristic and characteristic etc. integrates to make to lead a rule database in, is making sure guided missile attack for the reasoning logically(the intelligence is excellent to turn) of the object best path can well consider these factors in the process, the realization precision leads to control with precision. Pass continuously an enlargement, modify, perfect make to lead rule of database, gradually exaltation make the intelligence level and independent ability of leading the system, can form the fuzzy intelligence system of a set of integrity to lead a system design method. This text is drawn up the combination leads the foundation of leading the Lyn up, adopt fuzzy logic controller realization, pass the establishment of rule database, imbed expert's experience, embody a comparison item in the different rule exportation and before place the Cape item variety that navigates a ratio, approach a modern to lead to lead Lyn further in of the best make to lead to increase a benefit of value, make it embody intelligence behavior.","PeriodicalId":178822,"journal":{"name":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125227255","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":"Research on DDoS Attacks in IPv6","authors":"Jie Zhong, Xiangning Chen","doi":"10.1145/3424978.3425020","DOIUrl":"https://doi.org/10.1145/3424978.3425020","url":null,"abstract":"With the gradual replacement of IPv4 by IPv6, Distributed Denial-of-Service (DDoS) attacks that have plagued IPv4 appear in IPv6 more or less, and affect the normal operation of IPv6. However, the current research on how to construct a secure DDoS attack defense system under ipv6 is far away from satisfactory. This paper makes a detailed analysis of DDoS attacks from the aspect of causes, specific performance, architecture, classifies DDoS attacks according to the exploited vulnerabilities and analyzes the typical attack methods respectively. At the same time, the improvements and defects of IPv6 are further studied, along with the way to defend, summarizes how to defend against DDoS attacks in IPv6 from two aspects, and analyze the advantages and disadvantages of each scheme. Finally, how to build a more secure network security defense system in IPv6 is prospected.","PeriodicalId":178822,"journal":{"name":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129780152","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}