Yaohua Wang, Zhengtao Huang, Rongze Li, Xinyu Yin, Min Luo, Zheng Zhang, Xu Sun
{"title":"A Comparative Study of Speculative Retrieval for Multi-Modal Data Trails: Towards User-Friendly Human-Vehicle Interactions","authors":"Yaohua Wang, Zhengtao Huang, Rongze Li, Xinyu Yin, Min Luo, Zheng Zhang, Xu Sun","doi":"10.1145/3404555.3404617","DOIUrl":"https://doi.org/10.1145/3404555.3404617","url":null,"abstract":"In the era of growing developments in Autonomous Vehicles, the importance of Human-Vehicle Interaction has become apparent. However, the requirements of retrieving in-vehicle drivers' multi-modal data trails, by utilizing embedded sensors, have been consid- ered user unfriendly and impractical. Hence, speculative designs, for in-vehicle multi-modal data retrieval, has been demanded for future personalized and intelligent Human-Vehicle Interaction. In this paper, we explore the feasibility to utilize facial recog- nition techniques to build in-vehicle multi-modal data retrieval. We first perform a comprehensive user study to collect relevant data and extra trails through sensors, cameras and questionnaire. Then, we build the whole pipeline through Convolution Neural Net- works to predict multi-model values of three particular categories of data, which are Heart Rate, Skin Conductance and Vehicle Speed, by solely taking facial expressions as input. We further evaluate and validate its effectiveness within the data set, which suggest the promising future of Speculative Designs for Multi-modal Data Retrieval through this approach.","PeriodicalId":220526,"journal":{"name":"Proceedings of the 2020 6th International Conference on Computing and Artificial Intelligence","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123304423","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":"Learning Temporal Structure of Videos for Action Recognition Using Pattern Theory","authors":"Xiaoyu Zhang","doi":"10.1145/3404555.3404628","DOIUrl":"https://doi.org/10.1145/3404555.3404628","url":null,"abstract":"Aiming at the problem that a large amount of background information in the videos cause low judgment of actions, this paper proposed a graph model based on pattern theory for human complex action recognition. Firstly, a video is divided into video units and each video unit corresponds to an atomic action. The atomic action labels of videos are initialized by k-Means. Secondly, the key generator proposal module and the interpretative operation module are proposed to select important foreground information and obtain a reasonable representation of atomic action sequences. In the inference stage, the atomic action sequences of test videos are matched with template sequences by the Dynamic Time Warping algorithm (DTW) to obtain the action categories. The experimental results show that compared with the most existing human action recognition models, our model can explain the temporal process of action occurrence and obtain a more discriminatory sequence representation, which can effectively improve the accuracy of action recognition.","PeriodicalId":220526,"journal":{"name":"Proceedings of the 2020 6th International Conference on Computing and Artificial Intelligence","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126089270","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 Multiobjective Evolutionary Approach for Influence Maximization in Multilayer Networks","authors":"Qipeng Lu, Zhan Bu, Yuyao Wang","doi":"10.1145/3404555.3404568","DOIUrl":"https://doi.org/10.1145/3404555.3404568","url":null,"abstract":"Influence Maximization (IM) is one key algorithmic problems in information diffusion research; it aims to select a set of users from a social network and, by following a specific model, maximize the number of users influenced (the influence spread). Yet despite its immense potential, relatively little research is dedicated to IM for multilayer networks. Conversely, most existing IM studies that rely on a greedy algorithm strategy only obtain a single solution that provides limited insights on the target networks' core organization. With that in mind, we focus on studying the Influence Maximization Problem (IMP) in multilayer networks. Specifically, we define novel concepts, such as the pairwise reciprocal length and pairwise influence, with respect to the information-diffusion process in multilayer networks. Then we formulate the IM in multilayer networks as a multiobjective optimization problem and employ the classic Nondominated Sorting Genetic Algorithm II (NSGA-II) to find a set of Pareto-optimal solutions that provide a wide range of options for decision makers. To maintain population diversity and accelerate the algorithm's convergence, we combine a heuristic population initialization strategy and an efficient two-point crossover operation. Extensive experiments show that our approach has competitive performance when compared to off-the-shelf IM algorithms with regard to influence spread and running time.","PeriodicalId":220526,"journal":{"name":"Proceedings of the 2020 6th International Conference on Computing and Artificial Intelligence","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126089641","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 Novel Hybrid Algorithm for Sentiment Analysis via Classifier Ensembles for Online Shops User Using User Generated Contents and Review","authors":"Fereshteh Ghorbanian, Mehrdad Jalali","doi":"10.1145/3404555.3404645","DOIUrl":"https://doi.org/10.1145/3404555.3404645","url":null,"abstract":"Recently, Sentiment analysis and classification on social networking has been becoming popular in recent years. Industry and companies have realized the value of huge data to create a valuable advantage to get more customer. User generated content in online reviews for online shops or social media makes a lot of brand related information for marketing fields. In this paper we proposed a method to classify the sentiment polarities and find customer opinions and feeling about everything to propose product selection for each user in online markets. Our qualitative and quantitative experiment shown the usefulness of using positive, neutral, and negative customer opinion for product recommendation in online markets. By considering different combinations of techniques such as feature hashing, bag of words, and lexicons, and also consider the extensive results that described in the literature for application purposes, we can present the accuracy and precision of our method for online markets users.","PeriodicalId":220526,"journal":{"name":"Proceedings of the 2020 6th International Conference on Computing and Artificial Intelligence","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116120854","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":"An Improved Text Classification Model Based on Memory Convolution Neural Network","authors":"Yiyao Wang, Lihua Tian, Chen Li","doi":"10.1145/3404555.3404595","DOIUrl":"https://doi.org/10.1145/3404555.3404595","url":null,"abstract":"This paper proposes a text classification model, called improved memory neural network model, which is used to process large-scale training data. In this model, the optimized transformer feature extractor is used to replace the memory neural network which can not be parallelized. At the same time, the multi-level void convolution matrix is designed to replace the convolution neural network, so as to extract more accurate semantic unit features. Finally, in order to reduce the model parameters, each level of the convolution network pooling layer and the full connection layer are eliminated, but the global average pooling layer is instead used. The experimental results on THUCNews dataset and Twitter dataset show that the proposed method achieves competitive results in the accuracy, model parameters and convergence rate.","PeriodicalId":220526,"journal":{"name":"Proceedings of the 2020 6th International Conference on Computing and Artificial Intelligence","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123800934","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":"Bond Recommendation Based on Heterogeneous Network Embedding","authors":"Jiazhe Zhang, Cui Zhu, Wenjun Zhu","doi":"10.1145/3404555.3404560","DOIUrl":"https://doi.org/10.1145/3404555.3404560","url":null,"abstract":"Bond financing has become the main way of external financing. However, few studies have addressed recommendations for financial products to financial institutions. In the case of bonds, financial institutions often need multiple types of data to back up their marketing of bonds to companies. However, it is difficult to collect data and has a large amount of analysis. Therefore, this article based on issuance of historical data, simplifying the model data needed, rely on the company recommended study on the relationship between the issuance of bonds. Bonds contain a variety of heterogeneous characteristics, which contain a wealth of information. Therefore, this paper adopts the recommendation method based on HIN. This paper improves from three aspects. First, a meaningful meta-path is designed and a constraint condition is added to the random walk strategy to make it conform to the application scenario in the financial field. Secondly, the generation strategy is designed to generate isomorphic sequence of node of target type. Thirdly, based on the same industry bond recommendation, this method solves the cold start problem of the company. This paper conducts experiments on real data sets, and experimental results show the effectiveness of this method, which will assist account managers to find business opportunities.","PeriodicalId":220526,"journal":{"name":"Proceedings of the 2020 6th International Conference on Computing and Artificial Intelligence","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124927046","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 Study of Population Diversity Using an Enhanced Brain Storm Optimization","authors":"S. N. Kofie, S. H. Sackey","doi":"10.1145/3404555.3404606","DOIUrl":"https://doi.org/10.1145/3404555.3404606","url":null,"abstract":"In evolutionary algorithm, population diversity is a vital factor for solving problems. To avoid the premature convergence, it is imperative to preserve the population diversity during the evolution. The population diversity ensures avoiding the premature convergence. Population diversity is a measure that has been used extensively in studies to measure premature convergence. Population diversity is convenient for measuring and dynamically adjusting an algorithm's ability of exploration or exploitation. Brain Storm Optimization (BSO) is a new kind of swarm intelligence method inspired by the cooperative behavior of human beings in the problem-solving process. BSO suffers the premature convergence which happens partly due to the solutions getting clustered. The solution set clustered after a few iterations which indicate that the diversity level decreases rapidly during the search. In order to enhance the computational efficacy of the original BSO algorithm and maintain the population diversity, we propose two ways to re-cluster the original BSO. We introduce a BSO in objective space with a Cauchy distribution with the knowledge that Cauchy distribution infers a faster rate. In addition, we introduce a new step size equation as a parameter to balance the exploration and exploitation in the search space. A good algorithm maintains population diversity in both spaces (objective and parameter spaces). Our goal is to investigate why the enhanced BSO performs efficiently from the perspective of population diversity on a set of five benchmark functions. Experimental figures show that the performance of the proposed algorithms performs better from the population diversity measurement.","PeriodicalId":220526,"journal":{"name":"Proceedings of the 2020 6th International Conference on Computing and Artificial Intelligence","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123335331","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":"FCDnet","authors":"Yichang Liu, Huiling Gen","doi":"10.1145/3404555.3404638","DOIUrl":"https://doi.org/10.1145/3404555.3404638","url":null,"abstract":"Image denoising is to estimate a latent clean image from the noisy image. Existing denoising algorithms generally neglect smooth edges (missing details) while removing noises. In order to solve this problem, we propose an image denoising algorithm called fusion canny-edge operator image denoising based on CNN (FCDnet), which is composed of a denoising module based on Convolutional neural network (CNN), a canny edge module based on canny operator and a fusion module based on residual block. In addition, the edge extracted by canny edge extraction module is fused with the denoised image extracted by the denoising module to get a clearer and more detailed image. Experimental results show that the proposed algorithm obtains higher PSNR with more edge details and textures features than state-of-the-art methods on multiple datasets, i.e., Set5, Set14 and McMaster.","PeriodicalId":220526,"journal":{"name":"Proceedings of the 2020 6th International Conference on Computing and Artificial Intelligence","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121081339","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}
Yao Wang, Xiang Zhang, Kun Li, Jinhai Wang, Xiaogang Chen
{"title":"Humanoid Robot Control System Based on AR-SSVEP","authors":"Yao Wang, Xiang Zhang, Kun Li, Jinhai Wang, Xiaogang Chen","doi":"10.1145/3404555.3404625","DOIUrl":"https://doi.org/10.1145/3404555.3404625","url":null,"abstract":"In the brain computer interface (BCI), steady-state visual evoked potential (SSVEP) is a relatively common input signal of human-computer interaction systems. However, it often requires a fixed computer screen as a visual stimulator, which limits the flexibility of its application. In this research, HoloLens glasses are used as visual stimulators in a BCI system based on augmented reality to control the humanoid robot NAO to recognize and grasp objects. The system uses augmented reality device to induce steady-state visual evoked potential. The user does not need to perform visual stimulation at a fixed position, which can enhance the applicability in complex environments, thereby achieving more natural human-computer interaction. In order to achieve grasping, this study uses robot monocular vision recognition and establish forward and inverse kinematics models of the robot arms. EEG experiments have been performed to verify the accuracy of the system, it is more flexible and convenient for using augmented reality as stimulators in a humanoid robot control system based on SSVEP-BCI.","PeriodicalId":220526,"journal":{"name":"Proceedings of the 2020 6th International Conference on Computing and Artificial Intelligence","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121569777","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":"Kernel-Based Relocation Siamese Network for Real-Time Visual Object Tracking","authors":"Bohao Shen","doi":"10.1145/3404555.3404596","DOIUrl":"https://doi.org/10.1145/3404555.3404596","url":null,"abstract":"Siamese networks have been paid more attention to video tracking due to its superiority in balance accuracy and speed. Based on the convolutional feature cross-correlation between the target template and the search region, trackers with Siamese network can search for the best result in the candidate box to get the tracking result. However, existing Siamese tracking algorithms are often affected by motion blurring, low resolution, distortion and other issues that blur search region in solving video object tracking problems. This paper presents a candidate box area generation method based on kernel density function to relocate the search region when track failed. Specifically, the tracker proposed in this paper fuses deep feature and color feature to generate candidate boxes from which more accurate tracking results can be obtained, moreover, the color feature is easily to calculate to reach real-time speed. Finally, by improving the candidate box generation algorithm, the problem of tracking missing due to fast motion, blurring and other factors is effectively solved with less time consuming.","PeriodicalId":220526,"journal":{"name":"Proceedings of the 2020 6th International Conference on Computing and Artificial Intelligence","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130260296","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}