Pub Date : 2011-08-04DOI: 10.1109/DMO.2011.5976517
Imam Mujahidin Iqbal, N. Aziz
An accurate and simple model is essential to implement a model based controller. Wiener model is one of the simplest nonlinear models that can represent any nonlinear process. However, in Wiener Model development, there are several identification approaches available and need to be selected to produce the most accurate model. In this work, the nonlinear - linear approach, the linear - nonlinear approach, and the simultaneous approach are compared in identification of the Wiener model for nonlinear pH neutralization process. The parameters of linear block and the inverse of nonlinear block were obtained from several sets of data that are generated. These approaches are then compared in terms of model accuracy, calculation time, data requirement, and their flexibility.
{"title":"Comparison of various Wiener model identification approach in modelling nonlinear process","authors":"Imam Mujahidin Iqbal, N. Aziz","doi":"10.1109/DMO.2011.5976517","DOIUrl":"https://doi.org/10.1109/DMO.2011.5976517","url":null,"abstract":"An accurate and simple model is essential to implement a model based controller. Wiener model is one of the simplest nonlinear models that can represent any nonlinear process. However, in Wiener Model development, there are several identification approaches available and need to be selected to produce the most accurate model. In this work, the nonlinear - linear approach, the linear - nonlinear approach, and the simultaneous approach are compared in identification of the Wiener model for nonlinear pH neutralization process. The parameters of linear block and the inverse of nonlinear block were obtained from several sets of data that are generated. These approaches are then compared in terms of model accuracy, calculation time, data requirement, and their flexibility.","PeriodicalId":436393,"journal":{"name":"2011 3rd Conference on Data Mining and Optimization (DMO)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126551809","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-28DOI: 10.1109/DMO.2011.5976503
Zalizah Awang Long, A. Bakar, Abdul Razak Hamdan
Data mining is the process of finding correlations or patterns among dozens of fields in large relational databases. While Association Rules Mining (ARM) algorithm especially the Apriori algorithm has been an active research work in recent years. Diverse improvement varies in term of producing more frequent items and also generating further k-length. The idea is to produce better pattern and more interesting rules. In this paper, we propose new approach for ARM based on Multiple Attribute Value within the non-binary search spaces. The proposed algorithm improves the existing frequent pattern mining by generating the most frequent values (item) within the attribute and generate candidate based on the frequent attribute value. The main idea of our work is to discover more meaningful frequent items and maximum k-length items. The experimental results show that our proposed MAV frequent pattern mining enhance the impact in generating more frequents items and maximum length
{"title":"Frequent pattern using Multiple Attribute Value for itemset generation","authors":"Zalizah Awang Long, A. Bakar, Abdul Razak Hamdan","doi":"10.1109/DMO.2011.5976503","DOIUrl":"https://doi.org/10.1109/DMO.2011.5976503","url":null,"abstract":"Data mining is the process of finding correlations or patterns among dozens of fields in large relational databases. While Association Rules Mining (ARM) algorithm especially the Apriori algorithm has been an active research work in recent years. Diverse improvement varies in term of producing more frequent items and also generating further k-length. The idea is to produce better pattern and more interesting rules. In this paper, we propose new approach for ARM based on Multiple Attribute Value within the non-binary search spaces. The proposed algorithm improves the existing frequent pattern mining by generating the most frequent values (item) within the attribute and generate candidate based on the frequent attribute value. The main idea of our work is to discover more meaningful frequent items and maximum k-length items. The experimental results show that our proposed MAV frequent pattern mining enhance the impact in generating more frequents items and maximum length","PeriodicalId":436393,"journal":{"name":"2011 3rd Conference on Data Mining and Optimization (DMO)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122540991","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-28DOI: 10.1109/DMO.2011.5976512
R. Yaakob, N. Mustapha, A. Nuruddin, I. S. Sitanggang
Forest fires have long been annual events in many parts of Sumatra Indonesia during the dry season. Riau Province is one of the regions in Sumatra where forest fires seriously occur every year mostly because of human factors both on purposes and accidently. Forest fire models have been developed for certain area using the weightage and criterion of variables that involve the subjective and qualitative judging for variables. Determining the weights for each criterion is based on expert knowledge or the previous experienced of the developers that may result too subjective models. In addition, criteria evaluation and weighting method are most applied to evaluate the small problem containing few criteria. This paper presents our initial work in developing a spatial decision tree using the spatial ID3 algorithm and Spatial Join Index applied in the SCART (Spatial Classification and Regression Trees) algorithm. The algorithm is applied on historic forest fires data for a district in Riau namely Rokan Hilir to develop a model for forest fires risk. The modeling forest fire risk includes variables related to physical as well as social and economic. The result is a spatial decision tree containing 138 leaves with distance to nearest river as the first test attribute.
{"title":"Modeling forest fires risk using spatial decision tree","authors":"R. Yaakob, N. Mustapha, A. Nuruddin, I. S. Sitanggang","doi":"10.1109/DMO.2011.5976512","DOIUrl":"https://doi.org/10.1109/DMO.2011.5976512","url":null,"abstract":"Forest fires have long been annual events in many parts of Sumatra Indonesia during the dry season. Riau Province is one of the regions in Sumatra where forest fires seriously occur every year mostly because of human factors both on purposes and accidently. Forest fire models have been developed for certain area using the weightage and criterion of variables that involve the subjective and qualitative judging for variables. Determining the weights for each criterion is based on expert knowledge or the previous experienced of the developers that may result too subjective models. In addition, criteria evaluation and weighting method are most applied to evaluate the small problem containing few criteria. This paper presents our initial work in developing a spatial decision tree using the spatial ID3 algorithm and Spatial Join Index applied in the SCART (Spatial Classification and Regression Trees) algorithm. The algorithm is applied on historic forest fires data for a district in Riau namely Rokan Hilir to develop a model for forest fires risk. The modeling forest fire risk includes variables related to physical as well as social and economic. The result is a spatial decision tree containing 138 leaves with distance to nearest river as the first test attribute.","PeriodicalId":436393,"journal":{"name":"2011 3rd Conference on Data Mining and Optimization (DMO)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128739178","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-28DOI: 10.1109/DMO.2011.5976535
Zainal Apandi, N. Mustapha, L. S. Affendey
With the enormous amount of video data especially with the existence of the noisy and irrelevant information, it would be difficult for a typical detection process to capture a small portion of targeted due to the class imbalance problem. In this paper, class imbalance referred to a very small percentage of positive instance versus negative instances, where the negative instances dominate the detection model, resulting in the degradation of the detection performance. This paper proposed an Integrated Weight Linear (IWL) method that integrate weight linear algorithm (WL) with principle component analysis (PCA) to eliminate imbalanced dataset in soccer video data. PCA is adopted in the first phase with the aim to alleviates the imbalanced data and prepared the reduced instances to the next phase. In the second phase, the reduces instances are refined using the weight linear algorithm. The experiment results using 9 soccer video demonstrate that the integration of PCA and WL is capable to alleviates the imbalanced problem and able to improve classification performance in video data.
{"title":"Evaluating Integrated Weight Linear method to class imbalanced learning in video data","authors":"Zainal Apandi, N. Mustapha, L. S. Affendey","doi":"10.1109/DMO.2011.5976535","DOIUrl":"https://doi.org/10.1109/DMO.2011.5976535","url":null,"abstract":"With the enormous amount of video data especially with the existence of the noisy and irrelevant information, it would be difficult for a typical detection process to capture a small portion of targeted due to the class imbalance problem. In this paper, class imbalance referred to a very small percentage of positive instance versus negative instances, where the negative instances dominate the detection model, resulting in the degradation of the detection performance. This paper proposed an Integrated Weight Linear (IWL) method that integrate weight linear algorithm (WL) with principle component analysis (PCA) to eliminate imbalanced dataset in soccer video data. PCA is adopted in the first phase with the aim to alleviates the imbalanced data and prepared the reduced instances to the next phase. In the second phase, the reduces instances are refined using the weight linear algorithm. The experiment results using 9 soccer video demonstrate that the integration of PCA and WL is capable to alleviates the imbalanced problem and able to improve classification performance in video data.","PeriodicalId":436393,"journal":{"name":"2011 3rd Conference on Data Mining and Optimization (DMO)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129871820","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-28DOI: 10.1109/DMO.2011.5976532
Mouna Jamom, M. Ayob, Mohammed Hadwan
Nurse Rostering Problem (NRP) concerns about producing a high quality workable duty roster for the available staff nurses. The aim of this work is to present a greedy constructive heuristic algorithm to generate a feasible initial solution by satisfying the hard constraints. Basically the initial solution includes three steps: first we start by designing a group of shift patterns based on hard and soft constraints. Then, those patterns are rotated for predefined positions and allocated to each nurse. Finally; if the solution is not feasible we use a repair mechanism. In this work, a real world problem from Universiti Kebangsaan Malaysia Medical Centre (UKMMC) is used to test the proposed algorithm. The resulting roster demonstrates that our proposed algorithm generates a good quality duty roster in a reasonable computational time for our case study.
{"title":"A greedy constructive approach for Nurse Rostering Problem","authors":"Mouna Jamom, M. Ayob, Mohammed Hadwan","doi":"10.1109/DMO.2011.5976532","DOIUrl":"https://doi.org/10.1109/DMO.2011.5976532","url":null,"abstract":"Nurse Rostering Problem (NRP) concerns about producing a high quality workable duty roster for the available staff nurses. The aim of this work is to present a greedy constructive heuristic algorithm to generate a feasible initial solution by satisfying the hard constraints. Basically the initial solution includes three steps: first we start by designing a group of shift patterns based on hard and soft constraints. Then, those patterns are rotated for predefined positions and allocated to each nurse. Finally; if the solution is not feasible we use a repair mechanism. In this work, a real world problem from Universiti Kebangsaan Malaysia Medical Centre (UKMMC) is used to test the proposed algorithm. The resulting roster demonstrates that our proposed algorithm generates a good quality duty roster in a reasonable computational time for our case study.","PeriodicalId":436393,"journal":{"name":"2011 3rd Conference on Data Mining and Optimization (DMO)","volume":"326 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123312508","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-28DOI: 10.1109/DMO.2011.5976525
Mohammed Hadwan, M. Ayob
The paper, at hand, introduces a semi-cyclic shift patterns approach (SCSPA) that solves nurse rostering problem (NRP) at the Medical Centre, Universiti Kebangsaan Malaysia (UKMMC). Since night shift is the most problematic shift to assign due to the extra constraints that it has, the paper proposes a combination of semi-cyclic approach, which first allocates a predesigned night shift patterns cyclically, then allocates a combined morning and evening shift patterns in a non-cyclic manner until fulfilling the hard constraints. This is different from our previous work that adopted a non-cyclic shift pattern approach (NCSPA) to construct all of the possible valid shift patterns, which were a combination of morning, evening and night shifts which were incorporated to yield one-week shift patterns. Next, two shift patterns of one-week were allocated for each nurse until construct the initial roster. This paper presents a comparison between the proposed semi-cyclic approach and the previous non-cyclic approach. Beside the minimum violation penalty, we count the number of good patterns that each algorithm produces in order to measure the quality of constructed duty roster. Then, the approach applies simulated annealing algorithm in order to improve the overall produced roster as to enhance the initial roster that resulted from both algorithms. By using a semi-cyclic approach, two benefits over our previous work are gained, (i) the number of constructed shift patterns decreased remarkably, thus reduces the construction time; and (ii) allocating night shift patterns fairly for all nurses becomes more manageable. Based on the obtained results, the semi-cyclic approach yields a better duty roster as it produces more good patterns compared to our previous Non-cyclic approach.
{"title":"A semi-cyclic shift patterns approach for nurse rostering problems","authors":"Mohammed Hadwan, M. Ayob","doi":"10.1109/DMO.2011.5976525","DOIUrl":"https://doi.org/10.1109/DMO.2011.5976525","url":null,"abstract":"The paper, at hand, introduces a semi-cyclic shift patterns approach (SCSPA) that solves nurse rostering problem (NRP) at the Medical Centre, Universiti Kebangsaan Malaysia (UKMMC). Since night shift is the most problematic shift to assign due to the extra constraints that it has, the paper proposes a combination of semi-cyclic approach, which first allocates a predesigned night shift patterns cyclically, then allocates a combined morning and evening shift patterns in a non-cyclic manner until fulfilling the hard constraints. This is different from our previous work that adopted a non-cyclic shift pattern approach (NCSPA) to construct all of the possible valid shift patterns, which were a combination of morning, evening and night shifts which were incorporated to yield one-week shift patterns. Next, two shift patterns of one-week were allocated for each nurse until construct the initial roster. This paper presents a comparison between the proposed semi-cyclic approach and the previous non-cyclic approach. Beside the minimum violation penalty, we count the number of good patterns that each algorithm produces in order to measure the quality of constructed duty roster. Then, the approach applies simulated annealing algorithm in order to improve the overall produced roster as to enhance the initial roster that resulted from both algorithms. By using a semi-cyclic approach, two benefits over our previous work are gained, (i) the number of constructed shift patterns decreased remarkably, thus reduces the construction time; and (ii) allocating night shift patterns fairly for all nurses becomes more manageable. Based on the obtained results, the semi-cyclic approach yields a better duty roster as it produces more good patterns compared to our previous Non-cyclic approach.","PeriodicalId":436393,"journal":{"name":"2011 3rd Conference on Data Mining and Optimization (DMO)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115927871","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-28DOI: 10.1109/DMO.2011.5976534
M. Sainin, R. Alfred
Feature selection for data mining optimization receives quite a high demand especially on high-dimensional feature vectors of a data. Feature selection is a method used to select the best feature (or combination of features) for the data in order to achieve similar or better classification rate. Currently, there are three types of feature selection methods: filter, wrapper and embedded. This paper describes a genetic based wrapper approach that optimizes feature selection process embedded in a classification technique called a supervised Nearest Neighbour Distance Matrix (NNDM). This method is implemented and tested on several datasets obtained from the UCI Machine Learning Repository and other datasets. The results demonstrate a significant impact on the predictive accuracy for feature selection combined with the supervised NNDM in classifying new instances. Therefore it can be used in other applications that require feature dimension reduction such as image and bioinformatics classifications.
{"title":"A genetic based wrapper feature selection approach using Nearest Neighbour Distance Matrix","authors":"M. Sainin, R. Alfred","doi":"10.1109/DMO.2011.5976534","DOIUrl":"https://doi.org/10.1109/DMO.2011.5976534","url":null,"abstract":"Feature selection for data mining optimization receives quite a high demand especially on high-dimensional feature vectors of a data. Feature selection is a method used to select the best feature (or combination of features) for the data in order to achieve similar or better classification rate. Currently, there are three types of feature selection methods: filter, wrapper and embedded. This paper describes a genetic based wrapper approach that optimizes feature selection process embedded in a classification technique called a supervised Nearest Neighbour Distance Matrix (NNDM). This method is implemented and tested on several datasets obtained from the UCI Machine Learning Repository and other datasets. The results demonstrate a significant impact on the predictive accuracy for feature selection combined with the supervised NNDM in classifying new instances. Therefore it can be used in other applications that require feature dimension reduction such as image and bioinformatics classifications.","PeriodicalId":436393,"journal":{"name":"2011 3rd Conference on Data Mining and Optimization (DMO)","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133544555","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-28DOI: 10.1109/DMO.2011.5976499
Wan Muhammad Zulhafizsyam Wan Ahmad, S. Sulaiman, U. K. Yusof
The Internet contributes to the development of electronic community (e-community) portals. Such portals become an indispensable platform for members especially for a Special Interest Groups (SIG) to share knowledge and expertise in their respective fields. Finding expertise over the e-community portal will help interested people and researchers to identify other experts, working in the same area. However, it is quite a cumbersome task to search such expertise in the portal. In order to find an expert, expertise data mining could be a solution to ease the search of experts. Performing effective data mining technique will help to analyze and measure expertise level accurately in a SIG portal. This paper proposes a method called Expertise Data Mining (EDM) that comprises a few techniques for expertise search in a SIG portal. It expects to improve the finding of experts among the members of a SIG e-community.
{"title":"Data mining technique for expertise search in a special interest group knowledge portal","authors":"Wan Muhammad Zulhafizsyam Wan Ahmad, S. Sulaiman, U. K. Yusof","doi":"10.1109/DMO.2011.5976499","DOIUrl":"https://doi.org/10.1109/DMO.2011.5976499","url":null,"abstract":"The Internet contributes to the development of electronic community (e-community) portals. Such portals become an indispensable platform for members especially for a Special Interest Groups (SIG) to share knowledge and expertise in their respective fields. Finding expertise over the e-community portal will help interested people and researchers to identify other experts, working in the same area. However, it is quite a cumbersome task to search such expertise in the portal. In order to find an expert, expertise data mining could be a solution to ease the search of experts. Performing effective data mining technique will help to analyze and measure expertise level accurately in a SIG portal. This paper proposes a method called Expertise Data Mining (EDM) that comprises a few techniques for expertise search in a SIG portal. It expects to improve the finding of experts among the members of a SIG e-community.","PeriodicalId":436393,"journal":{"name":"2011 3rd Conference on Data Mining and Optimization (DMO)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114219550","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-28DOI: 10.1109/DMO.2011.5976537
Sandeep Singh Rawat, L. Rajamani
It is a difficult task to set rare association rules to handle unpredictable items since approaches such as apriori algorithm and frequent pattern-growth, a single minimum support application based suffers from low or high minimum support. If minimum support is set high to cover the rarely appearing items it will miss the frequent patterns involving rare items since rare items fail to satisfy high minimum support. In the literature, an effort has been made to extract rare association rules with multiple minimum supports. In this paper, we explore the probability and propose multiple minsup based apriori-like approach called Probability Apriori Multiple Minimum Support (PAMMS) to efficiently discover rare association rules. Experimental results show that the proposed approach is efficient.
{"title":"Probability apriori based approach to mine rare association rules","authors":"Sandeep Singh Rawat, L. Rajamani","doi":"10.1109/DMO.2011.5976537","DOIUrl":"https://doi.org/10.1109/DMO.2011.5976537","url":null,"abstract":"It is a difficult task to set rare association rules to handle unpredictable items since approaches such as apriori algorithm and frequent pattern-growth, a single minimum support application based suffers from low or high minimum support. If minimum support is set high to cover the rarely appearing items it will miss the frequent patterns involving rare items since rare items fail to satisfy high minimum support. In the literature, an effort has been made to extract rare association rules with multiple minimum supports. In this paper, we explore the probability and propose multiple minsup based apriori-like approach called Probability Apriori Multiple Minimum Support (PAMMS) to efficiently discover rare association rules. Experimental results show that the proposed approach is efficient.","PeriodicalId":436393,"journal":{"name":"2011 3rd Conference on Data Mining and Optimization (DMO)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126106109","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-28DOI: 10.1109/DMO.2011.5976516
S. Masrom, Siti Z.Z. Abidin, P. N. Hashimah, S. A.S. Abd. Rahman
Inspired by nature, many types of Population based metaheuristics or P-metaheuristics is cropping out of research labs to help solve real life problems. Since every metaheuristics has its own strength and weaknesses, hybridizing the algorithms can sometimes produce better results. To this date of literature, Low-level Teamwork Hybridization is considered as an effective and popular method for hybridization of P-metaheuristics. In many cases however, the approach might prove to be quite complicated. The hybridization often requires metaheuristics internal structure modification in order for the different algorithms to fit well together. Another difficulty is in determining which strategies to be retained and which to be dropped or replaced in each of the metaheuristic algorithms. This paper provides a general abstraction for P-metaheuristics and describes the main P-metaheuristics components that are suitable candidates for hybridization. The review and comparative study of several implementations of Low-level Teamwork Hybridization is also presented.
{"title":"Low-level Teamwork Hybridization for P-metaheuristics: A review and comparison","authors":"S. Masrom, Siti Z.Z. Abidin, P. N. Hashimah, S. A.S. Abd. Rahman","doi":"10.1109/DMO.2011.5976516","DOIUrl":"https://doi.org/10.1109/DMO.2011.5976516","url":null,"abstract":"Inspired by nature, many types of Population based metaheuristics or P-metaheuristics is cropping out of research labs to help solve real life problems. Since every metaheuristics has its own strength and weaknesses, hybridizing the algorithms can sometimes produce better results. To this date of literature, Low-level Teamwork Hybridization is considered as an effective and popular method for hybridization of P-metaheuristics. In many cases however, the approach might prove to be quite complicated. The hybridization often requires metaheuristics internal structure modification in order for the different algorithms to fit well together. Another difficulty is in determining which strategies to be retained and which to be dropped or replaced in each of the metaheuristic algorithms. This paper provides a general abstraction for P-metaheuristics and describes the main P-metaheuristics components that are suitable candidates for hybridization. The review and comparative study of several implementations of Low-level Teamwork Hybridization is also presented.","PeriodicalId":436393,"journal":{"name":"2011 3rd Conference on Data Mining and Optimization (DMO)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126525345","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
扫码关注我们
求助内容：
应助结果提醒方式：