首页 > 最新文献

2018 3rd International Conference on Computational Intelligence and Applications (ICCIA)最新文献

英文 中文
An Implicit Knowledge Oriented Algorithm for Learning Path Recommendation 一种面向知识的隐式学习路径推荐算法
Yapeng Huang, Jun Shen
Focusing on the lack of implicit knowledge teaching in online teaching activities and combining related research achievements of learning theory and knowledge model, this paper proposes an algorithm for learning path recommendation which is based on ant colony algorithm. Comprehensively considering the students' cognitive style, knowledge basis and group preference, this algorithm takes implicit knowledge as the essential learning goal and recommends personalized learning paths to them. The experimental results prove that the algorithm can effectively improve students' academic performance and learning efficiency.
针对网络教学活动中隐性知识教学的不足,结合学习理论和知识模型的相关研究成果,提出了一种基于蚁群算法的学习路径推荐算法。该算法综合考虑学生的认知方式、知识基础和群体偏好,以隐性知识为基本学习目标,为学生推荐个性化的学习路径。实验结果证明,该算法能有效提高学生的学习成绩和学习效率。
{"title":"An Implicit Knowledge Oriented Algorithm for Learning Path Recommendation","authors":"Yapeng Huang, Jun Shen","doi":"10.1109/ICCIA.2018.00015","DOIUrl":"https://doi.org/10.1109/ICCIA.2018.00015","url":null,"abstract":"Focusing on the lack of implicit knowledge teaching in online teaching activities and combining related research achievements of learning theory and knowledge model, this paper proposes an algorithm for learning path recommendation which is based on ant colony algorithm. Comprehensively considering the students' cognitive style, knowledge basis and group preference, this algorithm takes implicit knowledge as the essential learning goal and recommends personalized learning paths to them. The experimental results prove that the algorithm can effectively improve students' academic performance and learning efficiency.","PeriodicalId":297098,"journal":{"name":"2018 3rd International Conference on Computational Intelligence and Applications (ICCIA)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115192497","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
ICCIA 2018 Preface
{"title":"ICCIA 2018 Preface","authors":"","doi":"10.1109/iccia.2018.00005","DOIUrl":"https://doi.org/10.1109/iccia.2018.00005","url":null,"abstract":"","PeriodicalId":297098,"journal":{"name":"2018 3rd International Conference on Computational Intelligence and Applications (ICCIA)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130011052","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
Eye Fixation Related Cognitive Activities for Detecting Targets in Remote Sensing Images 遥感图像中目标检测的眼注视相关认知活动
Xiaojuan Wang, Ying Zeng, Jun Shu, Chi Zhang, Bin Yan
Eye movements obtained during eye tracking include both the fixation location and cognitive activities of the subject when viewing the remote sensing images. Aiming at the problem that the existing region of interest analysis methods based on the eye movement do not determine whether the area contains targets or not, in this paper a method was presented to predict the targets in the regions of interest using cognitive activities from eye movement. The method realized the detection and location of targets in remote-sensing images through the combination of fixation location and cognitive activity in eye movements. Experiments showed that the cognitive activities related to fixations make significant contribution to target prediction in the remote sensing image with complex backgrounds.
眼动追踪获得的眼动既包括被测者在观看遥感图像时的注视位置,也包括被测者的认知活动。针对现有的基于眼动的兴趣区域分析方法无法判断该区域是否包含目标的问题,本文提出了一种利用眼动的认知活动来预测兴趣区域中目标的方法。该方法通过视动定位与眼动认知活动相结合,实现了遥感图像中目标的检测与定位。实验表明,在复杂背景的遥感图像中,注视相关的认知活动对目标预测有重要贡献。
{"title":"Eye Fixation Related Cognitive Activities for Detecting Targets in Remote Sensing Images","authors":"Xiaojuan Wang, Ying Zeng, Jun Shu, Chi Zhang, Bin Yan","doi":"10.1109/ICCIA.2018.00039","DOIUrl":"https://doi.org/10.1109/ICCIA.2018.00039","url":null,"abstract":"Eye movements obtained during eye tracking include both the fixation location and cognitive activities of the subject when viewing the remote sensing images. Aiming at the problem that the existing region of interest analysis methods based on the eye movement do not determine whether the area contains targets or not, in this paper a method was presented to predict the targets in the regions of interest using cognitive activities from eye movement. The method realized the detection and location of targets in remote-sensing images through the combination of fixation location and cognitive activity in eye movements. Experiments showed that the cognitive activities related to fixations make significant contribution to target prediction in the remote sensing image with complex backgrounds.","PeriodicalId":297098,"journal":{"name":"2018 3rd International Conference on Computational Intelligence and Applications (ICCIA)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117083199","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
The Improved Estimation of Distribution Algorithms for Community Detection 社区检测中改进的分布估计算法
Ben-Da Zhou, Zhao Pan, Zhang Jinbo
Based on the analysis of local monotonic of modularity function, this paper designs a fast and effective mutation operator, and then proposes an improved Estimation of Distribution Algorithm (EDA) for solving community detection problem. The proposed algorithm is tested on basic network and big scale complex network. Experimental results show that this algorithm can get 0.419 8 for the average Q function while running 100 times, has better performance than Girvan-Newman(GN) algorithm, Fast Newman (FN) algorithm and Tasgin Genetic Algorithm (TGA).
在分析模块化函数局部单调性的基础上,设计了一种快速有效的变异算子,并在此基础上提出了一种改进的分布估计算法(EDA)来解决社团检测问题。在基本网络和大规模复杂网络上对该算法进行了测试。实验结果表明,该算法在运行100次时平均Q函数可得到0.419 8,性能优于Girvan-Newman(GN)算法、Fast Newman(FN)算法和Tasgin Genetic algorithm (TGA)算法。
{"title":"The Improved Estimation of Distribution Algorithms for Community Detection","authors":"Ben-Da Zhou, Zhao Pan, Zhang Jinbo","doi":"10.1109/iccia.2018.00021","DOIUrl":"https://doi.org/10.1109/iccia.2018.00021","url":null,"abstract":"Based on the analysis of local monotonic of modularity function, this paper designs a fast and effective mutation operator, and then proposes an improved Estimation of Distribution Algorithm (EDA) for solving community detection problem. The proposed algorithm is tested on basic network and big scale complex network. Experimental results show that this algorithm can get 0.419 8 for the average Q function while running 100 times, has better performance than Girvan-Newman(GN) algorithm, Fast Newman (FN) algorithm and Tasgin Genetic Algorithm (TGA).","PeriodicalId":297098,"journal":{"name":"2018 3rd International Conference on Computational Intelligence and Applications (ICCIA)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121453694","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
Title Page iii 第三页标题
{"title":"Title Page iii","authors":"","doi":"10.1109/iccia.2018.00002","DOIUrl":"https://doi.org/10.1109/iccia.2018.00002","url":null,"abstract":"","PeriodicalId":297098,"journal":{"name":"2018 3rd International Conference on Computational Intelligence and Applications (ICCIA)","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124156705","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
A Network-Based Recommendation Algorithm 基于网络的推荐算法
Xiangguang Dai, Yingji Cui, Zheng Chen, Yi Yang
As Internet expanding into offline, the traditional retail industry began to use the personalized recommendation algorithm to increase user stickiness, conversion and business income. Without considering the data segmentation problem, traditional recommendation algorithm did not perform well in the traditional business data. Accordingly, we considered the interest spread characteristic of retail industry behavior, adopted the method of complex network to construct a personalized recommendation algorithm using the segmentation data set. By using a real sales dataset of a large supermarket, we provided an evaluation of our algorithm. The results show that our algorithm have much better performance in accuracy and recall than the traditional ones, but with the disadvantage of being less coverage.
随着互联网向线下扩张,传统零售行业开始使用个性化推荐算法来增加用户粘性、转化率和业务收入。传统的推荐算法在没有考虑数据分割问题的情况下,在传统的商业数据中表现不佳。据此,我们考虑零售行业行为的兴趣扩散特征,采用复杂网络的方法,利用分割数据集构建个性化推荐算法。通过使用一个大型超市的真实销售数据集,我们对我们的算法进行了评估。结果表明,该算法在准确率和查全率方面均优于传统算法,但存在覆盖范围小的缺点。
{"title":"A Network-Based Recommendation Algorithm","authors":"Xiangguang Dai, Yingji Cui, Zheng Chen, Yi Yang","doi":"10.1109/iccia.2018.00018","DOIUrl":"https://doi.org/10.1109/iccia.2018.00018","url":null,"abstract":"As Internet expanding into offline, the traditional retail industry began to use the personalized recommendation algorithm to increase user stickiness, conversion and business income. Without considering the data segmentation problem, traditional recommendation algorithm did not perform well in the traditional business data. Accordingly, we considered the interest spread characteristic of retail industry behavior, adopted the method of complex network to construct a personalized recommendation algorithm using the segmentation data set. By using a real sales dataset of a large supermarket, we provided an evaluation of our algorithm. The results show that our algorithm have much better performance in accuracy and recall than the traditional ones, but with the disadvantage of being less coverage.","PeriodicalId":297098,"journal":{"name":"2018 3rd International Conference on Computational Intelligence and Applications (ICCIA)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126445480","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
Development of Dynamic Intelligent Risk Management Approach 动态智能风险管理方法的发展
Azadeh Sarkheyli, Arezoo Sarkheyli-Hägele, W. Song
A dynamic Risk Management (RM) provides monitoring, recognition, assessment, and follow-up action to reduce the risk whenever it rises. The main problem with dynamic RM (when applied to plan for, how the unknown risk in unexpected conditions should be addressed in information systems) is to design an especial control to recover/avoid of risks/attacks that is proposed in this research. The methodology, called Dynamic Intelligent RM (DIRM) is comprised of four phases which are interactively linked; (1) Aggregation of data and information (2) Risk identification (3) RM using an optional control and (4) RM using an especial control. This study, therefore, investigated the use of artificial neural networks to improve risk identification via adaptive neural fuzzy interface systems and control specification using learning vector quantization. Further experimental investigations are needed to estimate the results of DIRM toward unexpected conditions in the real environment.
动态风险管理(RM)提供监控、识别、评估和后续行动,以便在风险上升时降低风险。动态风险管理的主要问题(当应用于计划时,如何处理信息系统中意外情况下的未知风险)是设计一个特殊的控制来恢复/避免风险/攻击,这是本研究提出的。该方法被称为动态智能RM (DIRM),由四个相互关联的阶段组成;(1)数据和信息的汇总(2)风险识别(3)使用可选控制的风险管理和(4)使用特殊控制的风险管理。因此,本研究探讨了利用人工神经网络通过自适应神经模糊接口系统和学习向量量化控制规范来改进风险识别。需要进一步的实验研究来估计DIRM在真实环境中针对意外条件的结果。
{"title":"Development of Dynamic Intelligent Risk Management Approach","authors":"Azadeh Sarkheyli, Arezoo Sarkheyli-Hägele, W. Song","doi":"10.1109/ICCIA.2018.00031","DOIUrl":"https://doi.org/10.1109/ICCIA.2018.00031","url":null,"abstract":"A dynamic Risk Management (RM) provides monitoring, recognition, assessment, and follow-up action to reduce the risk whenever it rises. The main problem with dynamic RM (when applied to plan for, how the unknown risk in unexpected conditions should be addressed in information systems) is to design an especial control to recover/avoid of risks/attacks that is proposed in this research. The methodology, called Dynamic Intelligent RM (DIRM) is comprised of four phases which are interactively linked; (1) Aggregation of data and information (2) Risk identification (3) RM using an optional control and (4) RM using an especial control. This study, therefore, investigated the use of artificial neural networks to improve risk identification via adaptive neural fuzzy interface systems and control specification using learning vector quantization. Further experimental investigations are needed to estimate the results of DIRM toward unexpected conditions in the real environment.","PeriodicalId":297098,"journal":{"name":"2018 3rd International Conference on Computational Intelligence and Applications (ICCIA)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122069878","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
A Human Intelligence Inspired Meta Heuristic Optimization Algorithm for TSPs 基于人类智能的tsp元启发式优化算法
Feng-Cheng Yang, Ren-Fu Li
This paper presents a novel heuristic optimization algorithm for discrete optimization problems, the Bandwidth Restricted Transmission-Simulated Optimization Algorithm (BRT-S). This algorithm imitates the intellective behaviors of human in managing network transmission. BRT-S is a constructive heuristic algorithm whose optimization procedures simulate processes of data transferring and management operations over the network. A population of solution agents mimicking message transmitters on networks is deployed to quest for optimal solutions. The algorithm however restricts the resource utilized in solution search mimicking the bandwidth resource is limited in network transmission. As a result, agents must compete with others to obtain solution construction resources. Due to the mimicked bandwidth restriction, not every agent is able to complete a solution construction. Only constructed solutions are subject to objective value evaluations. In each evolution iteration, bandwidth resources are separately modulated by conducting bandwidth deterioration, enhancement, or depletion, on the basis of the solution qualities obtained. To illustrate the operation procedures of the algorithm, a BRT-S computation model for solving the Traveling Salesman Problem is presented and the solving system is implemented for benchmark testing. Numerical results of the tests indicate that given similar computation resources, the algorithm generates better solutions than other meta heuristic algorithms, such as ACO and GA.
本文提出了一种求解离散优化问题的启发式优化算法——带宽受限传输模拟优化算法(BRT-S)。该算法模仿人类在网络传输管理中的智能行为。BRT-S是一种建设性启发式算法,其优化过程模拟了网络上的数据传输和管理操作过程。在网络上部署一群模拟消息发送器的解决方案代理来寻求最优解决方案。然而,该算法对解搜索的资源利用进行了限制,模拟了网络传输中带宽资源的有限性。因此,代理商必须与其他代理商竞争以获得解决方案构建资源。由于模拟带宽的限制,并非每个代理都能够完成解决方案的构建。只有构建的解决方案才会受到客观价值评估的影响。在每个演化迭代中,带宽资源根据所获得的解决方案质量分别通过带宽衰减、增强或耗尽进行调制。为了说明算法的操作过程,提出了求解旅行商问题的BRT-S计算模型,并对求解系统进行了基准测试。数值实验结果表明,在计算资源相似的情况下,该算法的解优于蚁群算法和遗传算法等元启发式算法。
{"title":"A Human Intelligence Inspired Meta Heuristic Optimization Algorithm for TSPs","authors":"Feng-Cheng Yang, Ren-Fu Li","doi":"10.1109/ICCIA.2018.00016","DOIUrl":"https://doi.org/10.1109/ICCIA.2018.00016","url":null,"abstract":"This paper presents a novel heuristic optimization algorithm for discrete optimization problems, the Bandwidth Restricted Transmission-Simulated Optimization Algorithm (BRT-S). This algorithm imitates the intellective behaviors of human in managing network transmission. BRT-S is a constructive heuristic algorithm whose optimization procedures simulate processes of data transferring and management operations over the network. A population of solution agents mimicking message transmitters on networks is deployed to quest for optimal solutions. The algorithm however restricts the resource utilized in solution search mimicking the bandwidth resource is limited in network transmission. As a result, agents must compete with others to obtain solution construction resources. Due to the mimicked bandwidth restriction, not every agent is able to complete a solution construction. Only constructed solutions are subject to objective value evaluations. In each evolution iteration, bandwidth resources are separately modulated by conducting bandwidth deterioration, enhancement, or depletion, on the basis of the solution qualities obtained. To illustrate the operation procedures of the algorithm, a BRT-S computation model for solving the Traveling Salesman Problem is presented and the solving system is implemented for benchmark testing. Numerical results of the tests indicate that given similar computation resources, the algorithm generates better solutions than other meta heuristic algorithms, such as ACO and GA.","PeriodicalId":297098,"journal":{"name":"2018 3rd International Conference on Computational Intelligence and Applications (ICCIA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129388668","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
The Determination of MRT (Mass Rapid Transit) Jakarta Train Specification to Reach Headway Target by Using ProModel 利用ProModel确定雅加达地铁列车达到车头距目标的规格
Vidya Diantorio Putri, K. Komarudin, A. R. Destyanto
Mass Rapid Transit (MRT) Jakarta is one of the new urban transportation in Greater Jakarta area which will be operated in early 2019. The development period has been started in 2010. A research has been conducted to determine its train specification, including train set and car number in 2010. Time revealed that the based data for that research, forecasted number of Jakarta population, is not fits the actual number. This research goal is to determine the train specification, which are the number of MRT Jakarta train set and number of car for each train set to reach its headway target by considering MRT Jakarta daily passenger target based on actual number of Jakarta population. The researcher uses ProModel 7.5 as the tool to simulate 12 optional policy. These 12 optional policies is made of combined three control variable, which are train set, car number, and headway. Researcher use the number of passenger compared to MRT Jakarta daily passenger target as the indicator to choose the best policy. Based on the result of this research, the best train specification policy that could reach the 5 minutes headway MRT Jakarta target is 7 train set and 6 cars for each set.
雅加达捷运(MRT)是大雅加达地区的新型城市交通之一,将于2019年初投入运营。开发期从2010年开始。研究确定了2010年的列车规格,包括车组和车次。《时代周刊》透露,该研究的基础数据,即雅加达人口的预测数量,与实际数字不符。本研究的目标是根据雅加达的实际人口数量,考虑雅加达MRT的日客运目标,确定雅加达MRT的列车规格,即雅加达MRT列车组的数量和每个列车组达到车头时距目标的车辆数量。研究者使用promodel7.5作为工具模拟了12个可选策略。这12个可选策略是由三个控制变量组合而成的,这三个控制变量是车组、车号和车头距。研究人员将乘客数量与雅加达捷运的每日乘客目标进行比较,作为选择最佳政策的指标。基于本文的研究结果,雅加达捷运达到5分钟车头目标的最佳列车规格政策为7组列车,每组6节车厢。
{"title":"The Determination of MRT (Mass Rapid Transit) Jakarta Train Specification to Reach Headway Target by Using ProModel","authors":"Vidya Diantorio Putri, K. Komarudin, A. R. Destyanto","doi":"10.1109/ICCIA.2018.00011","DOIUrl":"https://doi.org/10.1109/ICCIA.2018.00011","url":null,"abstract":"Mass Rapid Transit (MRT) Jakarta is one of the new urban transportation in Greater Jakarta area which will be operated in early 2019. The development period has been started in 2010. A research has been conducted to determine its train specification, including train set and car number in 2010. Time revealed that the based data for that research, forecasted number of Jakarta population, is not fits the actual number. This research goal is to determine the train specification, which are the number of MRT Jakarta train set and number of car for each train set to reach its headway target by considering MRT Jakarta daily passenger target based on actual number of Jakarta population. The researcher uses ProModel 7.5 as the tool to simulate 12 optional policy. These 12 optional policies is made of combined three control variable, which are train set, car number, and headway. Researcher use the number of passenger compared to MRT Jakarta daily passenger target as the indicator to choose the best policy. Based on the result of this research, the best train specification policy that could reach the 5 minutes headway MRT Jakarta target is 7 train set and 6 cars for each set.","PeriodicalId":297098,"journal":{"name":"2018 3rd International Conference on Computational Intelligence and Applications (ICCIA)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127032989","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
Predicting Unmeasured Region of the Efficiency Map of a Speed Reducer Using a Denoising Auto-Encoder 用去噪自编码器预测减速机效率图的未测区
Crino Shin, J. Yun, Seunghyun Jeong, Yongsik Jin
This paper presents a Remaining Useful Life (RUL) prediction method for a speed reducer based on denoising au- to-encoder (DAE). Constructing the efficiency map of the re- ducer is an important process for predicting the life span. However, due to the situational constraints that occur, un- measured intervals hinder the completion of the efficiency map. to solve this problem, we propose a method that can pre- dict and reconstruct an unmeasured interval effectively and reliably by using DAE. In addition, we examine the applicabil- ity of the proposed algorithm through experiments that assume various situations.
提出了一种基于自编码去噪(DAE)的减速器剩余使用寿命预测方法。构建减速器的效率图是预测减速器寿命的重要步骤。然而,由于发生的情景约束,未测量的间隔阻碍了效率图的完成。为了解决这一问题,我们提出了一种利用DAE有效可靠地预测和重建未测区间的方法。此外,我们通过假设各种情况的实验来检验所提出算法的适用性。
{"title":"Predicting Unmeasured Region of the Efficiency Map of a Speed Reducer Using a Denoising Auto-Encoder","authors":"Crino Shin, J. Yun, Seunghyun Jeong, Yongsik Jin","doi":"10.1109/ICCIA.2018.00030","DOIUrl":"https://doi.org/10.1109/ICCIA.2018.00030","url":null,"abstract":"This paper presents a Remaining Useful Life (RUL) prediction method for a speed reducer based on denoising au- to-encoder (DAE). Constructing the efficiency map of the re- ducer is an important process for predicting the life span. However, due to the situational constraints that occur, un- measured intervals hinder the completion of the efficiency map. to solve this problem, we propose a method that can pre- dict and reconstruct an unmeasured interval effectively and reliably by using DAE. In addition, we examine the applicabil- ity of the proposed algorithm through experiments that assume various situations.","PeriodicalId":297098,"journal":{"name":"2018 3rd International Conference on Computational Intelligence and Applications (ICCIA)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126019877","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
期刊
2018 3rd International Conference on Computational Intelligence and Applications (ICCIA)
全部 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