Pub Date : 2024-07-03DOI: 10.7494/csci.2024.25.2.5891
Chiheb eddine Ben ncir, Mohamed Aymen Ben Haj kacem, Mohammed Alatas
Given the exponential growth of available data in large networks, the existence of rapid, transparent and explainable intrusion detection systems has become of high necessity to effectively discover attacks in such huge networks. To deal with this challenge, we propose a novel explainable intrusion detection system based on Spark, Particle Swarm Optimization (PSO) clustering and eXplainable Artificial Intelligence (XAI) techniques. Spark is used as a parallel processing model for the effective processing of large-scale data, PSO is integrated for improving the quality of the intrusion detection system by avoiding sensitive initialization and premature convergence of the clustering algorithm and finally, XAI techniques are used to enhance interpretability and explainability of intrusion recommendations by providing both micro and macro explanations of detected intrusions. Experiments are conducted on several large collections of real datasets to show the effectiveness of the proposed intrusion detection system in terms of explainability, scalability and accuracy. The proposed system has shown high transparency in assisting security experts and decision-makers to understand and interpret attack behavior.
{"title":"Explainable Spark-based PSO Clustering for Intrusion Detection","authors":"Chiheb eddine Ben ncir, Mohamed Aymen Ben Haj kacem, Mohammed Alatas","doi":"10.7494/csci.2024.25.2.5891","DOIUrl":"https://doi.org/10.7494/csci.2024.25.2.5891","url":null,"abstract":"Given the exponential growth of available data in large networks, the existence of rapid, transparent and explainable intrusion detection systems has become of high necessity to effectively discover attacks in such huge networks. To deal with this challenge, we propose a novel explainable intrusion detection system based on Spark, Particle Swarm Optimization (PSO) clustering and eXplainable Artificial Intelligence (XAI) techniques. Spark is used as a parallel processing model for the effective processing of large-scale data, PSO is integrated for improving the quality of the intrusion detection system by avoiding sensitive initialization and premature convergence of the clustering algorithm and finally, XAI techniques are used to enhance interpretability and explainability of intrusion recommendations by providing both micro and macro explanations of detected intrusions. Experiments are conducted on several large collections of real datasets to show the effectiveness of the proposed intrusion detection system in terms of explainability, scalability and accuracy. The proposed system has shown high transparency in assisting security experts and decision-makers to understand and interpret attack behavior.","PeriodicalId":503380,"journal":{"name":"Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141683996","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}
Due to the huge number of financial transactions, it is almost impossible for humans to manually detect fraudulent transactions. In previous work, the datasets are not balanced and the models suffer from overfitting problems. In this paper, we tried to overcome the problems by tuning hyperparameters and balancing the dataset by hybrid approach using under-sampling and over-sampling techniques. In this study, we have observed that these modifications are effective to get better performance in comparison to the existing models. The MCC score is considered an important parameter in binary classification since it ensures the correct prediction of the majority of positive data instances and negative data instances. So, we emphasize on MCC score and our method achieved MCC score of 97.09%, which is far more (16 % approx.) than other state of art methods. In terms of other performance metrics, the result of our proposed model is also improved significantly.
{"title":"Detection of Credit Card Fraud with Optimized Deep Neural Network in Balanced Data Condition","authors":"Nirupam Shome, Devran Dey Sarkar, Richik Kashyap, Rabul Hussain Lasker","doi":"10.7494/csci.2024.25.2.5967","DOIUrl":"https://doi.org/10.7494/csci.2024.25.2.5967","url":null,"abstract":"Due to the huge number of financial transactions, it is almost impossible for humans to manually detect fraudulent transactions. In previous work, the datasets are not balanced and the models suffer from overfitting problems. In this paper, we tried to overcome the problems by tuning hyperparameters and balancing the dataset by hybrid approach using under-sampling and over-sampling techniques. In this study, we have observed that these modifications are effective to get better performance in comparison to the existing models. The MCC score is considered an important parameter in binary classification since it ensures the correct prediction of the majority of positive data instances and negative data instances. So, we emphasize on MCC score and our method achieved MCC score of 97.09%, which is far more (16 % approx.) than other state of art methods. In terms of other performance metrics, the result of our proposed model is also improved significantly.","PeriodicalId":503380,"journal":{"name":"Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141682774","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 : 2024-07-03DOI: 10.7494/csci.2024.25.2.5844
ShivKishan Dubey
In natural language processing, a critical activity known as word sense disambiguation (WSD) seeks to ascertain the precise meaning of an ambiguous wordin context. Traditional methods for WSD frequently involve supervised learning methods and lexical databases like WordNet. However, these methods fallshort in managing word meaning complexity and capturing fine-grained differences. In this paper, for increasing the precision and granularity of word sensedisambiguation we proposed multilevel clustering method that goes deeper in the nested levels as locate groups of linked context words and categorize themaccording to their word meanings. With this method, we can more effectively manage polysemy and homonymy as well as detect minute differences in meaning. An actual investigation of the SemCor corpus demonstrates the performance score of multilevel clustering in WSD. This proposed method successfullyseparated clusters and groups context terms according to how semantically related they are, producing improved disambiguation outcomes. A more detailedknowledge of word senses and their relationships may be obtained thanks to the clustering process, which makes it possible to identify smaller clusters inside larger clusters. The outcomes demonstrate how multilevel clustering may enhance the granularity and accuracy of WSD. Our solution overcomes the drawbacks of conventional approaches and provides a more fine-grained representation of word senses by combining clustering algorithms.
{"title":"Clustering for Clarity: Improving Word Sense Disambiguation through Multilevel Analysis","authors":"ShivKishan Dubey","doi":"10.7494/csci.2024.25.2.5844","DOIUrl":"https://doi.org/10.7494/csci.2024.25.2.5844","url":null,"abstract":"In natural language processing, a critical activity known as word sense disambiguation (WSD) seeks to ascertain the precise meaning of an ambiguous wordin context. Traditional methods for WSD frequently involve supervised learning methods and lexical databases like WordNet. However, these methods fallshort in managing word meaning complexity and capturing fine-grained differences. In this paper, for increasing the precision and granularity of word sensedisambiguation we proposed multilevel clustering method that goes deeper in the nested levels as locate groups of linked context words and categorize themaccording to their word meanings. With this method, we can more effectively manage polysemy and homonymy as well as detect minute differences in meaning. An actual investigation of the SemCor corpus demonstrates the performance score of multilevel clustering in WSD. This proposed method successfullyseparated clusters and groups context terms according to how semantically related they are, producing improved disambiguation outcomes. A more detailedknowledge of word senses and their relationships may be obtained thanks to the clustering process, which makes it possible to identify smaller clusters inside larger clusters. The outcomes demonstrate how multilevel clustering may enhance the granularity and accuracy of WSD. Our solution overcomes the drawbacks of conventional approaches and provides a more fine-grained representation of word senses by combining clustering algorithms.","PeriodicalId":503380,"journal":{"name":"Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141681598","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 : 2024-07-03DOI: 10.7494/csci.2024.25.2.5740
Ruslan Shevchuk, I. Yakymenko, M. Karpinski, Inna Shylinska, M. Kasianchuk
This paper presents the theoretical foundations of finding the inverse of a polynomial modulo in the ring Z[x] based on the method of undetermined coefficients. The use of the latter makes it possible to significantly reduce the time complexity of calculations avoiding the operation of finding the greatest common divisor. An example of calculating the inverse of a polynomial modulo in the ring Z[x] based on the proposed approach is given. Analytical expressions of the time complexities of the developed and classical methods depending on the degrees of polynomials are built. The graphic dependence of the complexity of performing the operation of finding the inverse of a polynomial in the ring Z[x] is presented, which shows the advantages of the method based on undetermined coefficients. It is found that the efficiency of the developed method increases logarithmically with an increase in the degrees of polynomials.
{"title":"Finding The Inverse of A Polynomial Modulo in The Ring Z[X] Based on The Method of Undetermined Coefficients","authors":"Ruslan Shevchuk, I. Yakymenko, M. Karpinski, Inna Shylinska, M. Kasianchuk","doi":"10.7494/csci.2024.25.2.5740","DOIUrl":"https://doi.org/10.7494/csci.2024.25.2.5740","url":null,"abstract":"This paper presents the theoretical foundations of finding the inverse of a polynomial modulo in the ring Z[x] based on the method of undetermined coefficients. The use of the latter makes it possible to significantly reduce the time complexity of calculations avoiding the operation of finding the greatest common divisor. An example of calculating the inverse of a polynomial modulo in the ring Z[x] based on the proposed approach is given. Analytical expressions of the time complexities of the developed and classical methods depending on the degrees of polynomials are built. The graphic dependence of the complexity of performing the operation of finding the inverse of a polynomial in the ring Z[x] is presented, which shows the advantages of the method based on undetermined coefficients. It is found that the efficiency of the developed method increases logarithmically with an increase in the degrees of polynomials. ","PeriodicalId":503380,"journal":{"name":"Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141680716","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 : 2024-03-10DOI: 10.7494/csci.2024.25.1.6153
M. Flasiński
Formal tools and models of syntactic pattern recognition which are used in bioinformatics are introduced and characterized in the paper. They include, among others: stochastic (string) grammars and automata, hidden Markov models, programmed grammars, attributed grammars, stochastic tree grammars, Tree Adjoining Grammars (TAGs), algebraic dynamic programming, NLC- and NCE-type graph grammars, and algebraic graph transformation systems. The survey of applications of these formal tools and models in bioinformatics is presented.
本文介绍了生物信息学中使用的句法模式识别的形式工具和模型，并对其进行了描述。其中包括：随机（字符串）语法和自动机、隐马尔可夫模型、编程语法、归因语法、随机树语法、树邻接语法（TAG）、代数动态编程、NLC 和 NCE 型图语法以及代数图转换系统。本文介绍了这些形式化工具和模型在生物信息学中的应用。
{"title":"A Survey on Syntactic Pattern Recognition Methods in Bioinformatics","authors":"M. Flasiński","doi":"10.7494/csci.2024.25.1.6153","DOIUrl":"https://doi.org/10.7494/csci.2024.25.1.6153","url":null,"abstract":"Formal tools and models of syntactic pattern recognition which are used in bioinformatics are introduced and characterized in the paper. They include, among others: stochastic (string) grammars and automata, hidden Markov models, programmed grammars, attributed grammars, stochastic tree grammars, Tree Adjoining Grammars (TAGs), algebraic dynamic programming, NLC- and NCE-type graph grammars, and algebraic graph transformation systems. The survey of applications of these formal tools and models in bioinformatics is presented.","PeriodicalId":503380,"journal":{"name":"Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140254815","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}
Clustering is a crucial technique in both research and practical applications of data mining. It has traditionally functioned as a pivotal analytical technique, facilitating the organization of unlabeled data to extract meaningful insights. The inherent complexity of clustering challenges has led to the development of a variety of clustering algorithms. Each of these algorithms is tailored to address specific data clustering scenarios. In this context, this paper provides a thorough analysis of clustering techniques in data mining, including their challenges and applications in various domains. It also undertakes an extensive exploration of the strengths and limitations characterizing distinct clustering methodologies, encompassing distance-based, hierarchical, grid-based, and density-based algorithms. Additionally, it explains numerous examples of clustering algorithms and their empirical results in various domains, including but not limited to healthcare, image processing, text and document clustering, and the field of big data analytics.
{"title":"Veri Madenciliğinde Kümeleme Teknikleri: Yöntemler, Zorluklar ve Uygulamalar Üzerine Bir Araştırma","authors":"Tasnim Alasali, Yasin Ortakci","doi":"10.53070/bbd.1421527","DOIUrl":"https://doi.org/10.53070/bbd.1421527","url":null,"abstract":"Clustering is a crucial technique in both research and practical applications of data mining. It has traditionally functioned as a pivotal analytical technique, facilitating the organization of unlabeled data to extract meaningful insights. The inherent complexity of clustering challenges has led to the development of a variety of clustering algorithms. Each of these algorithms is tailored to address specific data clustering scenarios. In this context, this paper provides a thorough analysis of clustering techniques in data mining, including their challenges and applications in various domains. It also undertakes an extensive exploration of the strengths and limitations characterizing distinct clustering methodologies, encompassing distance-based, hierarchical, grid-based, and density-based algorithms. Additionally, it explains numerous examples of clustering algorithms and their empirical results in various domains, including but not limited to healthcare, image processing, text and document clustering, and the field of big data analytics.","PeriodicalId":503380,"journal":{"name":"Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140263943","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}
This research study presents NotFyCEX - a price notification systems model based on Internet of Things (IoT) and Blockchain technology for reporting important trends in a Cryptocurrency Exchange (CRYPTEX) market. The system is simulated in near real time using a co-simulator approach including web-based PHP server-side application for emulating price fluctuations, a dynamic neural network model application integrated within the MATLAB/SIMULINK software environment and ArduinoUNO hardware for continual physical signalling/alerting. Dynamic simulation results showed exact matches between synthesized price state representations and the predicted pattern states. Thus, we consider NotFyCEX a novel effort that can effectively serve as a notification and price prediction system to the end-user or cryptocurrency trader in a given CRYPTEX market.
{"title":"NotFYCEX: A Simulation Based Price Prediction and Notification System Using Continuous Machine Learning Method","authors":"E. N. Osegi, V.ı. Ani̇reh, J.ı. Mgbeafuli̇ke","doi":"10.53070/bbd.1410394","DOIUrl":"https://doi.org/10.53070/bbd.1410394","url":null,"abstract":"This research study presents NotFyCEX - a price notification systems model based on Internet of Things (IoT) and Blockchain technology for reporting important trends in a Cryptocurrency Exchange (CRYPTEX) market. The system is simulated in near real time using a co-simulator approach including web-based PHP server-side application for emulating price fluctuations, a dynamic neural network model application integrated within the MATLAB/SIMULINK software environment and ArduinoUNO hardware for continual physical signalling/alerting. Dynamic simulation results showed exact matches between synthesized price state representations and the predicted pattern states. Thus, we consider NotFyCEX a novel effort that can effectively serve as a notification and price prediction system to the end-user or cryptocurrency trader in a given CRYPTEX market.","PeriodicalId":503380,"journal":{"name":"Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140461647","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 : 2024-02-04DOI: 10.7494/csci.2024.25.1.5633
Dariusz Mikołajewski, Anna Bryniarska, Piotr M. Wilczek, Maria Myslicka, Adam Sudol, Dominik Tenczynski, Michal Kostro, Dominika Rekawek, Rafal Tichy, Rafal Gasz, Mariusz Pelc, J. Zygarlicki, Michal Koziol, R. Martínek, Radana Kahankova Vilimkova, Dominik Vilimek, Aleksandra Kawala-Sterniuk
There is a widespread belief that VR technologies can provide controlled, multi-sensory, interactive 3D stimulus environments that engage patients in interventions and measure, record and motivate required human performance. In order to investigate state-of-the-art and associated occupations we provided a careful review of 6 leading medical and technical bibliometric databases. Despite the apparent popularity of the topic of VR use in cardiac surgery, only 47 articles published between 2002 and 2022 met the inclusion criteria. Based on them VR-based solutions in cardiac surgery are useful both for medical specialists and for the patients themselves. The new lifestyle required from cardiac surgery patients is easier to implement thanks to VR-based educational and motivational tools. However, it is necessary to develop the above-mentioned tools and compare their effectiveness with Augmented Reality (AR). With the aforementioned reasons, interdisciplinary collaboration between scientists, clinicians and engineers is necessary.
{"title":"Most Current Solutions using Virtual-Reality-Based Methods in Cardiac Surgery -- A Survey","authors":"Dariusz Mikołajewski, Anna Bryniarska, Piotr M. Wilczek, Maria Myslicka, Adam Sudol, Dominik Tenczynski, Michal Kostro, Dominika Rekawek, Rafal Tichy, Rafal Gasz, Mariusz Pelc, J. Zygarlicki, Michal Koziol, R. Martínek, Radana Kahankova Vilimkova, Dominik Vilimek, Aleksandra Kawala-Sterniuk","doi":"10.7494/csci.2024.25.1.5633","DOIUrl":"https://doi.org/10.7494/csci.2024.25.1.5633","url":null,"abstract":"There is a widespread belief that VR technologies can provide controlled, multi-sensory, interactive 3D stimulus environments that engage patients in interventions and measure, record and motivate required human performance. In order to investigate state-of-the-art and associated occupations we provided a careful review of 6 leading medical and technical bibliometric databases. Despite the apparent popularity of the topic of VR use in cardiac surgery, only 47 articles published between 2002 and 2022 met the inclusion criteria. Based on them VR-based solutions in cardiac surgery are useful both for medical specialists and for the patients themselves. The new lifestyle required from cardiac surgery patients is easier to implement thanks to VR-based educational and motivational tools. However, it is necessary to develop the above-mentioned tools and compare their effectiveness with Augmented Reality (AR). With the aforementioned reasons, interdisciplinary collaboration between scientists, clinicians and engineers is necessary.","PeriodicalId":503380,"journal":{"name":"Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139807203","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 : 2024-02-04DOI: 10.7494/csci.2024.25.1.5633
Dariusz Mikołajewski, Anna Bryniarska, Piotr M. Wilczek, Maria Myslicka, Adam Sudol, Dominik Tenczynski, Michal Kostro, Dominika Rekawek, Rafal Tichy, Rafal Gasz, Mariusz Pelc, J. Zygarlicki, Michal Koziol, R. Martínek, Radana Kahankova Vilimkova, Dominik Vilimek, Aleksandra Kawala-Sterniuk
There is a widespread belief that VR technologies can provide controlled, multi-sensory, interactive 3D stimulus environments that engage patients in interventions and measure, record and motivate required human performance. In order to investigate state-of-the-art and associated occupations we provided a careful review of 6 leading medical and technical bibliometric databases. Despite the apparent popularity of the topic of VR use in cardiac surgery, only 47 articles published between 2002 and 2022 met the inclusion criteria. Based on them VR-based solutions in cardiac surgery are useful both for medical specialists and for the patients themselves. The new lifestyle required from cardiac surgery patients is easier to implement thanks to VR-based educational and motivational tools. However, it is necessary to develop the above-mentioned tools and compare their effectiveness with Augmented Reality (AR). With the aforementioned reasons, interdisciplinary collaboration between scientists, clinicians and engineers is necessary.
{"title":"Most Current Solutions using Virtual-Reality-Based Methods in Cardiac Surgery -- A Survey","authors":"Dariusz Mikołajewski, Anna Bryniarska, Piotr M. Wilczek, Maria Myslicka, Adam Sudol, Dominik Tenczynski, Michal Kostro, Dominika Rekawek, Rafal Tichy, Rafal Gasz, Mariusz Pelc, J. Zygarlicki, Michal Koziol, R. Martínek, Radana Kahankova Vilimkova, Dominik Vilimek, Aleksandra Kawala-Sterniuk","doi":"10.7494/csci.2024.25.1.5633","DOIUrl":"https://doi.org/10.7494/csci.2024.25.1.5633","url":null,"abstract":"There is a widespread belief that VR technologies can provide controlled, multi-sensory, interactive 3D stimulus environments that engage patients in interventions and measure, record and motivate required human performance. In order to investigate state-of-the-art and associated occupations we provided a careful review of 6 leading medical and technical bibliometric databases. Despite the apparent popularity of the topic of VR use in cardiac surgery, only 47 articles published between 2002 and 2022 met the inclusion criteria. Based on them VR-based solutions in cardiac surgery are useful both for medical specialists and for the patients themselves. The new lifestyle required from cardiac surgery patients is easier to implement thanks to VR-based educational and motivational tools. However, it is necessary to develop the above-mentioned tools and compare their effectiveness with Augmented Reality (AR). With the aforementioned reasons, interdisciplinary collaboration between scientists, clinicians and engineers is necessary.","PeriodicalId":503380,"journal":{"name":"Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139867176","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 : 2024-02-04DOI: 10.7494/csci.2024.25.1.5330
J. T. Stańczak
Evolutionary algorithms mimic some elements of the theory of evolution. The survival of individuals and the possibility of producing offspring play a huge role in the process of natural evolution. This process is called a natural selection. This mechanism is responsible for eliminating poor population members and gives the possibility of development for good ones. The evolutionary algorithm - an instance of evolution in the computer environment also requires a selection method, a computer version of natural selection. Widely used standard selection methods applied in evolutionary algorithms are usually derived from nature and prefer competition, randomness and some kind of ``fight'' among individuals. But computer environment is quite different from nature. Computer populations of individuals are usually small, they easily suffer from a premature convergence to local extremes. To avoid this drawback, computer selection methods must have different features than natural selection. In the computer selection methods randomness, fight and competition should be controlled or influenced to operate to the desired extent. Several new methods of individual selection are proposed in this work: several kinds of mixed selection, an interval selection and a taboo selection. Also advantages of passing them into the evolutionary algorithm are shown, using examples based on searching for the maximum α-clique problem and traditional TSP in comparison with traditionally considered as very efficient tournament selection, considered ineffective proportional (roulette) selection and similar classical methods.
{"title":"Efficient Selection Methods in Evolutionary Algorithms","authors":"J. T. Stańczak","doi":"10.7494/csci.2024.25.1.5330","DOIUrl":"https://doi.org/10.7494/csci.2024.25.1.5330","url":null,"abstract":"Evolutionary algorithms mimic some elements of the theory of evolution. The survival of individuals and the possibility of producing offspring play a huge role in the process of natural evolution. This process is called a natural selection. This mechanism is responsible for eliminating poor population members and gives the possibility of development for good ones. The evolutionary algorithm - an instance of evolution in the computer environment also requires a selection method, a computer version of natural selection. Widely used standard selection methods applied in evolutionary algorithms are usually derived from nature and prefer competition, randomness and some kind of ``fight'' among individuals. But computer environment is quite different from nature. Computer populations of individuals are usually small, they easily suffer from a premature convergence to local extremes. To avoid this drawback, computer selection methods must have different features than natural selection. In the computer selection methods randomness, fight and competition should be controlled or influenced to operate to the desired extent. Several new methods of individual selection are proposed in this work: several kinds of mixed selection, an interval selection and a taboo selection. Also advantages of passing them into the evolutionary algorithm are shown, using examples based on searching for the maximum α-clique problem and traditional TSP in comparison with traditionally considered as very efficient tournament selection, considered ineffective proportional (roulette) selection and similar classical methods.","PeriodicalId":503380,"journal":{"name":"Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139866430","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
扫码关注我们
求助内容：
应助结果提醒方式：