L. K., Raja Sathasivam, S. P., D. R, P. K R, M. Sj, Gunasekar M, M. Sd
{"title":"利用多目标粒子群算法从不确定数据库中发现潜在高效用项目集","authors":"L. K., Raja Sathasivam, S. P., D. R, P. K R, M. Sj, Gunasekar M, M. Sd","doi":"10.1109/ICACTA54488.2022.9753159","DOIUrl":null,"url":null,"abstract":"In recent decades, Internet of Things devices have grown in popularity across a wide range of industries and uses. As a result, vast amounts of data are created and generated. Despite the fact that the collected data contains a great quantity of crucial information, most current and general pattern mining algorithms simply analyses a single item and exact information to identify the needed data. Because the amount of data gathered is so huge, it is vital to identify meaningful and updated data in a short period of time. In this paper, we use a multi-objective evolutionary framework to effectively mine the interesting Potential High Utility Itemset (PHUI) in a limited period, with the majority of items being PHUI utility and uncertainty. In an unpredictable context, the benefits of the proposed model (dubbed MOPSO-PHUIM) can identify lucrative PHUIs without pre-defined threshold values (i.e., minimal utility and minimum uncertainty). To illustrate the efficiency of the created MOPSO-PHUIM, two encoding techniques are also taken into account. Using the developed MOPSO-PHUIM model for decision-making, a set of non-dominated PHUIs may be found in a short amount of time. Studies are then carried out to demonstrate the utility and performance of the built MOPSO-PHUIM model in terms of velocity, hyper volume, and the different result discovered when compared to generic techniques.","PeriodicalId":345370,"journal":{"name":"2022 International Conference on Advanced Computing Technologies and Applications (ICACTA)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Discovery of Potential High Utility Itemset from Uncertain Database using Multi Objective Particle Swarm Optimization Algorithm\",\"authors\":\"L. K., Raja Sathasivam, S. P., D. R, P. K R, M. Sj, Gunasekar M, M. Sd\",\"doi\":\"10.1109/ICACTA54488.2022.9753159\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent decades, Internet of Things devices have grown in popularity across a wide range of industries and uses. As a result, vast amounts of data are created and generated. Despite the fact that the collected data contains a great quantity of crucial information, most current and general pattern mining algorithms simply analyses a single item and exact information to identify the needed data. Because the amount of data gathered is so huge, it is vital to identify meaningful and updated data in a short period of time. In this paper, we use a multi-objective evolutionary framework to effectively mine the interesting Potential High Utility Itemset (PHUI) in a limited period, with the majority of items being PHUI utility and uncertainty. In an unpredictable context, the benefits of the proposed model (dubbed MOPSO-PHUIM) can identify lucrative PHUIs without pre-defined threshold values (i.e., minimal utility and minimum uncertainty). To illustrate the efficiency of the created MOPSO-PHUIM, two encoding techniques are also taken into account. Using the developed MOPSO-PHUIM model for decision-making, a set of non-dominated PHUIs may be found in a short amount of time. Studies are then carried out to demonstrate the utility and performance of the built MOPSO-PHUIM model in terms of velocity, hyper volume, and the different result discovered when compared to generic techniques.\",\"PeriodicalId\":345370,\"journal\":{\"name\":\"2022 International Conference on Advanced Computing Technologies and Applications (ICACTA)\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-03-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 International Conference on Advanced Computing Technologies and Applications (ICACTA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICACTA54488.2022.9753159\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Advanced Computing Technologies and Applications (ICACTA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACTA54488.2022.9753159","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Discovery of Potential High Utility Itemset from Uncertain Database using Multi Objective Particle Swarm Optimization Algorithm
In recent decades, Internet of Things devices have grown in popularity across a wide range of industries and uses. As a result, vast amounts of data are created and generated. Despite the fact that the collected data contains a great quantity of crucial information, most current and general pattern mining algorithms simply analyses a single item and exact information to identify the needed data. Because the amount of data gathered is so huge, it is vital to identify meaningful and updated data in a short period of time. In this paper, we use a multi-objective evolutionary framework to effectively mine the interesting Potential High Utility Itemset (PHUI) in a limited period, with the majority of items being PHUI utility and uncertainty. In an unpredictable context, the benefits of the proposed model (dubbed MOPSO-PHUIM) can identify lucrative PHUIs without pre-defined threshold values (i.e., minimal utility and minimum uncertainty). To illustrate the efficiency of the created MOPSO-PHUIM, two encoding techniques are also taken into account. Using the developed MOPSO-PHUIM model for decision-making, a set of non-dominated PHUIs may be found in a short amount of time. Studies are then carried out to demonstrate the utility and performance of the built MOPSO-PHUIM model in terms of velocity, hyper volume, and the different result discovered when compared to generic techniques.