2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA)最新文献

筛选
英文 中文
Pilot Skill Level and Workload Prediction for Sliding-Scale Autonomy 滑动尺度自治的飞行员技能水平和工作量预测
Sai K. R. Nittala, Colin P. Elkin, J. M. Kiker, R. Meyer, James Curro, Ali K. Reiter, Kevin S. Xu, V. Devabhaktuni
{"title":"Pilot Skill Level and Workload Prediction for Sliding-Scale Autonomy","authors":"Sai K. R. Nittala, Colin P. Elkin, J. M. Kiker, R. Meyer, James Curro, Ali K. Reiter, Kevin S. Xu, V. Devabhaktuni","doi":"10.1109/ICMLA.2018.00188","DOIUrl":"https://doi.org/10.1109/ICMLA.2018.00188","url":null,"abstract":"An emerging topic in human-computer interaction research involves optimal collaboration between humans and machines to achieve a particular goal. One approach to such a goal involves sliding-scale autonomy, in which a machine dynamically adjusts between different levels of autonomy based on a variety of measurements. In this paper, we propose a system to predict skill level and workload for aircraft pilots using machine learning algorithms. Our proposed system uses the pilot's heart rate variability and flight control data, including pilot inputs such as throttle and aileron, and flight sensor data such as latitude and longitude. We conduct a user study on 15 pilots, each flying the same 5 pre-defined routes on a flight simulator. Our results indicate that the flight control data alone are sufficient to provide a near-perfect classification of a pilot's skill level into expert or novice. On the other hand, predicting mental workload is much more difficult, and a combination of flight control and heart rate data is required to obtain an accurate estimate of mental workload. Our findings provide the first step towards a sliding-scale autonomous system for aviation.","PeriodicalId":6533,"journal":{"name":"2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA)","volume":"13 1","pages":"1166-1173"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83358571","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}
引用次数: 9
Density-Based Fuzzy C-Means Multi-center Re-clustering Radar Signal Sorting Algorithm 基于密度的模糊c均值多中心重聚类雷达信号分选算法
Sheng Cao, Shucheng Wang, Yan Zhang
{"title":"Density-Based Fuzzy C-Means Multi-center Re-clustering Radar Signal Sorting Algorithm","authors":"Sheng Cao, Shucheng Wang, Yan Zhang","doi":"10.1109/ICMLA.2018.00144","DOIUrl":"https://doi.org/10.1109/ICMLA.2018.00144","url":null,"abstract":"As the improving strategic position of electronic warfare in modern warfare, radar sorting detection becomes the eye of modern information warfare and plays an important role in it. This paper designs a new pulse radar sorting algorithm: a Density-Based Fuzzy C-Means Multi-Center Re-Clustering (DFCMRC) radar signal sorting algorithm. This algorithm mainly combines the advantages of Density-Based Spatial Clustering of Applications with Noise (DBSCAN) clustering algorithm and Fuzzy C-means (FCM) clustering algorithm. This paper also optimizes the structure of the DFCMRC algorithm, which changes the algorithm that randomly generated the initial center point to the Clustering by Fast Search and Find of Density Peaks (CFSFDP) algorithm. After comparison tests, the DFCMRC algorithm sorting result is better than the K-means algorithm, the DBSCAN algorithm and the FCM algorithm. Also, the membership grade description of DFCMRC makes more sense than the FCM's. Accelerated optimized DFCMRC algorithm can reduce more than half iterations, which greatly shortens the algorithm calculation time.","PeriodicalId":6533,"journal":{"name":"2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA)","volume":"20 1","pages":"891-896"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77686059","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}
引用次数: 5
A Comparative Evaluation of Machine Learning Methods for Robot Navigation Through Human Crowds 机器人在人群中导航的机器学习方法比较评价
Anastasia Gaydashenko, D. Kudenko, A. Shpilman
{"title":"A Comparative Evaluation of Machine Learning Methods for Robot Navigation Through Human Crowds","authors":"Anastasia Gaydashenko, D. Kudenko, A. Shpilman","doi":"10.1109/ICMLA.2018.00089","DOIUrl":"https://doi.org/10.1109/ICMLA.2018.00089","url":null,"abstract":"Robot navigation through crowds poses a difficult challenge to AI systems, since the methods should result in fast and efficient movement but at the same time are not allowed to compromise safety. Most approaches to date were focused on the combination of pathfinding algorithms with machine learning for pedestrian walking prediction. More recently, reinforcement learning techniques have been proposed in the research literature. In this paper, we perform a comparative evaluation of pathfinding/prediction and reinforcement learning approaches on a crowd movement dataset collected from surveillance videos taken at Grand Central Station in New York. The results demonstrate the strong superiority of state-of-the-art reinforcement learning approaches over pathfinding with state-of-the-art behavior prediction techniques.","PeriodicalId":6533,"journal":{"name":"2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA)","volume":"115 1","pages":"553-557"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77911999","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}
引用次数: 7
Machine Learning for Classification of Inhibitors of Hepatic Drug Transporters 肝脏药物转运体抑制剂分类的机器学习
Natalia Khuri, Shantanu Deshmukh
{"title":"Machine Learning for Classification of Inhibitors of Hepatic Drug Transporters","authors":"Natalia Khuri, Shantanu Deshmukh","doi":"10.1109/ICMLA.2018.00034","DOIUrl":"https://doi.org/10.1109/ICMLA.2018.00034","url":null,"abstract":"Interactions between drugs may occur when drugs are administered together. These interactions can increase or decrease the efficacy of one of the drugs or can cause a new therapeutic effect which cannot be attributed to either drug alone. An important mechanism underlying drug-drug interactions is inhibition of proteins that mediate transport of drugs across cellular membranes. We developed five machine learning models, including deep learning, for predicting which drugs may inhibit transporter proteins in the liver, and assessed their performance in internal and external validation. Three out of five methods, k-nearest Neighbors, Support Vector Machines, and Recursive Neural Networks have not been previously applied in this domain. The area under the Receiver Operating Curve statistic for the five models ranged between 67% and 78%. Random forest and Support Vector Machines models showed the highest performance in external validation as assessed by the F1 metric. Our modeling approach and results demonstrate a practical application of machine learning techniques in an important application domain.","PeriodicalId":6533,"journal":{"name":"2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA)","volume":"61 1","pages":"181-186"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73397243","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}
引用次数: 4
Deep Reinforcement Learning for Fairness in Distributed Robotic Multi-type Resource Allocation 分布式机器人多类型资源分配公平性的深度强化学习
Qinyun Zhu, J. Oh
{"title":"Deep Reinforcement Learning for Fairness in Distributed Robotic Multi-type Resource Allocation","authors":"Qinyun Zhu, J. Oh","doi":"10.1109/ICMLA.2018.00075","DOIUrl":"https://doi.org/10.1109/ICMLA.2018.00075","url":null,"abstract":"As autonomous robots are becoming a reality, we discover new challenges in coordination among these robots. We present a unique new problem that each robot makes decisions in achieving tasks that require multiple robots with different capabilities. Fair resource allocation is essential to ensure that all resource requesters acquire adequate robot resources and accomplish their tasks. We propose solutions to the fairness problem in multi-type resource allocation for multi-robot systems that have multiple resource requesters requiring heterogeneous robots with different capabilities to accomplish tasks. In particular, this work focuses on systems of single-tasking robots with multi-robot tasks (STR-MRT). In STR-MRT, the capability of a robot is the resource for accomplishing a specific task. In this problem, 1) each robot can perform only one task at a time, 2) tasks are divisible, and 3) accomplishing each task requires resources from one or more robots. We model the decentralized resource allocation in STR-MRT as a coordination game between the robots. Each robot strategically selects one resource requester. Then a consensus-based algorithm conducts formation of a robotic team for each task. We leverage the Dominant Resource Fairness (DRF) and Deep Q-learning Network (DQN) to support requester selection. The results suggest that the DQN outperforms the common Q-learning.","PeriodicalId":6533,"journal":{"name":"2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA)","volume":"387 1","pages":"460-466"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79566588","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}
引用次数: 7
Sonar-to-Satellite Translation using Deep Learning 使用深度学习的声纳到卫星翻译
G. G. Giacomo, M. Santos, Paulo L. J. Drews-Jr, S. Botelho
{"title":"Sonar-to-Satellite Translation using Deep Learning","authors":"G. G. Giacomo, M. Santos, Paulo L. J. Drews-Jr, S. Botelho","doi":"10.1109/ICMLA.2018.00074","DOIUrl":"https://doi.org/10.1109/ICMLA.2018.00074","url":null,"abstract":"Sonar images pose hindrances when being elucidated for applications such as underwater navigation and localization. On the other hand, satellite images are simpler to be interpreted, but require GPS that is unavailable underwater due to absorption phenomena. Thus, we propose a neural network capable of translating an acoustic image acquired underwater to a textured image. We called the process sonar-to-satellite translation. We adopted a state-of-the-art neural architecture on a dataset comprised of sonar data and their respective satellite images. The experimental results show our method can extract interesting features from acoustic images and generate an informative texture image.","PeriodicalId":6533,"journal":{"name":"2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA)","volume":"4 1","pages":"454-459"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79975010","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}
引用次数: 3
A Persona-Based Multi-turn Conversation Model in an Adversarial Learning Framework 对抗性学习框架中基于角色的多回合会话模型
O. Olabiyi, Anish Khazane, Erik T. Mueller
{"title":"A Persona-Based Multi-turn Conversation Model in an Adversarial Learning Framework","authors":"O. Olabiyi, Anish Khazane, Erik T. Mueller","doi":"10.1109/ICMLA.2018.00079","DOIUrl":"https://doi.org/10.1109/ICMLA.2018.00079","url":null,"abstract":"In this paper, we extend the persona-based sequence-to-sequence (Seq2Seq) neural network conversation model to multi-turn dialogue by modifying the state-of-the-art hredGAN architecture. To achieve this, we introduce an additional input modality into the encoder and decoder of hredGAN to capture other attributes such as speaker identity, location, sub-topics, and other external attributes that might be available from the corpus of human-to-human interactions. The resulting persona hredGAN (phredGAN) shows better performance than both the existing persona-based Seq2Seq and hredGAN models when those external attributes are available in a multi-turn dialogue corpus. This superiority is demonstrated on TV drama series with character consistency (such as Big Bang Theory and Friends) and customer service interaction datasets such as Ubuntu dialogue corpus in terms of perplexity, BLEU, ROUGE, and Distinct n-gram scores.","PeriodicalId":6533,"journal":{"name":"2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA)","volume":"196 1","pages":"489-494"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77104732","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}
引用次数: 9
Neural Adaptive Controller Applied to a VTOL Plant Using Takagi-Sugeno Fuzzy Model 基于Takagi-Sugeno模糊模型的垂直起降装置神经自适应控制器
Andres Morocho-Caiza, J. Rodríguez-Flores, J. Hernández-Ambato
{"title":"Neural Adaptive Controller Applied to a VTOL Plant Using Takagi-Sugeno Fuzzy Model","authors":"Andres Morocho-Caiza, J. Rodríguez-Flores, J. Hernández-Ambato","doi":"10.1109/ICMLA.2018.00186","DOIUrl":"https://doi.org/10.1109/ICMLA.2018.00186","url":null,"abstract":"In this paper, a comparison of the regularity actions between a conventional PID controller and a neuro-fuzzy PID controller, on a vertical take-off and landing (VTOL) plant, is presented. First, the VTOL model was identified using a classic step-test method. The conventional PID was designed using the controller synthesis method. Both plant and controller models were optimized using decreasing gradient technique. The neuro-fuzzy controller was developed starting from the characterization and identification of the singletons values for each gain contribution of the adaptative PID controller, which were introduced in a zero-order Takagi-Sugeno fuzzy inference system with Triangular membership functions applied to the error signal as input. Through several step-test, the stabilization time of the plant was evaluated, which was reduced in near 30 s using the neuro-fuzzy controller. Furthermore, the integral-square-error of the response plant was reduced with the fuzzy PID respect to the classic PID controller.","PeriodicalId":6533,"journal":{"name":"2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA)","volume":"136 1","pages":"1155-1160"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77118217","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}
引用次数: 1
A Pipeline for Optimizing F1-Measure in Multi-label Text Classification 多标签文本分类中一种优化f1测度的管道
Bingyu Wang, Cheng Li, Virgil Pavlu, J. Aslam
{"title":"A Pipeline for Optimizing F1-Measure in Multi-label Text Classification","authors":"Bingyu Wang, Cheng Li, Virgil Pavlu, J. Aslam","doi":"10.1109/ICMLA.2018.00148","DOIUrl":"https://doi.org/10.1109/ICMLA.2018.00148","url":null,"abstract":"Multi-label text classification is the machine learning task wherein each document is tagged with multiple labels, and this task is uniquely challenging due to high dimensional features and correlated labels. Such text classifiers need to be regularized to prevent severe over-fitting in the high dimensional space, and they also need to take into account label dependencies in order to make accurate predictions under uncertainty. Many classic multi-label learning algorithms focus on incorporating label dependencies in the model training phase and optimize for the strict set-accuracy measure. We propose a new pipeline which takes such algorithms and improves their F1-performance with careful training regularization and a new prediction strategy based on support inference, calibration and GFM, to the point that classic multi-label models are able to outperform recent sophisticated methods (PDsparse, SPEN) and models (LSF, CFT, CLEMS) designed specifically to be multi-label F-optimal. Beyond performance and practical contributions, we further demonstrate that support inference acts as a strong regularizer on the label prediction structure.","PeriodicalId":6533,"journal":{"name":"2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA)","volume":"1 1","pages":"913-918"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86240434","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}
引用次数: 7
Trademark Design Code Identification Using Deep Neural Networks 利用深度神经网络识别商标设计代码
Girish Showkatramani, Nidhi Khatri, Arlene Landicho, Darwin Layog
{"title":"Trademark Design Code Identification Using Deep Neural Networks","authors":"Girish Showkatramani, Nidhi Khatri, Arlene Landicho, Darwin Layog","doi":"10.1109/ICMLA.2018.00017","DOIUrl":"https://doi.org/10.1109/ICMLA.2018.00017","url":null,"abstract":"Trademark review and approval is a complex process that involves thorough analysis and review of the design components of the marks including the visual characteristics as well as the textual mark description data specifying the significant aspects of the mark. One of the crucial aspect in review of the trademark application is determining the design codes of the trademarks based on their mark description. Currently, the process of identifying the design codes for a trademark is performed manually in the United States Patent and Trademark Office (USPTO) and takes substantial amount of time. Recently, word embeddings and deep neural networks (DNNs) have demonstrated excellent performance in computer vision and various natural language processing (NLP) tasks such as machine translation, speech recognition, sentence and document classification etc. to name a few. In this study, we explored fastText and different neural networks such as Convolution Neural Networks (CNN), Long Short Term Memory (LSTM), bidirectional versions of both LSTM and Gated Recurrent Unit (GRU) and Recurrent Convolutional Neural Network (RCNN) to automate trademark design code classification based on their mark description. Overall, it was found that the trademark word embeddings with RCNN model outperformed other models. Our study thereby seeks to provide a solution towards the time intensive and laborious process of identifying design codes of the trademarks.","PeriodicalId":6533,"journal":{"name":"2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA)","volume":"2 1","pages":"61-65"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86515380","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信