首页 > 最新文献

2019 International Conference on Machine Learning and Cybernetics (ICMLC)最新文献

英文 中文
Subspace Clustering and Feature Extraction Based on Latent Sparse Low-Rank Representation 基于潜在稀疏低秩表示的子空间聚类与特征提取
Pub Date : 2019-07-01 DOI: 10.1109/ICMLC48188.2019.8949212
Lina Zhao, Fang Ma, Hongwei Yang
Robust recovery of multiple subspace structures from high-dimensional data with noise has received considerable attention in computer vision and pattern recognition. Low-Rank Representation (LRR) as a typical method has made satisfactory results in subspace clustering. Latent Low-Rank Representation (LLRR) is an advanced version of LRR, which considers the row and column of data to solve the insufficient samples problem. However, they fail to exploit the local structures of data. To address this problem, Latent Sparse Low-Rank Representation (LSLRR) is proposed to capture the local and global structures of data by considering sparse and low-rank constraints simultaneously. In this way, LSLRR not only solves the clustering problem, but also extracts significant features for classification. Inexact Augmented Lagrange Multiplier method (IALM) is utilized to solve its objective function. Experimental results in subspace clustering and salient features extraction demonstrate the proposed LSLRR have a favorable performance.
从带有噪声的高维数据中鲁棒恢复多个子空间结构在计算机视觉和模式识别领域受到广泛关注。低秩表示(LRR)作为一种典型的聚类方法在子空间聚类中取得了令人满意的结果。潜在低秩表示(Latent Low-Rank Representation, LLRR)是LRR的高级版本,它考虑数据的行和列来解决样本不足的问题。然而,它们无法利用数据的局部结构。为了解决这一问题,提出了潜在稀疏低秩表示(LSLRR),通过同时考虑稀疏约束和低秩约束来捕获数据的局部和全局结构。这样,LSLRR不仅解决了聚类问题,而且可以提取出重要的特征进行分类。采用非精确增广拉格朗日乘子法求解其目标函数。在子空间聚类和显著特征提取方面的实验结果表明,LSLRR具有良好的性能。
{"title":"Subspace Clustering and Feature Extraction Based on Latent Sparse Low-Rank Representation","authors":"Lina Zhao, Fang Ma, Hongwei Yang","doi":"10.1109/ICMLC48188.2019.8949212","DOIUrl":"https://doi.org/10.1109/ICMLC48188.2019.8949212","url":null,"abstract":"Robust recovery of multiple subspace structures from high-dimensional data with noise has received considerable attention in computer vision and pattern recognition. Low-Rank Representation (LRR) as a typical method has made satisfactory results in subspace clustering. Latent Low-Rank Representation (LLRR) is an advanced version of LRR, which considers the row and column of data to solve the insufficient samples problem. However, they fail to exploit the local structures of data. To address this problem, Latent Sparse Low-Rank Representation (LSLRR) is proposed to capture the local and global structures of data by considering sparse and low-rank constraints simultaneously. In this way, LSLRR not only solves the clustering problem, but also extracts significant features for classification. Inexact Augmented Lagrange Multiplier method (IALM) is utilized to solve its objective function. Experimental results in subspace clustering and salient features extraction demonstrate the proposed LSLRR have a favorable performance.","PeriodicalId":221349,"journal":{"name":"2019 International Conference on Machine Learning and Cybernetics (ICMLC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129604917","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
Comments on “Finite-Time Analysis of the Multiarmed Bandit Problem” 评“多武装土匪问题的有限时间分析”
Pub Date : 2019-07-01 DOI: 10.1109/ICMLC48188.2019.8949232
Lu-ning Zhang, Xin Zuo, Jian-wei Liu, Weimin Li, Nobuyasu Ito
In the article [1], we can get a tighter upper bound of expected regret in Theorem 1 and 4, there are also some critical incorrect statements in the proof of Theorem 2, we modified the incorrect statements in this comment and a correction version of Theorem 2 is also presented.
在文章[1]中,我们可以在定理1和定理4中得到一个更严格的期望后悔上界,在定理2的证明中也有一些关键的错误表述,我们在这篇评论中对错误表述进行了修改,并给出了定理2的一个修正版本。
{"title":"Comments on “Finite-Time Analysis of the Multiarmed Bandit Problem”","authors":"Lu-ning Zhang, Xin Zuo, Jian-wei Liu, Weimin Li, Nobuyasu Ito","doi":"10.1109/ICMLC48188.2019.8949232","DOIUrl":"https://doi.org/10.1109/ICMLC48188.2019.8949232","url":null,"abstract":"In the article [1], we can get a tighter upper bound of expected regret in Theorem 1 and 4, there are also some critical incorrect statements in the proof of Theorem 2, we modified the incorrect statements in this comment and a correction version of Theorem 2 is also presented.","PeriodicalId":221349,"journal":{"name":"2019 International Conference on Machine Learning and Cybernetics (ICMLC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128889256","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
Exploring the LIMB Position Effect on Wearable-Ultrasound-Based Gesture Recognition 肢体位置对可穿戴超声手势识别的影响研究
Pub Date : 2019-07-01 DOI: 10.1109/ICMLC48188.2019.8949209
Xingchen Yang, J. Yan, Yi-Zhao, Honghai Liu
Despite the prosperous development of the ultrasound-based human-machine interface, its reliability in the practical applications is still unevaluated. This paper gives priority to exploring the limb position effect on the ultrasound-based gesture recognition, where wearable A-mode ultrasound is utilized instead of its cumbersome B-mode counterpart. An online experiment under eight different limb positions is conducted to validate the performance of the ultrasound-based gesture recognition, with eight able-bodied subjects employed. Results show that the influence of limb movement on the ultrasound-based gesture recognition is not significant. Overall, the real-time motion completion rate and motion recognition accuracy are 97.1% and 94.5% across different limb positions, albeit only training at a natural limb position. Moreover, it takes only 177 ms for the system to successfully recognize the intended motions across various limb positions. These results demonstrate the reliability of the ultrasound-based gesture interaction, paving the way for its practical applications.
尽管基于超声的人机界面发展迅速,但其在实际应用中的可靠性仍有待评估。本文重点研究基于超声的手势识别中肢体位置的影响,利用可穿戴的a模超声代替笨重的b模超声。为了验证基于超声波的手势识别的性能,我们采用了8名健全的被试,在8种不同的肢体姿势下进行了在线实验。结果表明,肢体运动对超声手势识别的影响不显著。总体而言,不同肢体位置的实时运动完成率和运动识别准确率分别为97.1%和94.5%,尽管仅在自然肢体位置进行训练。此外,该系统仅需要177 ms即可成功识别不同肢体位置的预期运动。这些结果证明了基于超声手势交互的可靠性,为其实际应用铺平了道路。
{"title":"Exploring the LIMB Position Effect on Wearable-Ultrasound-Based Gesture Recognition","authors":"Xingchen Yang, J. Yan, Yi-Zhao, Honghai Liu","doi":"10.1109/ICMLC48188.2019.8949209","DOIUrl":"https://doi.org/10.1109/ICMLC48188.2019.8949209","url":null,"abstract":"Despite the prosperous development of the ultrasound-based human-machine interface, its reliability in the practical applications is still unevaluated. This paper gives priority to exploring the limb position effect on the ultrasound-based gesture recognition, where wearable A-mode ultrasound is utilized instead of its cumbersome B-mode counterpart. An online experiment under eight different limb positions is conducted to validate the performance of the ultrasound-based gesture recognition, with eight able-bodied subjects employed. Results show that the influence of limb movement on the ultrasound-based gesture recognition is not significant. Overall, the real-time motion completion rate and motion recognition accuracy are 97.1% and 94.5% across different limb positions, albeit only training at a natural limb position. Moreover, it takes only 177 ms for the system to successfully recognize the intended motions across various limb positions. These results demonstrate the reliability of the ultrasound-based gesture interaction, paving the way for its practical applications.","PeriodicalId":221349,"journal":{"name":"2019 International Conference on Machine Learning and Cybernetics (ICMLC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129124674","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
Analyzing Causal Relationships of Sensor Data and Infrared Images to Stabilize Garbage Power Generation 分析传感器数据与红外图像的因果关系,稳定垃圾发电
Pub Date : 2019-07-01 DOI: 10.1109/ICMLC48188.2019.8949308
K. Matsubayashi, T. Anjiki, Shunji Maeda
Garbage power generation is expected to play an important role as a renewable source of stable power. Steam is produced from the heat of combustion, and this is used to generate electrical energy. In order to supply continuous power, the combustion must be controlled so as to create a stable steam flow. In this report, we analyze sensor data from and infrared images of the furnace with the aim of stabilizing the steam flow.
垃圾发电作为一种稳定的可再生能源有望发挥重要作用。蒸汽是由燃烧的热量产生的,这被用来产生电能。为了提供持续的动力,必须控制燃烧以产生稳定的蒸汽流。在本报告中,我们分析了炉内的传感器数据和红外图像,目的是稳定蒸汽流量。
{"title":"Analyzing Causal Relationships of Sensor Data and Infrared Images to Stabilize Garbage Power Generation","authors":"K. Matsubayashi, T. Anjiki, Shunji Maeda","doi":"10.1109/ICMLC48188.2019.8949308","DOIUrl":"https://doi.org/10.1109/ICMLC48188.2019.8949308","url":null,"abstract":"Garbage power generation is expected to play an important role as a renewable source of stable power. Steam is produced from the heat of combustion, and this is used to generate electrical energy. In order to supply continuous power, the combustion must be controlled so as to create a stable steam flow. In this report, we analyze sensor data from and infrared images of the furnace with the aim of stabilizing the steam flow.","PeriodicalId":221349,"journal":{"name":"2019 International Conference on Machine Learning and Cybernetics (ICMLC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130856086","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
Multi-Task Learning With Localized Generalization Error Model 基于局部泛化误差模型的多任务学习
Pub Date : 2019-07-01 DOI: 10.1109/ICMLC48188.2019.8949255
Wendi Li, Yi Zhu, Ting Wang, Wing W. Y. Ng
In cases, the same or similar network architecture is used to deal with related but different tasks, where tasks come from different statistical distributions in the sample input space and share some common features. Multi-Task Learning (MTL) combines multiple related tasks for training at the same time, so as to learn some shared feature representation among multiple tasks. However, it is difficult to improve each task when statistical distributions of these related tasks are greatly different. This is caused by the difficulty of extracting an effective generalization of feature representation from multiple tasks. Moreover, it also slows down the convergence rate of MTL. Therefore, we propose a MTL method based on the Localized Generalization Error Model (L-GEM). The L-GEM improves the generalization capability of the trained model by minimizing the upper bound of generalization error of it with respect to unseen samples similar to training samples. It also helps to narrow the gap between different tasks due to different statistical distributions in MTL. Experimental results show that the L-GEM speeds up the training process while significantly improves the final convergence results.
在某些情况下,使用相同或相似的网络架构来处理相关但不同的任务,其中任务来自样本输入空间中的不同统计分布,并具有一些共同特征。多任务学习(Multi-Task Learning, MTL)是将多个相关的任务同时组合起来进行训练,从而在多个任务之间学习到一些共有的特征表示。然而,当这些相关任务的统计分布差异很大时,很难对每个任务进行改进。这是由于难以从多个任务中提取有效的特征表示泛化。此外,它还减慢了MTL的收敛速度。因此,我们提出了一种基于局部泛化误差模型(L-GEM)的MTL方法。L-GEM通过最小化训练模型相对于与训练样本相似的未见样本的泛化误差上界来提高训练模型的泛化能力。它还有助于缩小由于MTL中不同的统计分布而导致的不同任务之间的差距。实验结果表明,L-GEM在显著提高最终收敛结果的同时,加快了训练过程。
{"title":"Multi-Task Learning With Localized Generalization Error Model","authors":"Wendi Li, Yi Zhu, Ting Wang, Wing W. Y. Ng","doi":"10.1109/ICMLC48188.2019.8949255","DOIUrl":"https://doi.org/10.1109/ICMLC48188.2019.8949255","url":null,"abstract":"In cases, the same or similar network architecture is used to deal with related but different tasks, where tasks come from different statistical distributions in the sample input space and share some common features. Multi-Task Learning (MTL) combines multiple related tasks for training at the same time, so as to learn some shared feature representation among multiple tasks. However, it is difficult to improve each task when statistical distributions of these related tasks are greatly different. This is caused by the difficulty of extracting an effective generalization of feature representation from multiple tasks. Moreover, it also slows down the convergence rate of MTL. Therefore, we propose a MTL method based on the Localized Generalization Error Model (L-GEM). The L-GEM improves the generalization capability of the trained model by minimizing the upper bound of generalization error of it with respect to unseen samples similar to training samples. It also helps to narrow the gap between different tasks due to different statistical distributions in MTL. Experimental results show that the L-GEM speeds up the training process while significantly improves the final convergence results.","PeriodicalId":221349,"journal":{"name":"2019 International Conference on Machine Learning and Cybernetics (ICMLC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134063374","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
Supervised Link Prediction in Co-Authorship Networks Based on Research Performance and Similarity of Research Interests and Affiliations 基于研究绩效和研究兴趣与隶属关系相似性的合作作者网络监督链接预测
Pub Date : 2019-07-01 DOI: 10.1109/ICMLC48188.2019.8949320
D. Hassan
Predicting the emergence of future research collaborations between authors in academic social network is a very effective example that demonstrates the link prediction problem. This problem refers to predicting the potential existence or absence of link between a pair of nodes in social networks (SN). Since the majority of previous research work on link prediction only considered predictor variables (i.e., features) extracted from SN structure, this paper aims to investigate the impact of using other types of predictor variables on solving link prediction problem in co-authorship network. It proposes a new method for supervised link prediction in co-authorship networks using predictors extracted by: computing the similarity between the research interests of each two author nodes in the network, the similarity between their affiliations, the sum of their research performance indices as well as the similarity between the two author nodes themselves. The preliminary results of our approach show that the sum of research performance indices of two author nodes has the most impact on the performance of supervised link prediction which motivates us to do further analysis on using such a predictor.
预测学术社交网络中作者之间未来研究合作的出现是证明链接预测问题的一个非常有效的例子。该问题是指预测社交网络(SN)中一对节点之间可能存在或不存在链接的问题。由于以往的链路预测研究大多只考虑从SN结构中提取的预测变量(即特征),因此本文旨在研究使用其他类型的预测变量对解决合著网络中链路预测问题的影响。本文提出了一种新的合作作者网络监督链接预测方法,该方法通过计算网络中每个作者节点的研究兴趣之间的相似度、从属关系之间的相似度、研究绩效指标的总和以及两个作者节点之间的相似度来提取预测因子。我们的方法的初步结果表明,两个作者节点的研究绩效指标的总和对监督链接预测的性能影响最大,这激励我们对使用这种预测器进行进一步的分析。
{"title":"Supervised Link Prediction in Co-Authorship Networks Based on Research Performance and Similarity of Research Interests and Affiliations","authors":"D. Hassan","doi":"10.1109/ICMLC48188.2019.8949320","DOIUrl":"https://doi.org/10.1109/ICMLC48188.2019.8949320","url":null,"abstract":"Predicting the emergence of future research collaborations between authors in academic social network is a very effective example that demonstrates the link prediction problem. This problem refers to predicting the potential existence or absence of link between a pair of nodes in social networks (SN). Since the majority of previous research work on link prediction only considered predictor variables (i.e., features) extracted from SN structure, this paper aims to investigate the impact of using other types of predictor variables on solving link prediction problem in co-authorship network. It proposes a new method for supervised link prediction in co-authorship networks using predictors extracted by: computing the similarity between the research interests of each two author nodes in the network, the similarity between their affiliations, the sum of their research performance indices as well as the similarity between the two author nodes themselves. The preliminary results of our approach show that the sum of research performance indices of two author nodes has the most impact on the performance of supervised link prediction which motivates us to do further analysis on using such a predictor.","PeriodicalId":221349,"journal":{"name":"2019 International Conference on Machine Learning and Cybernetics (ICMLC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132947416","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
Detection of Microplastics Using Machine Learning 使用机器学习检测微塑料
Pub Date : 2019-07-01 DOI: 10.1109/ICMLC48188.2019.8949221
Z. Chaczko, Peter Wajs-Chaczko, David Tien, Y. Haidar
Monitoring the presence of micro-plastics in human and animal habitats is fast becoming an important research theme due to a need to preserve healthy ecosystems. Microplastics pollute the environment and can represent a serious threat for biological organisms including the human body, as they can be inadvertently consumed through the food chain. To perceive and understand the level of microplastics pollution threats in the environment there is a need to design and develop reliable methodologies and tools that can detect and classify the different types of the microplastics. This paper presents results of our work related to exploration of methods and techniques useful for detecting suspicious objects in their respective ecosystem captured in hyperspectral images and then classifying these objects with the use of Neural Networks technique.
由于需要保护健康的生态系统,监测人类和动物栖息地中微塑料的存在正迅速成为一个重要的研究主题。微塑料污染环境,并可能对包括人体在内的生物有机体构成严重威胁,因为它们可能在不经意间通过食物链被消耗。为了感知和了解环境中微塑料污染威胁的程度,需要设计和开发可靠的方法和工具,以检测和分类不同类型的微塑料。本文介绍了我们的工作成果,这些成果与探索方法和技术有关,这些方法和技术可用于检测高光谱图像中捕获的各自生态系统中的可疑物体,然后使用神经网络技术对这些物体进行分类。
{"title":"Detection of Microplastics Using Machine Learning","authors":"Z. Chaczko, Peter Wajs-Chaczko, David Tien, Y. Haidar","doi":"10.1109/ICMLC48188.2019.8949221","DOIUrl":"https://doi.org/10.1109/ICMLC48188.2019.8949221","url":null,"abstract":"Monitoring the presence of micro-plastics in human and animal habitats is fast becoming an important research theme due to a need to preserve healthy ecosystems. Microplastics pollute the environment and can represent a serious threat for biological organisms including the human body, as they can be inadvertently consumed through the food chain. To perceive and understand the level of microplastics pollution threats in the environment there is a need to design and develop reliable methodologies and tools that can detect and classify the different types of the microplastics. This paper presents results of our work related to exploration of methods and techniques useful for detecting suspicious objects in their respective ecosystem captured in hyperspectral images and then classifying these objects with the use of Neural Networks technique.","PeriodicalId":221349,"journal":{"name":"2019 International Conference on Machine Learning and Cybernetics (ICMLC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129501424","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}
引用次数: 11
Developing the Interpretability of Deep Artificial Neural Network on Application Problems 开发深度人工神经网络在应用问题上的可解释性
Pub Date : 2019-07-01 DOI: 10.1109/ICMLC48188.2019.8949230
Sheng-An Yang, Meng-Han Yang
In recent years, the use of electronic health records (EHR) has increased dramatically. Mining hidden knowledge in “big data” from EHR has become a subject worthy of exploration. On the other hand, many recent applications used deep artificial neural network (ANN) to analyze EHR data and yielded great performance. Accordingly, this study developed functional models using deep ANN, and tried to validate effectiveness of this method in regression analysis and classification problem. Based on datasets downloaded from the UC Irvine Machine Learning Repository, the output mean squared error value 0.840 was within the range of one variance for the regression analysis. Similarly, the prediction accuracy 73.0% on the testing data was reported for the classification problem. Another focus of this study was identifying critical attributes using the layer-wise relevance propagation (LRP) algorithm to improve interpretability of deep ANN. According to evaluation outcomes, the identified features would match with those recognized by univariate analysis. In summary, effectiveness of deep ANN and LRP on application problems has been validated in this study.
近年来,电子健康记录(EHR)的使用急剧增加。从电子病历中挖掘“大数据”中隐藏的知识已经成为一个值得探索的课题。另一方面,近年来许多应用使用深度人工神经网络(ANN)来分析电子病历数据,并取得了很好的效果。因此,本研究利用深度神经网络建立了功能模型,并试图验证该方法在回归分析和分类问题中的有效性。基于从UC Irvine Machine Learning Repository下载的数据集,输出的均方误差值0.840在一个方差的范围内进行回归分析。同样,对于分类问题,在测试数据上的预测准确率为73.0%。本研究的另一个重点是使用分层相关传播(LRP)算法识别关键属性,以提高深度人工神经网络的可解释性。根据评价结果,识别出的特征与单变量分析识别出的特征相匹配。综上所述,本研究验证了深度神经网络和LRP在应用问题上的有效性。
{"title":"Developing the Interpretability of Deep Artificial Neural Network on Application Problems","authors":"Sheng-An Yang, Meng-Han Yang","doi":"10.1109/ICMLC48188.2019.8949230","DOIUrl":"https://doi.org/10.1109/ICMLC48188.2019.8949230","url":null,"abstract":"In recent years, the use of electronic health records (EHR) has increased dramatically. Mining hidden knowledge in “big data” from EHR has become a subject worthy of exploration. On the other hand, many recent applications used deep artificial neural network (ANN) to analyze EHR data and yielded great performance. Accordingly, this study developed functional models using deep ANN, and tried to validate effectiveness of this method in regression analysis and classification problem. Based on datasets downloaded from the UC Irvine Machine Learning Repository, the output mean squared error value 0.840 was within the range of one variance for the regression analysis. Similarly, the prediction accuracy 73.0% on the testing data was reported for the classification problem. Another focus of this study was identifying critical attributes using the layer-wise relevance propagation (LRP) algorithm to improve interpretability of deep ANN. According to evaluation outcomes, the identified features would match with those recognized by univariate analysis. In summary, effectiveness of deep ANN and LRP on application problems has been validated in this study.","PeriodicalId":221349,"journal":{"name":"2019 International Conference on Machine Learning and Cybernetics (ICMLC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125102898","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
Numeric Prediction of Dissolved Oxygen Status Through Two-Stage Training for Classification-Driven Regression 基于分类驱动回归的两阶段训练的溶解氧状态数值预测
Pub Date : 2019-07-01 DOI: 10.1109/ICMLC48188.2019.8949196
Pengfei Guo, Han Liu, Shuangyin Liu, Longqin Xu
Dissolved oxygen of aquaculture is an important measure of the quality of culture environment and how aquatic products have been grown. In the machine learning context, the above measure can be achieved by defining a regression problem, which aims at numerical prediction of the dissolved oxygen status. In general, the vast majority of popular machine learning algorithms were designed for undertaking classification tasks. In order to effectively adopt the popular machine learning algorithms for the above-mentioned numerical prediction, in this paper, we propose a two-stage training approach that involves transforming a regression problem into a classification problem and then transforming it back to regression problem. In particular, unsupervised discretization of continuous attributes is adopted at the first stage to transform the target (numeric) attribute into a discrete (nominal) one with several intervals, such that popular machine learning algorithms can be used to predict the interval to which an instance belongs in the setting of a classification task. Furthermore, based on the classification result at the first stage, some of the instances within the predicted interval are selected for training at the second stage towards numerical prediction of the target attribute value of each instance. An experimental study is conducted to investigate in general the effectiveness of the popular learning algorithms in the numerical prediction task and also analyze how the increase of the number of training instances (selected at the second training stage) can impact on the final prediction performance. The results show that the adoption of decision tree learning and neural networks lead to better and more stable performance than Naive Bayes, K Nearest Neighbours and Support Vector Machine.
水产养殖溶解氧是衡量养殖环境质量和水产品生长状况的重要指标。在机器学习上下文中,上述措施可以通过定义一个回归问题来实现,该问题旨在对溶解氧状态进行数值预测。一般来说,绝大多数流行的机器学习算法都是为执行分类任务而设计的。为了有效地采用流行的机器学习算法进行上述数值预测,在本文中,我们提出了一种两阶段训练方法,将回归问题转化为分类问题,然后再将其转化为回归问题。特别是,在第一阶段采用连续属性的无监督离散化,将目标(数值)属性转换为具有多个区间的离散(标称)属性,从而可以使用流行的机器学习算法来预测分类任务设置中实例所属的区间。在第一阶段分类结果的基础上,选择预测区间内的部分实例进行第二阶段的训练,对每个实例的目标属性值进行数值预测。通过实验研究,研究了目前流行的学习算法在数值预测任务中的有效性,并分析了在第二训练阶段选择的训练实例数量的增加对最终预测性能的影响。结果表明,决策树学习和神经网络的采用比朴素贝叶斯、K近邻和支持向量机的性能更好、更稳定。
{"title":"Numeric Prediction of Dissolved Oxygen Status Through Two-Stage Training for Classification-Driven Regression","authors":"Pengfei Guo, Han Liu, Shuangyin Liu, Longqin Xu","doi":"10.1109/ICMLC48188.2019.8949196","DOIUrl":"https://doi.org/10.1109/ICMLC48188.2019.8949196","url":null,"abstract":"Dissolved oxygen of aquaculture is an important measure of the quality of culture environment and how aquatic products have been grown. In the machine learning context, the above measure can be achieved by defining a regression problem, which aims at numerical prediction of the dissolved oxygen status. In general, the vast majority of popular machine learning algorithms were designed for undertaking classification tasks. In order to effectively adopt the popular machine learning algorithms for the above-mentioned numerical prediction, in this paper, we propose a two-stage training approach that involves transforming a regression problem into a classification problem and then transforming it back to regression problem. In particular, unsupervised discretization of continuous attributes is adopted at the first stage to transform the target (numeric) attribute into a discrete (nominal) one with several intervals, such that popular machine learning algorithms can be used to predict the interval to which an instance belongs in the setting of a classification task. Furthermore, based on the classification result at the first stage, some of the instances within the predicted interval are selected for training at the second stage towards numerical prediction of the target attribute value of each instance. An experimental study is conducted to investigate in general the effectiveness of the popular learning algorithms in the numerical prediction task and also analyze how the increase of the number of training instances (selected at the second training stage) can impact on the final prediction performance. The results show that the adoption of decision tree learning and neural networks lead to better and more stable performance than Naive Bayes, K Nearest Neighbours and Support Vector Machine.","PeriodicalId":221349,"journal":{"name":"2019 International Conference on Machine Learning and Cybernetics (ICMLC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124279161","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
Exploring and Evaluating the Scalability and Eficinecy of Apache Spark Using Educational Datasets 利用教育数据集探索和评估Apache Spark的可扩展性和效率
Pub Date : 2019-07-01 DOI: 10.1109/ICMLC48188.2019.8949260
Jian Zhang, Zijiang Yang, Y. Benslimane
The combination of data mining and machine learning technology with web-based education system is becoming an imperative research area to enhance the quality of education beyond the traditional concept. With the worldwide fast growth of the Information Communication Technology (ICT), data come with significant large volume, high velocity and extensive variety. In this paper, four popular data mining methods are applied on Apache Spark using large volume of datasets from Online Cognitive Learning Systems to explore the scalability and efficiency of Spark. Various volumes of datasets are tested on Spark MLlib with different running configurations and parameter tunings. The output of the paper convincingly presents useful strategies of computing resource allocation and tuning to make full advantage of the in-memory system of Apache Spark with the tasks of data mining and machine learning on educational datasets.
将数据挖掘和机器学习技术与基于网络的教育系统相结合,正在成为超越传统观念提高教育质量的一个势在必行的研究领域。随着信息通信技术(ICT)在世界范围内的快速发展,数据量大、速度快、种类多。本文利用来自Online Cognitive Learning Systems的大量数据集,将四种流行的数据挖掘方法应用到Apache Spark上,探索Spark的可扩展性和效率。在Spark MLlib上使用不同的运行配置和参数调优测试了不同数量的数据集。本文的结果令人信服地提出了有效的计算资源分配和调优策略,以充分利用Apache Spark内存系统在教育数据集上的数据挖掘和机器学习任务。
{"title":"Exploring and Evaluating the Scalability and Eficinecy of Apache Spark Using Educational Datasets","authors":"Jian Zhang, Zijiang Yang, Y. Benslimane","doi":"10.1109/ICMLC48188.2019.8949260","DOIUrl":"https://doi.org/10.1109/ICMLC48188.2019.8949260","url":null,"abstract":"The combination of data mining and machine learning technology with web-based education system is becoming an imperative research area to enhance the quality of education beyond the traditional concept. With the worldwide fast growth of the Information Communication Technology (ICT), data come with significant large volume, high velocity and extensive variety. In this paper, four popular data mining methods are applied on Apache Spark using large volume of datasets from Online Cognitive Learning Systems to explore the scalability and efficiency of Spark. Various volumes of datasets are tested on Spark MLlib with different running configurations and parameter tunings. The output of the paper convincingly presents useful strategies of computing resource allocation and tuning to make full advantage of the in-memory system of Apache Spark with the tasks of data mining and machine learning on educational datasets.","PeriodicalId":221349,"journal":{"name":"2019 International Conference on Machine Learning and Cybernetics (ICMLC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116601904","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
期刊
2019 International Conference on Machine Learning and Cybernetics (ICMLC)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1