Shuai Jiang, Di Zhao, Tao Wang, Jing Zhang, Xiao Sun
{"title":"Hard Anchor Attention in Anchor-based Detector","authors":"Shuai Jiang, Di Zhao, Tao Wang, Jing Zhang, Xiao Sun","doi":"10.1145/3529836.3529940","DOIUrl":"https://doi.org/10.1145/3529836.3529940","url":null,"abstract":"In the anchor-based object detector, the redundancy introduced by the symmetry of anchor generator will be harmful for the diversity of positive anchors and cause performance drop. A simple yet effective sampling strategy called Hard Anchor Attention (HAA) is proposed in this paper. First, the anchor generator is re-examined by studying the contribution of different samples to the overall performance. It is verified that the harder positive anchors play an important role in the training of the detector. Then the HAA is introduced to evaluate the difficulty of refining anchors, and direct the focus of the training process to such harder anchors. The experimental results demonstrate that HAA can bring performance gains to RetinaNet and further releases the subsequent branches. Particularly, without fine-tuning, on the Pascal VOC dataset, HAA outperforms the random sampling and all-in baseline.","PeriodicalId":285191,"journal":{"name":"2022 14th International Conference on Machine Learning and Computing (ICMLC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115953217","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}
Eleni Kamateri, Vasileios Stamatis, K. Diamantaras, M. Salampasis
{"title":"Automated Single-Label Patent Classification using Ensemble Classifiers","authors":"Eleni Kamateri, Vasileios Stamatis, K. Diamantaras, M. Salampasis","doi":"10.1145/3529836.3529849","DOIUrl":"https://doi.org/10.1145/3529836.3529849","url":null,"abstract":"Many thousands of patent applications arrive at patent offices around the world every day. One important task when a patent application is submitted is to assign one or more classification codes from the complex and hierarchical patent classification schemes that will enable routing of the patent application to a patent examiner who is knowledgeable about the specific technical field. This task is typically undertaken by patent professionals, however due to the large number of applications and the potential complexity of an invention, they are usually overwhelmed. Therefore, there is a need for this code assignment manual task to be supported or even fully automated by classification systems that will classify patent applications, hopefully with an accuracy close to patent professionals. Like in many other text analysis problems, in the last years, this intellectually demanding task has been studied using word embeddings and deep learning techniques. In this paper these research efforts are shortly reviewed and re-produced with similar deep learning techniques using different feature representations on automatic patent classification in the level of sub-classes. On top of that, an innovative method of ensemble classifiers trained with different parts of the patent document is proposed. To the best of our knowledge, this is the first time that an ensemble method was proposed for the patent classification problem. Our first results are quite promising showing that an ensemble architecture of classifiers significantly outperforms current state-of-the-art techniques using the same classifiers as standalone solutions.","PeriodicalId":285191,"journal":{"name":"2022 14th International Conference on Machine Learning and Computing (ICMLC)","volume":"496 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129244735","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}
Bingdong Liu, Chengxu Ye, Ping Yang, Zhikun Miao, R. Liu, Ying Chen
{"title":"A Segmentation Model of Lung Parenchyma in Chest CT Based on ResUnet","authors":"Bingdong Liu, Chengxu Ye, Ping Yang, Zhikun Miao, R. Liu, Ying Chen","doi":"10.1145/3529836.3529917","DOIUrl":"https://doi.org/10.1145/3529836.3529917","url":null,"abstract":"Segmentation of the lung parenchymal region in chest CT is an essential part of the automatic diagnosis of lung diseases. Therefore, the quality of the segmentation directly affects the results of the automatic diagnosis. This paper proposes a model for lung parenchymal segmentation in chest CT based on ResUnet. It introduces the residual learning unit to transfer low-level information and enhances the connection between layers using skip connections based on the U-Net architecture. Then, it achieves full feature extraction through down-convolution and up-sampling and uses image enhancement and data augmentation to preprocess the data set. Through experiment, the proposed segmentation model has better results than the IoU and Dice of other models and can better segment the lung parenchyma in chest CT.","PeriodicalId":285191,"journal":{"name":"2022 14th International Conference on Machine Learning and Computing (ICMLC)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121583011","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":"Analysis Method of Ship Detention Judgment based on optimized DBSCAN Cluster Algorithm","authors":"Lei Han, Hanting Zhao, Mengao Li","doi":"10.1145/3529836.3529951","DOIUrl":"https://doi.org/10.1145/3529836.3529951","url":null,"abstract":"In order to realize the rapid extraction of maritime traffic behavior characteristics, we should effectively monitor and analyze the berthing and navigation of ships, and timely discover the abnormal behavior of ships. In this paper, an analysis method of ship detention judgment based on optimized DBSCAN cluster algorithm is proposed. In this method the target track information in the monitoring period of the monitoring area, the area is meshed to find the potential core points, and the potential core points are analyzed by DBSCAN cluster analysis to determine the ship detention behavior. The results show that this method can quickly determine the ship detention behavior. Compared with the traditional DBSCAN cluster analysis method, this method maintains high accuracy, reduces the computing time complexity and effectively improves the computational efficiency.","PeriodicalId":285191,"journal":{"name":"2022 14th International Conference on Machine Learning and Computing (ICMLC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114083927","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":"Spherical Tree Structured Self-Organizing Map","authors":"H. Dozono, Koki Yoshioka, Gen Niina","doi":"10.1145/3529836.3529900","DOIUrl":"https://doi.org/10.1145/3529836.3529900","url":null,"abstract":"∗In order to speed up the search for winner nodes in a SelfOrganizing Map (SOM), Tree Structured SOM(TS-SOM), which applies the tree search method to the SOM, was proposed. Since TS-SOM has the edges of the map like the SOM, the learning is biased depending on the position of the winner node. Therefore, in this paper, in order to eliminate the edges of TS-SOM’s map, we propose Spherical TS-SOM(S-TS-SOM) in which nodes are placed on spheres and the tree search method is applied. Also, we evaluate the performance of S-TS-SOM.","PeriodicalId":285191,"journal":{"name":"2022 14th International Conference on Machine Learning and Computing (ICMLC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114324318","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":"Neighborhood Extended Dynamic Graph Neural Network","authors":"Da-ming Yu, Junli Wang, Changjun Jiang","doi":"10.1145/3529836.3529851","DOIUrl":"https://doi.org/10.1145/3529836.3529851","url":null,"abstract":"Representation learning on dynamic graphs has drawn much attention due to its ability to learn hidden relationships as well as capture temporal patterns in graphs. It can be applied to represent a broad spectrum of graph-based data like social networks and further use the learned representations to solve the downstream tasks including link prediction and edge classification. Although some approaches have been proposed for dynamic graphs in recent years, most of them paid little attention to the evolution of the entire graph topology, leading to the lack of global information of what happened in nodes’ neighborhoods during their update. We propose NEDGNN, a novel Neighborhood Extended Dynamic Graph Neural Network on dynamic graphs represented as sequences of time-stamped events. We introduce a temporal attention propagation module to generate messages for n-hop neighbors through a self-attention mechanism, which can help disseminate information among nodes’ n-hop neighbors. Besides, a FIFO message box module is also applied to gain some time efficiency. Due to the introduction of these modules, NEDGNN outperforms many state-of-the-art baselines in several tasks. We also perform a detailed ablation study to test the effectiveness and time cost of each module.","PeriodicalId":285191,"journal":{"name":"2022 14th International Conference on Machine Learning and Computing (ICMLC)","volume":"108 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134476515","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 Deep Neural Networks model for Restaurant Recommendation systems in Thailand","authors":"Apisara Saelim, B. Kijsirikul","doi":"10.1145/3529836.3529925","DOIUrl":"https://doi.org/10.1145/3529836.3529925","url":null,"abstract":"In the age of flooded information, Recommender Systems play a crucial role as long as consumers consume more content and submit more data. Many businesses have implemented Recommender Systems to assist users find items based on their previous interactions. Deep neural networks have demonstrated promising results in a variety of disciplines, including recommendation systems in the past few years. However, such studies ignore auxiliary information input. In this work, we purpose a deep recommendation system with neural networks which consists of deep collaborative filtering to learn user and item interaction latent factor and enrich the performance with textual information by using multi-layer perceptrons and combining these two models under our framework, called DNNRecs. Apart from our model framework, we also contribute a feature engineering method to create new features from review text by using technique tf-idf. Extensive experiments on one real-life dataset in Thailand demonstrate the effectiveness of the proposed model.","PeriodicalId":285191,"journal":{"name":"2022 14th International Conference on Machine Learning and Computing (ICMLC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131301970","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":"Chaos Prediction of Power Systems by Using Deep Learning","authors":"Ying-Ling Lu, D. Wei","doi":"10.1145/3529836.3529843","DOIUrl":"https://doi.org/10.1145/3529836.3529843","url":null,"abstract":"Ensuring the stability of power systems is an important issue that should be considered in order to ensure the social and economic development of a country. Therefore, predicting the chaotic behavior of power systems in order to develop protection measures and keep power systems stable is vital. In this paper, a deep learning algorithm was proposed to predict the chaotic behavior of power systems by using deep long short-term memory (DLSTM) networks, which have two forms: deep long short-term memory with static scenario (DLSTM-s) and deep long-term memory with dynamic scenario (DLSTM-d). The genetic algorithm was used to optimize the hyperparameters of the networks. Then, taking interconnected power systems as an example, the effectiveness of the proposed DLSTM network was verified via numerical simulation. Finally, the experimental results of the DLSTM network were compared with those of the echo state network, multi-recurrent neural network, deep gated recurrent unit, and long short-term memory. Experimental results illustrated that a trained DLSTM network can predict the chaotic behavior of power systems by using the time series data of a single state variable. Moreover, the DLSTM-s network proposed in this paper can achieve competitive prediction performance compared with other baseline methods.","PeriodicalId":285191,"journal":{"name":"2022 14th International Conference on Machine Learning and Computing (ICMLC)","volume":"1 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114116729","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 System of Push-up Action Based on Kinect","authors":"Xia Liu, Mingdie Yan, Yazhuo Li, Xiao Li","doi":"10.1145/3529836.3529915","DOIUrl":"https://doi.org/10.1145/3529836.3529915","url":null,"abstract":"In order to realize automatic counting and motion evaluation of push-ups, Kinect sensor is used to collect obtain skeleton key points. By analyzing the rules and characteristics of push-up movement, the required key points are selected. The effective data are obtained by data processing methods such as vacancy filling, data conversion and mean filtering. By extracting the characteristics of push-ups, segmentation is carried out to realize movement counting. DTW algorithm is used to calculate the relative approximation of each push-up movement and the pre-set standard movement, so as to measure whether the movement is standard. The test shows that the system is feasible.","PeriodicalId":285191,"journal":{"name":"2022 14th International Conference on Machine Learning and Computing (ICMLC)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124820211","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":"SGCNN for 3D Point Cloud Classification","authors":"Shiyun Liu, Dongrui Liu, Chuanchuan Chen, Changqing Xu","doi":"10.1145/3529836.3529847","DOIUrl":"https://doi.org/10.1145/3529836.3529847","url":null,"abstract":"3D point cloud processing is challenging, as the points in the point cloud are disordered and irregularly distributed. Graph-based networks leverage the underlying topological relationship between points and achieve satisfactory performance in point cloud classification task. However, we observe that traditional graph construction and aggregation methods limit their efficiency. To address this problem, we propose a Sparse Graph Convolution Neural Network (SGCNN). Specifically, we apply a Sparse Graph Convolution (SGC) module to reduce the computation complexity of graph convolution and a Sparse Feature Encoding (SFE) module to enrich the representation of the point cloud in terms of sparse neighbor. The classification performances on synthetic and real-world benchmarks demonstrate the superiority and effectiveness of the proposed method. Compared with state-of-the-art methods, our approach balances accuracy and efficiency.","PeriodicalId":285191,"journal":{"name":"2022 14th International Conference on Machine Learning and Computing (ICMLC)","volume":"367 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122850765","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}