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

筛选
英文 中文
[Title page i] [标题页i]
{"title":"[Title page i]","authors":"","doi":"10.1109/icmla.2018.00001","DOIUrl":"https://doi.org/10.1109/icmla.2018.00001","url":null,"abstract":"","PeriodicalId":6533,"journal":{"name":"2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA)","volume":"16 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87394044","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
Vision-Based Detection of Simultaneous Kicking for Identifying Movement Characteristics of Infants At-Risk for Neuro-Disorders 基于视觉的同时踢腿检测识别有神经障碍风险的婴儿的运动特征
Devleena Das, Katelyn E. Fry, A. Howard
{"title":"Vision-Based Detection of Simultaneous Kicking for Identifying Movement Characteristics of Infants At-Risk for Neuro-Disorders","authors":"Devleena Das, Katelyn E. Fry, A. Howard","doi":"10.1109/ICMLA.2018.00230","DOIUrl":"https://doi.org/10.1109/ICMLA.2018.00230","url":null,"abstract":"Neuro disorders such as Cerebral Palsy (CP) and Infantile Spasms (IS) in infants can cause a wide range of developmental coordination disorders (DCD). Simultaneous, non-complex, kicking patterns that persist in infants of 4-7 months of age is highly suggestive of a neuro-disorder. Early establishment of risk levels for infants at risk for neuro-disorders is beneficial for early intervention. To provide a method to track early infant kicking movements for determining risk-level, an automated method is established to track and classify periods of simultaneous (SM), non-simultaneous movements (NSM) and no movement (NM) during infant kicking actions. In this paper, a computer vision algorithm uses KAZE points to track infant kicking and collect kinematic data. Each movement type is classified by computing unique feature criterion and using a support vector machine (SVM) for learning a movement model. We discuss the significance of the classifier as well as analyze the percentage break down of movement types for typical infants and infants with IS.","PeriodicalId":6533,"journal":{"name":"2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA)","volume":"119 1","pages":"1413-1418"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85392968","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}
引用次数: 10
Improving Multi-modal Optimization Restart Strategy Through Multi-armed Bandit 基于多臂强盗的多模态优化重启策略改进
A. Dubois, J. Dehos, F. Teytaud
{"title":"Improving Multi-modal Optimization Restart Strategy Through Multi-armed Bandit","authors":"A. Dubois, J. Dehos, F. Teytaud","doi":"10.1109/ICMLA.2018.00057","DOIUrl":"https://doi.org/10.1109/ICMLA.2018.00057","url":null,"abstract":"Multi-Modal Optimization problems are widespread and can be solved using numerous methods, such as niching, sharing or clearing. In this paper, we are interested in algorithms based on restart strategies, where the searching point is restarted at another initial position when an optimum is found. Previous works show that the choice of these initial positions greatly impacts the performance of the algorithm but is not easy to make. In this paper, we propose a new restart strategy, based on reinforcement learning. Our algorithm subdivides the search space and uses a Multi-Armed Bandit technique to choose the successive restart positions. We experiment this algorithm on various functions and on a modified Hump function with more complex local areas. Our results show significant improvements over previous algorithms, such as the Quasi-Random restart with Decreasing Step-size algorithm.","PeriodicalId":6533,"journal":{"name":"2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA)","volume":"14 1","pages":"338-343"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88585540","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
Annotating the Performance of Industrial Assets via Relevancy Estimation of Event Logs 通过事件日志的相关性评估来标注工业资产的绩效
Pierre Dagnely, T. Tourwé, E. Tsiporkova
{"title":"Annotating the Performance of Industrial Assets via Relevancy Estimation of Event Logs","authors":"Pierre Dagnely, T. Tourwé, E. Tsiporkova","doi":"10.1109/ICMLA.2018.00205","DOIUrl":"https://doi.org/10.1109/ICMLA.2018.00205","url":null,"abstract":"Nowadays, more and more industrial assets are continuously monitored and generate vast amount of events and sensor data. It provides an excellent opportunity for understanding the asset behaviour that is currently underexplored due to several challenges: extremely heterogeneous data sources, overwhelming data volume, textual aspect of event logs and complex relational dependencies between events. We have addressed this problem by developing two methodologies: 1) A methodology to detect the relevant events while taking into account the relations between them 2) A methodology (built on top of the first one) to build performance profiles taking into account multiple data sources (events and sensor data). We have validated the methodologies in the specific photovoltaic (PV) domain.","PeriodicalId":6533,"journal":{"name":"2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA)","volume":"36 1","pages":"1261-1268"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90419512","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
Deep Convolution Neural Network Model to Predict Relapse in Breast Cancer 深度卷积神经网络模型预测乳腺癌复发
Alokkumar Jha, Ghanshyam Verma, Yasar Khan, Qaiser Mehmood, D. Rebholz-Schuhmann, Ratnesh Sahay
{"title":"Deep Convolution Neural Network Model to Predict Relapse in Breast Cancer","authors":"Alokkumar Jha, Ghanshyam Verma, Yasar Khan, Qaiser Mehmood, D. Rebholz-Schuhmann, Ratnesh Sahay","doi":"10.1109/ICMLA.2018.00059","DOIUrl":"https://doi.org/10.1109/ICMLA.2018.00059","url":null,"abstract":"A mishap in anti-cancer drug distribution is critical in breast cancer patients due to poor prediction model to identify the treatment regime in ER+ve and ER-ve (Estrogen Receptor (ER)) patients. The traditional method for the prediction depends on the change in expression across the normal-disease pair. However, it certainly misses the multidimensional aspect and underlying cause of relapse, such as various mutations, drug dosage side effects, methylation, etc. In this paper, we have developed a multi-layer neural network model to classify multidimensional genomics data into their similar annotation group. Further, we used this multi-layer cancer genomics perceptron for annotating differentially expressed genes (DEGs) to predict relapse based on ER status in breast cancer. This approach provides multivariate identification of genes, not just by differential expression, but, cause-effect of disease status due to drug overdosage and genomics-driven drug balancing method. The multi-layered neural network model, where each layer defines the relationship of similar databases with multidimensional knowledge. We illustrate that the use of multilayer knowledge graph with gene expression data for training the deep convolution neural network stratify the patient relapse and drug dosage along with underlying molecular properties.","PeriodicalId":6533,"journal":{"name":"2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA)","volume":"1051 1","pages":"351-358"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77241714","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}
引用次数: 6
Fast Proposals for Image and Video Annotation Using Modified Echo State Networks 基于改进回声状态网络的图像和视频标注快速方案
Sohini Roychowdhury, L. S. Muppirisetty
{"title":"Fast Proposals for Image and Video Annotation Using Modified Echo State Networks","authors":"Sohini Roychowdhury, L. S. Muppirisetty","doi":"10.1109/ICMLA.2018.00199","DOIUrl":"https://doi.org/10.1109/ICMLA.2018.00199","url":null,"abstract":"Deep learning frameworks for computer-vision applications require fast and scalable annotation systems. Since manually annotated data for semantic segmentation tasks is time-consuming and tough to quality assure, accurate and automated region-based proposals can significantly aid high quality data annotation. In this work, we propose modified Echo State Network (ESN) models that iteratively learn from a small subset of data (20-30% images) and adapt to a variety of semantic segmentation goals without manual supervision on test images. We observe that the modified ESN model that relies on 3 x 3 pixel neighborhood features scales across segmentation tasks with mean segmentation F_scores in the range of 0.58-0.87 for complete foreground and specific foreground segmentation tasks, respectively. Thus, the proposed methods can be specifically useful for fast semantic proposal estimation to enhance the annotation resourcefulness for time sensitive applications in the automotive field.","PeriodicalId":6533,"journal":{"name":"2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA)","volume":"80 1","pages":"1225-1230"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80964658","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
Interpretability and Reproducability in Production Machine Learning Applications 生产机器学习应用中的可解释性和可再现性
Sindhu Ghanta, Sriram Ganapathi Subramanian, S. Sundararaman, L. Khermosh, Vinay Sridhar, D. Arteaga, Q. Luo, Dhananjoy Das, Nisha Talagala
{"title":"Interpretability and Reproducability in Production Machine Learning Applications","authors":"Sindhu Ghanta, Sriram Ganapathi Subramanian, S. Sundararaman, L. Khermosh, Vinay Sridhar, D. Arteaga, Q. Luo, Dhananjoy Das, Nisha Talagala","doi":"10.1109/ICMLA.2018.00105","DOIUrl":"https://doi.org/10.1109/ICMLA.2018.00105","url":null,"abstract":"Explainability/Interpretability in machine learning applications is becoming critical, with legal and industry requirements demanding human understandable machine learning results. We describe the additional complexities that occur when a known interpretability technique (canary models) is applied to a real production scenario. We furthermore argue that reproducibility is a key feature in practical usages of such interpretability techniques in production scenarios. With this motivation, we present a production ML reproducibility solution, namely a comprehensive time ordered event sequence for machine learning applications. We demonstrate how our approach can bring this known common interpretability technique into production viability. We further present the system design and early performance characteristics of our reproducibility solution.","PeriodicalId":6533,"journal":{"name":"2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA)","volume":"78 1","pages":"658-664"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79123369","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}
引用次数: 6
Improving L-BFGS Initialization for Trust-Region Methods in Deep Learning 基于深度学习信任域方法的L-BFGS初始化改进
J. Rafati, Roummel F. Marcia
{"title":"Improving L-BFGS Initialization for Trust-Region Methods in Deep Learning","authors":"J. Rafati, Roummel F. Marcia","doi":"10.1109/ICMLA.2018.00081","DOIUrl":"https://doi.org/10.1109/ICMLA.2018.00081","url":null,"abstract":"Deep learning algorithms often require solving a highly non-linear and nonconvex unconstrained optimization problem. Generally, methods for solving the optimization problems in machine learning and in deep learning specifically are restricted to the class of first-order algorithms, like stochastic gradient descent (SGD). The major drawback of the SGD methods is that they have the undesirable effect of not escaping saddle-points. Furthermore, these methods require exhaustive trial-and-error to fine-tune many learning parameters. Using the second-order curvature information to find the search direction can help with more robust convergence for the non-convex optimization problem. However, computing the Hessian matrix for the large-scale problems is not computationally practical. Alternatively, quasi-Newton methods construct an approximate of Hessian matrix to build a quadratic model of the objective function. Quasi-Newton methods, like SGD, require only first-order gradient information, but they can result in superlinear convergence, which makes them attractive alternatives. The limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) approach is one of the most popular quasi-Newton methods that construct positive-definite Hessian approximations. Since the true Hessian matrix is not necessarily positive definite, an extra initialization condition is required to be introduced when constructing the L-BFGS matrices to avoid false negative curvature information. In this paper, we propose various choices for initialization methods of the L-BFGS matrices within a trust-region framework. We provide empirical results on the classification task of the MNIST digits dataset to compare the performance of the trust-region algorithm with different L-BFGS initialization methods.","PeriodicalId":6533,"journal":{"name":"2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA)","volume":"19 1","pages":"501-508"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78499674","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}
引用次数: 14
Frequent Chronicle Mining: Application on Predictive Maintenance 频繁时序挖掘:在预测性维护中的应用
Chayma Sellami, Ahmed Samet, Mohamed Anis Bach Tobji
{"title":"Frequent Chronicle Mining: Application on Predictive Maintenance","authors":"Chayma Sellami, Ahmed Samet, Mohamed Anis Bach Tobji","doi":"10.1109/ICMLA.2018.00226","DOIUrl":"https://doi.org/10.1109/ICMLA.2018.00226","url":null,"abstract":"Chronicles are a kind of sequential patterns that consider the time dimension to produce relevant knowledge for decision makers. Mined from pairs of event-time, chronicles are represented in graphs for which vertices are events and edges are labeled with intervals representing the time between the two linked events. Chronicle mining is interesting in several domains where predicting the time interval of an event is important, such as network failure analysis, pharmaco-epidemiology and human activities analysis. In this work, we are interested in predicting the failure time of monitored industrial machines. We introduce a new approach to mine the most relevant chronicles in an industrial data set. The extracted chronicles are then used to predict the failure time of a given machine. Our approach is validated through several experiments led on a benchmark data set.","PeriodicalId":6533,"journal":{"name":"2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA)","volume":"38 1","pages":"1388-1393"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75686312","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
An RNN-LSTM Based Flavor Recommender Framework in Hybrid Cloud 混合云中基于RNN-LSTM的风味推荐框架
E. G. Radhika, G. Sadhasivam
{"title":"An RNN-LSTM Based Flavor Recommender Framework in Hybrid Cloud","authors":"E. G. Radhika, G. Sadhasivam","doi":"10.1109/ICMLA.2018.00047","DOIUrl":"https://doi.org/10.1109/ICMLA.2018.00047","url":null,"abstract":"One of the key problem in hybrid cloud is to discover well matched cloud provider to scale up applications irrespective of their non-standardized naming technologies. No framework has been developed to monitor and recommend VM flavor for the period of autoscale in hybrid cloud based on utilization history. In the existing scenario, administrators manually consider heterogeneous sets of criteria and resource relationships to map cloud service providers for user's preferences in hybrid environment. Flavor selection remains constant irrespective of application's resource usage in hybrid cloud which results in under utilization. The proposed framework will fill the gap by monitoring applications and recommending flavor to adjust capacity of resources at low possible cost while maintaining stability and predictable performance. The framework a) Predicts future workload using deep learning technique Recurrent Neural Network (RNN) with Long Short Term Memory (LSTM) b) Recommend a flavor, aligned with Optimized Cost and Service Level Agreement (SLA) for autoscale group depending on CPU or RAM utilization in the current and history workloads. c) Operate recommended flavor on future workload and ensures zero application downtime in the current workload. The proposed flavor recommender framework has been implemented in hybrid cloud OpenStack and Amazon Web Services (AWS). The experimental results has shown significant cost difference of 17.65% per hour on autoscale group of instances with proposed flavor recommender framework over traditional flavor selection.","PeriodicalId":6533,"journal":{"name":"2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA)","volume":"77 1","pages":"270-277"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83183638","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}
引用次数: 2
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学术官方微信