Pub Date : 2011-06-21DOI: 10.1109/WCICA.2011.5970732
Yuling Pei, Jianchao Bi, Bing Yu
In view of shortage of water resource, the human has been seriously faced to survivorship menace, and it makes the reclamation of waste water resource getting very important. Aimed at the complexity of sewerage disposing process, the paper proposed a sort of fusion control strategy based on human simulated intelligence (HSI). In the paper, it is anatomized to chemical and bio-chemical process of sewerage disposing. And based on the comparison among control strategies, it is explored to the fusion control strategy and engineering control algorithm based on HSI. The results of simulation and experience show that it is high in control precision, and strong in robustness for the HSI based fusion control strategy. And therefore it is feasible and valid for control of sewerage disposing process.
{"title":"Application research on fusion control strategy in subsurface sewage disposal system","authors":"Yuling Pei, Jianchao Bi, Bing Yu","doi":"10.1109/WCICA.2011.5970732","DOIUrl":"https://doi.org/10.1109/WCICA.2011.5970732","url":null,"abstract":"In view of shortage of water resource, the human has been seriously faced to survivorship menace, and it makes the reclamation of waste water resource getting very important. Aimed at the complexity of sewerage disposing process, the paper proposed a sort of fusion control strategy based on human simulated intelligence (HSI). In the paper, it is anatomized to chemical and bio-chemical process of sewerage disposing. And based on the comparison among control strategies, it is explored to the fusion control strategy and engineering control algorithm based on HSI. The results of simulation and experience show that it is high in control precision, and strong in robustness for the HSI based fusion control strategy. And therefore it is feasible and valid for control of sewerage disposing process.","PeriodicalId":211049,"journal":{"name":"2011 9th World Congress on Intelligent Control and Automation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131378731","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}
Pub Date : 2011-06-21DOI: 10.1109/WCICA.2011.5970578
Lingbo Lu, Yang Liu, Jingshan Li, Cindy Chang, S. Biller, G. Xiao
In this paper, we carry out a simulation study to integrate preventive maintenance scheduling policy with real-time production system analysis and workforce dispatching rule to investigate the impact of such a policy on system productivity. The preventive maintenance is triggered by the threshold of number of breakdowns and current up- and downstream buffer status, with the maintenance workforce being dispatched based on dynamic bottleneck policy. It is shown that the system performance can be improved by implementing such a real-time scheduling policy.
{"title":"A real-time maintenance scheduling policy in serial production lines","authors":"Lingbo Lu, Yang Liu, Jingshan Li, Cindy Chang, S. Biller, G. Xiao","doi":"10.1109/WCICA.2011.5970578","DOIUrl":"https://doi.org/10.1109/WCICA.2011.5970578","url":null,"abstract":"In this paper, we carry out a simulation study to integrate preventive maintenance scheduling policy with real-time production system analysis and workforce dispatching rule to investigate the impact of such a policy on system productivity. The preventive maintenance is triggered by the threshold of number of breakdowns and current up- and downstream buffer status, with the maintenance workforce being dispatched based on dynamic bottleneck policy. It is shown that the system performance can be improved by implementing such a real-time scheduling policy.","PeriodicalId":211049,"journal":{"name":"2011 9th World Congress on Intelligent Control and Automation","volume":"218 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131543066","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}
Pub Date : 2011-06-21DOI: 10.1109/WCICA.2011.5970705
D. Navarro-Alarcon, Yunhui Liu, Peng Li
In this paper we employ passivity-based control techniques to guarantee the stable manipulation of a constrained robotic endoscope holder. The system's modelling and the control synthesis are realised under the port-Hamiltonian formulation. Where a desired form of the closed-loop energy is enforced such that its local equilibrium implies the application of the desired force to the environment (patient's nostril), while regulating the endoscope unconstrained position and orientation inside the nasal cavity. This allows to set a specific energetic relation between the controlled robot and the environment, which in turn means a safer interaction with the tissue. Simulation and experimental results are presented to validate the theoretical concepts.
{"title":"Stable force/position control of a robotic endoscope holder for constrained tasks in nasal surgery","authors":"D. Navarro-Alarcon, Yunhui Liu, Peng Li","doi":"10.1109/WCICA.2011.5970705","DOIUrl":"https://doi.org/10.1109/WCICA.2011.5970705","url":null,"abstract":"In this paper we employ passivity-based control techniques to guarantee the stable manipulation of a constrained robotic endoscope holder. The system's modelling and the control synthesis are realised under the port-Hamiltonian formulation. Where a desired form of the closed-loop energy is enforced such that its local equilibrium implies the application of the desired force to the environment (patient's nostril), while regulating the endoscope unconstrained position and orientation inside the nasal cavity. This allows to set a specific energetic relation between the controlled robot and the environment, which in turn means a safer interaction with the tissue. Simulation and experimental results are presented to validate the theoretical concepts.","PeriodicalId":211049,"journal":{"name":"2011 9th World Congress on Intelligent Control and Automation","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127718373","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}
Pub Date : 2011-06-21DOI: 10.1109/WCICA.2011.5970553
Jzau-Sheng Lin, P. Liu, Yu-Yi Liao, S. Tai
We present the novel method for automatic illumination compensation of color photos. Firstly, we suppose the photo has its own reference luminance level to get the characteristic luminance of each pixel by subtracting reference luminance level from original luminance. Next, the calibrated luminance is obtained by adjusting the characteristic luminance according to expected target luminance. The straight lines or oblique lines in photo are causing the HALO artifact. Therefore, the proposed method also reduces the HALO artifact using applying alpha blending original luminance and reference luminance level. Finally, we also provide the different resulted photos that are based on human perception by applying various proportions of alpha blending original image and fix layer.
{"title":"Automatic illumination compensation of color photos","authors":"Jzau-Sheng Lin, P. Liu, Yu-Yi Liao, S. Tai","doi":"10.1109/WCICA.2011.5970553","DOIUrl":"https://doi.org/10.1109/WCICA.2011.5970553","url":null,"abstract":"We present the novel method for automatic illumination compensation of color photos. Firstly, we suppose the photo has its own reference luminance level to get the characteristic luminance of each pixel by subtracting reference luminance level from original luminance. Next, the calibrated luminance is obtained by adjusting the characteristic luminance according to expected target luminance. The straight lines or oblique lines in photo are causing the HALO artifact. Therefore, the proposed method also reduces the HALO artifact using applying alpha blending original luminance and reference luminance level. Finally, we also provide the different resulted photos that are based on human perception by applying various proportions of alpha blending original image and fix layer.","PeriodicalId":211049,"journal":{"name":"2011 9th World Congress on Intelligent Control and Automation","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132787453","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}
Pub Date : 2011-06-21DOI: 10.1109/WCICA.2011.5970609
Kao-Shing Hwang, Yu-Jen Chen, Wei-Cheng Jiang
Reinforcement learning is one of the more prominent machine learning technologies due to its unsupervised learning structure and ability to continually learn, even in a dynamic operating environment. Applying this learning to cooperative multi-agent systems not only allows each individual agent to learn from its own experience, but also offers the opportunity for the individual agents to learn from the other agents in the system to increase the speed of learning can be accelerated. In the proposed learning algorithm, an agent store its experience in terms of state aggregation implemented with a decision tree, such that policy sharing between multi-agent is eventually accomplished by merging different decision trees between peers. Unlike lookup tables which have homogeneous structure for state aggregations, decision trees carried in agents are with heterogeneous structure. This work executes policy sharing between cooperative agents by means of forming a hyper structure from their trees instead of merging whole trees violently. The proposed scheme initially translates the whole decision tree from an agent to others. Based on the evidence, only partial leaf nodes hold helpful experience for policy sharing. The proposed method inducts a hyper decision tree by a great mount of samples which are sampled from the shared nodes. Results from simulations in multi-agent cooperative domain illustrate that the proposed algorithms perform better than the one without sharing.
{"title":"Learning acceleration by policy sharing","authors":"Kao-Shing Hwang, Yu-Jen Chen, Wei-Cheng Jiang","doi":"10.1109/WCICA.2011.5970609","DOIUrl":"https://doi.org/10.1109/WCICA.2011.5970609","url":null,"abstract":"Reinforcement learning is one of the more prominent machine learning technologies due to its unsupervised learning structure and ability to continually learn, even in a dynamic operating environment. Applying this learning to cooperative multi-agent systems not only allows each individual agent to learn from its own experience, but also offers the opportunity for the individual agents to learn from the other agents in the system to increase the speed of learning can be accelerated. In the proposed learning algorithm, an agent store its experience in terms of state aggregation implemented with a decision tree, such that policy sharing between multi-agent is eventually accomplished by merging different decision trees between peers. Unlike lookup tables which have homogeneous structure for state aggregations, decision trees carried in agents are with heterogeneous structure. This work executes policy sharing between cooperative agents by means of forming a hyper structure from their trees instead of merging whole trees violently. The proposed scheme initially translates the whole decision tree from an agent to others. Based on the evidence, only partial leaf nodes hold helpful experience for policy sharing. The proposed method inducts a hyper decision tree by a great mount of samples which are sampled from the shared nodes. Results from simulations in multi-agent cooperative domain illustrate that the proposed algorithms perform better than the one without sharing.","PeriodicalId":211049,"journal":{"name":"2011 9th World Congress on Intelligent Control and Automation","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131919177","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}
Pub Date : 2011-06-21DOI: 10.1109/WCICA.2011.5970714
Shuangxin Wang, D. Lv, Z. Li, Han Li
Aiming at the non-linear characteristics such as dead-time and saturation in the turbine governing system, a novel PID control strategy with radial basis function network tuning algorithm was proposed. Thus the governing system can be identified on line, and PID parameters can be adjusted in real time. Additionally, a new chaotic particle swarm algorithm is proposed which combines the particle swarm algorithm and the chaotic optimization in order to avoid the premature convergence of the particle swarm algorithm and the shortcomings of chaotic optimization, such as slow searching speed and low accuracy when used in the multivariable systems or in large search space. The initial values of RBF network parameters are selected by chaotic particle swarm optimization algorithm which can avoid blindness of choosing parameters randomly. By comparing the results of simulation, the method does increase the system's control precision and enhance the system's response speed.
{"title":"A novel RBF-PID control strategy for turbine governing system based on chaotic PSO","authors":"Shuangxin Wang, D. Lv, Z. Li, Han Li","doi":"10.1109/WCICA.2011.5970714","DOIUrl":"https://doi.org/10.1109/WCICA.2011.5970714","url":null,"abstract":"Aiming at the non-linear characteristics such as dead-time and saturation in the turbine governing system, a novel PID control strategy with radial basis function network tuning algorithm was proposed. Thus the governing system can be identified on line, and PID parameters can be adjusted in real time. Additionally, a new chaotic particle swarm algorithm is proposed which combines the particle swarm algorithm and the chaotic optimization in order to avoid the premature convergence of the particle swarm algorithm and the shortcomings of chaotic optimization, such as slow searching speed and low accuracy when used in the multivariable systems or in large search space. The initial values of RBF network parameters are selected by chaotic particle swarm optimization algorithm which can avoid blindness of choosing parameters randomly. By comparing the results of simulation, the method does increase the system's control precision and enhance the system's response speed.","PeriodicalId":211049,"journal":{"name":"2011 9th World Congress on Intelligent Control and Automation","volume":"168 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129966928","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}
Pub Date : 2011-06-21DOI: 10.1109/WCICA.2011.5970750
Yan Zhang, T. Tang, Qing Huang, Wei Zheng, Tianhua Xu
Train control systems are important to ensure the high efficiency and safety of train, and the test of it is the key factor which determines whether the system is successful or not. The model checkers of Cad SMV, NuSMV, NuBMC and SPIN have been used to generate test sequence, but the high abstracted model of these tools can not keep all the detail informations to construct the test sequence. Colored Petri Net (CPN) models can reserve all the key details used to generate the test sequence directly. To the best of our knowledge, CPN have not been used in this area, one main reason is that the latest version of the CPN model checking tool can only determine the correctness of temporal logic formulas, and not counterexample is available. In this study, how to generate test sequence for train control system using CPN Tools is introduced. The environment models were used to close the model by the means of reading its script file and getting the input messages set of System Under Test (SUT). Radio Block Center (RBC) is chosen as the SUT and the scenario of Start of Mission is chosen as the example scenario. The result shows that the state space size is related with the environment script files when the SUT CPN model is fixed.
列车控制系统是保证列车高效、安全运行的重要手段，而列车控制系统的测试是决定系统成败的关键因素。Cad SMV、NuSMV、NuBMC和SPIN等模型检查器已被用于生成测试序列，但这些工具的高度抽象模型不能保留构建测试序列所需的全部细节信息。彩色Petri网(CPN)模型可以保留所有用于直接生成测试序列的关键细节。据我们所知，CPN尚未在这一领域得到应用，一个主要原因是最新版本的CPN模型检查工具只能确定时间逻辑公式的正确性，而没有反例可用。本文介绍了如何利用CPN工具生成列车控制系统的测试序列。使用环境模型通过读取其脚本文件和获取System Under Test (SUT)的输入消息集来关闭模型。选择无线电块中心(RBC)作为SUT，选择任务开始场景作为示例场景。结果表明，当SUT CPN模型固定时，状态空间大小与环境脚本文件有关。
{"title":"The test of train control system based on Colored Petri Net","authors":"Yan Zhang, T. Tang, Qing Huang, Wei Zheng, Tianhua Xu","doi":"10.1109/WCICA.2011.5970750","DOIUrl":"https://doi.org/10.1109/WCICA.2011.5970750","url":null,"abstract":"Train control systems are important to ensure the high efficiency and safety of train, and the test of it is the key factor which determines whether the system is successful or not. The model checkers of Cad SMV, NuSMV, NuBMC and SPIN have been used to generate test sequence, but the high abstracted model of these tools can not keep all the detail informations to construct the test sequence. Colored Petri Net (CPN) models can reserve all the key details used to generate the test sequence directly. To the best of our knowledge, CPN have not been used in this area, one main reason is that the latest version of the CPN model checking tool can only determine the correctness of temporal logic formulas, and not counterexample is available. In this study, how to generate test sequence for train control system using CPN Tools is introduced. The environment models were used to close the model by the means of reading its script file and getting the input messages set of System Under Test (SUT). Radio Block Center (RBC) is chosen as the SUT and the scenario of Start of Mission is chosen as the example scenario. The result shows that the state space size is related with the environment script files when the SUT CPN model is fixed.","PeriodicalId":211049,"journal":{"name":"2011 9th World Congress on Intelligent Control and Automation","volume":"383 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124765404","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}
Pub Date : 2011-06-21DOI: 10.1109/WCICA.2011.5970591
Zhixin Yang, Jianhua Zhong, S. F. Wong
In this paper, a condition monitoring and fault diagnosis method for rotating machineries using machine learning technologies including artificial neural network (ANNs) and support vector machine (SVMs) is described. The vibration signal is acquired from gearbox used in local power generation industry for analysis of potential defects. Wavelet packet transforms (WPT) and time domains statistical are used to extraction features, and the compensation distance evaluation technique (CDET) is applied to select optimal feature via sensitivities ranking. A comparative experiment study of the efficiency of ANN and SVM in predication of failure is carried out. The results reveal that the proposed feature selection and machine learning algorithms could be effectively used automatic diagnosis of gear faults.
{"title":"Machine learning method with compensation distance technique for gear fault detection","authors":"Zhixin Yang, Jianhua Zhong, S. F. Wong","doi":"10.1109/WCICA.2011.5970591","DOIUrl":"https://doi.org/10.1109/WCICA.2011.5970591","url":null,"abstract":"In this paper, a condition monitoring and fault diagnosis method for rotating machineries using machine learning technologies including artificial neural network (ANNs) and support vector machine (SVMs) is described. The vibration signal is acquired from gearbox used in local power generation industry for analysis of potential defects. Wavelet packet transforms (WPT) and time domains statistical are used to extraction features, and the compensation distance evaluation technique (CDET) is applied to select optimal feature via sensitivities ranking. A comparative experiment study of the efficiency of ANN and SVM in predication of failure is carried out. The results reveal that the proposed feature selection and machine learning algorithms could be effectively used automatic diagnosis of gear faults.","PeriodicalId":211049,"journal":{"name":"2011 9th World Congress on Intelligent Control and Automation","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134588933","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}
Pub Date : 2011-06-21DOI: 10.1109/WCICA.2011.5970611
Yue Zhou, Xijian Zheng, Shuai Liu, Bo Li
A MAC protocol—wake up one by one MAC (WOO-MAC) for the tower crane group monitoring control system based on WSN (Wireless Sensor Network) is proposed in the paper, which can get low-delay and low-energy consumption. WOO-MAC solves the data forward intermit effectively, which exists in most active/sleep protocols, by waking up the nodes in the data collecting tree one by one. A model of WOO-MAC based on OPNET Modeler is established. The paper compares and analyzes the performance indexes of WOO-MAC with IEEE 802.11 and S-MAC, which includes end-to-end delay, end-to-end throughput and average energy consumption. The simulation results show that WOO-MAC got not only lower energy consumption, but also lower end-to-end delay and higher end-to-end throughput.
{"title":"A low-delay medium access control mechanism of WSN for tower crane group","authors":"Yue Zhou, Xijian Zheng, Shuai Liu, Bo Li","doi":"10.1109/WCICA.2011.5970611","DOIUrl":"https://doi.org/10.1109/WCICA.2011.5970611","url":null,"abstract":"A MAC protocol—wake up one by one MAC (WOO-MAC) for the tower crane group monitoring control system based on WSN (Wireless Sensor Network) is proposed in the paper, which can get low-delay and low-energy consumption. WOO-MAC solves the data forward intermit effectively, which exists in most active/sleep protocols, by waking up the nodes in the data collecting tree one by one. A model of WOO-MAC based on OPNET Modeler is established. The paper compares and analyzes the performance indexes of WOO-MAC with IEEE 802.11 and S-MAC, which includes end-to-end delay, end-to-end throughput and average energy consumption. The simulation results show that WOO-MAC got not only lower energy consumption, but also lower end-to-end delay and higher end-to-end throughput.","PeriodicalId":211049,"journal":{"name":"2011 9th World Congress on Intelligent Control and Automation","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131461529","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}
Pub Date : 2011-06-21DOI: 10.1109/WCICA.2011.5970653
Guo-Cheng Lan, Chun-Wei Lin, T. Hong, V. Tseng
In this paper, a maintenance algorithm for average-utility mining is proposed to update derived high average-utility itemsets in dynamic databases. It first calculates the count difference of modified itemsets and then partitions them into four parts according to whether they are high upper-bound average-utility itemsets in the original database and whether their count difference is positive or negative. Each part is then processed in its own way. Experimental results show the proposed maintenance algorithm runs faster than the two-phase approach for mining high average-utility itemsets in dynamic databases.
{"title":"Updating high average-utility itemsets in dynamic databases","authors":"Guo-Cheng Lan, Chun-Wei Lin, T. Hong, V. Tseng","doi":"10.1109/WCICA.2011.5970653","DOIUrl":"https://doi.org/10.1109/WCICA.2011.5970653","url":null,"abstract":"In this paper, a maintenance algorithm for average-utility mining is proposed to update derived high average-utility itemsets in dynamic databases. It first calculates the count difference of modified itemsets and then partitions them into four parts according to whether they are high upper-bound average-utility itemsets in the original database and whether their count difference is positive or negative. Each part is then processed in its own way. Experimental results show the proposed maintenance algorithm runs faster than the two-phase approach for mining high average-utility itemsets in dynamic databases.","PeriodicalId":211049,"journal":{"name":"2011 9th World Congress on Intelligent Control and Automation","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132327266","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：