Nur Suhailayani Suhaimi, Siti Nur Kamaliah, N. Arbin, Z. Othman
{"title":"Optimizing Cluster of Questions by Using Dynamic Mutation in Genetic Algorithm","authors":"Nur Suhailayani Suhaimi, Siti Nur Kamaliah, N. Arbin, Z. Othman","doi":"10.1109/AIMS.2015.81","DOIUrl":null,"url":null,"abstract":"Clustering dynamic data is a challenge in identifying and forming groups. This unsupervised learning usually leads to indirect knowledge discovery. The cluster detection algorithm searches for clusters of data which are similar to one another by using similarity measures.Optimizing the clustered data with certain fixed values could be an issue. Depending on the parameters and attributes of the data, the results yielded probably either stuck in local optima or bias by attributes pattern. Performing Genetic Algorithm in the data cluster may increase the probability of the questions being clustered in the optimal group cluster. Dynamic Mutation in Genetic Algorithm used as repair mechanism to ensure the cluster is optimized enough and produce optimum indexed questions set.","PeriodicalId":121874,"journal":{"name":"2015 3rd International Conference on Artificial Intelligence, Modelling and Simulation (AIMS)","volume":"228 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 3rd International Conference on Artificial Intelligence, Modelling and Simulation (AIMS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AIMS.2015.81","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Clustering dynamic data is a challenge in identifying and forming groups. This unsupervised learning usually leads to indirect knowledge discovery. The cluster detection algorithm searches for clusters of data which are similar to one another by using similarity measures.Optimizing the clustered data with certain fixed values could be an issue. Depending on the parameters and attributes of the data, the results yielded probably either stuck in local optima or bias by attributes pattern. Performing Genetic Algorithm in the data cluster may increase the probability of the questions being clustered in the optimal group cluster. Dynamic Mutation in Genetic Algorithm used as repair mechanism to ensure the cluster is optimized enough and produce optimum indexed questions set.