首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 9 毫秒
1.
Breast cancer is one of the most prevalent types of cancers in females, which has become rampant all over the world in recent years. The survival rate of breast cancer patients degrades considerably for patients diagnosed at an advanced stage compared to those diagnosed at an early stage. The objective of this study is two folds. The first one is to find the most relevant biomarkers of breast cancer, which can be attained from regular blood analysis and anthropometric measurements. The other one is to improve the performance of current computer-aided diagnosis (CAD) system of early breast cancer detection. This study utilized a recent data set containing nine anthropometric and clinical attributes. In our methodology, first, we performed multicollinearity analysis and ranked the features based on the weighted average score obtained from four filter-based feature evaluation methods such as F-score, information gain, chi-square statistic, and Minimum Redundancy Maximum Relevance. Next, to improve the separability of the target classes, we scaled and weighted the dataset using min-max normalization and similarity-based attribute weighting by the k-means clustering algorithm, respectively. Finally, we trained standard machine learning (ML) models and evaluated the performance metrics by 10-fold cross-validation method. Our support vector machine (SVM) model with radial basis function (RBF) kernel appeared to be the most successful classifier by utilizing six features, namely, Body Mass Index (BMI), Age, Glucose, MCP-1, Resistin, and Insulin. The obtained classification accuracy, sensitivity, and specificity are 93.9% (95% CI: 93.2–94.6%), 95.1% (95% CI: 94.4–95.8%), and 94.0% (95% CI: 93.3–94.7%), respectively; these performance metrics outperformed state-of-the-art methods reported in the literature. The developed model could potentially assist the medical experts for the early diagnosis of breast cancer by employing a set of attributes that can be easily obtained from regular blood analysis and anthropometric measurements.  相似文献   

2.
    
《IRBM》2022,43(5):434-446
ObjectiveThe initial principal task of a Brain-Computer Interfacing (BCI) research is to extract the best feature set from a raw EEG (Electroencephalogram) signal so that it can be used for the classification of two or multiple different events. The main goal of the paper is to develop a comparative analysis among different feature extraction techniques and classification algorithms.Materials and methodsIn this present investigation, four different methodologies have been adopted to classify the recorded MI (motor imagery) EEG signal, and their comparative study has been reported. Haar Wavelet Energy (HWE), Band Power, Cross-correlation, and Spectral Entropy (SE) based Cross-correlation feature extraction techniques have been considered to obtain the necessary features set from the raw EEG signals. Four different machine learning algorithms, viz. LDA (Linear Discriminant Analysis), QDA (Quadratic Discriminant Analysis), Naïve Bayes, and Decision Tree, have been used to classify the features.ResultsThe best average classification accuracies are 92.50%, 93.12%, 72.26%, and 98.71% using the four methods. Further, these results have been compared with some recent existing methods.ConclusionThe comparative results indicate a significant accuracy level performance improvement of the proposed methods with respect to the existing one. Hence, this presented work can guide to select the best feature extraction method and the classifier algorithm for MI-based EEG signals.  相似文献   

3.
    
《IRBM》2022,43(6):705-714
BackgroundThe changes in electroencephalogram (EEG) signals that reflect the changes in physiological structure, cognitive functions, and activities have been observed in healthy aging adults. It is unknown that when the brain aging initiates and whether these age-related alterations can be associated with incipient neurodegenerative diseases in healthy elderly individuals.Materials and methodsWe employed feature extraction and classification methods to classify and compare the EEG signals of middle-aged and elderly age groups. This study included 20 healthy middle-aged and 20 healthy elderly subjects. The EEG signals were recorded during a resting state (eyes-open and eyes-closed) and during a working memory (WM) task using eight electrodes. The minimum redundancy maximum relevance technique was employed in the selection of the optimal feature. Four classification methods, including decision tree, support vector machine, Naïve Bayes, and K-nearest neighbor, were used to distinguish the elderly age group from the middle-aged group based on their EEG signals.ResultsIn the resting state, a good correlation was observed among absolute power delta and theta bands and aging, whereas between beta absolute power and aging, a WM task correlation was observed. The results also indicated that the mean frequency and absolute power might be useful for the prediction and classification of EEG signals in aging individuals. Furthermore, the use of the decision tree method in a WM task state distinguished the elderly group from the middle-aged group with an accuracy of 87.5%.ConclusionsWorking memory could play a vital role in the optimization of classification of EEG signals in aging and discrimination of age-related issues associated with neurodegeneration.  相似文献   

4.
泛素化是目前广受关注的一种翻译后修饰过程,对蛋白质降解、DNA修复等多种细胞过程都具有重要的调控作用。本文根据国内外蛋白质泛素化位点预测的研究,分析了预测泛素化位点的特征属性,总结了对这些特征进行优化的特征选择方法,并对预测过程中所使用的各种机器学习分类器进行了概述。  相似文献   

5.
    
《IRBM》2020,41(4):229-239
Feature selection algorithms are the cornerstone of machine learning. By increasing the properties of the samples and samples, the feature selection algorithm selects the significant features. The general name of the methods that perform this function is the feature selection algorithm. The general purpose of feature selection algorithms is to select the most relevant properties of data classes and to increase the classification performance. Thus, we can select features based on their classification performance. In this study, we have developed a feature selection algorithm based on decision support vectors classification performance. The method can work according to two different selection criteria. We tested the classification performances of the features selected with P-Score with three different classifiers. Besides, we assessed P-Score performance with 13 feature selection algorithms in the literature. According to the results of the study, the P-Score feature selection algorithm has been determined as a method which can be used in the field of machine learning.  相似文献   

6.
    
MS/MS is a widely used method for proteome‐wide analysis of protein expression and PTMs. The thousands of MS/MS spectra produced from a single experiment pose a major challenge for downstream analysis. Standard programs, such as MASCOT, provide peptide assignments for many of the spectra, including identification of PTM sites, but these results are plagued by false‐positive identifications. In phosphoproteomic experiments, only a single peptide assignment is typically available to support identification of each phosphorylation site, and hence minimizing false positives is critical. Thus, tedious manual validation is often required to increase confidence in the spectral assignments. We have developed phoMSVal, an open‐source platform for managing MS/MS data and automatically validating identified phosphopeptides. We tested five classification algorithms with 17 extracted features to separate correct peptide assignments from incorrect ones using over 2600 manually curated spectra. The naïve Bayes algorithm was among the best classifiers with an AUC value of 97% and PPV of 97% for phosphotyrosine data. This classifier required only three features to achieve a 76% decrease in false positives as compared with MASCOT while retaining 97% of true positives. This algorithm was able to classify an independent phosphoserine/threonine data set with AUC value of 93% and PPV of 91%, demonstrating the applicability of this method for all types of phospho‐MS/MS data. PhoMSVal is available at http://csbi.ltdk.helsinki.fi/phomsval .  相似文献   

7.
针对DNA序列编码区的识别问题,本研究提出一个特征向量和逻辑回归的组合模型。首先对DNA序列进行数值处理转化为特征向量,并结合k字符相对频率技术提取特征向量的元素特征,之后利用二分类逻辑回归算法,对编码区和非编码区进行准确区分。选取了HMR195和BG570两个基准数据集进行五折交叉验证,结果表明,平均AUC(Area Under Curve)值分别为0.981 3和0.987 4,明显优于传统的贝叶斯判别法和VOSSDFT等方法。此外,本文提出的特征向量的维度很低,提高了运算效率。因此,本文组合模型能够较为高效准确地识别蛋白质编码区。  相似文献   

8.
长链非编码RNA(Long non-coding RNA, lncRNA)是一类被定义为转录本的长度大于200 nt、没有蛋白编码能力的RNA转录本。研究表明,lncRNA在调节植物生长发育、表观遗传反应以及各种胁迫反应中起重要作用。但是与人类和动物相比,植物lncRNA的研究仍然处于起步阶段。目前,如何从大量的转录本中准确地挑选出lncRNA仍然是植物lncRNA研究领域的重要问题之一。本文构建了新的植物lncRNA和mRNA数据集,分析了数据集中植物lncRNA的序列及结构特征,提取了序列的k-mer频数信息、二级结构信息、开放阅读框信息以及序列的几何柔性等特征,基于SVM(Support Vector Machine, SVM)算法,用Jackknife检验对植物lncRNA进行了预测,并且计算了各种特征融合后对植物lncRNA预测结果的影响,准确率达到了96.14%。  相似文献   

9.
目的:近红外光谱技术在无创血糖检测中面临因个体差异导致的模型泛化性不足问题,为了解决这一问题,提高数据利用率,并建立泛化能力更强的预测模型,本研究引入了迁移学习方法来研究近红外光谱非侵入性血糖检测。方法:迁移学习是一种旨在将源域的知识迁移到目标域,从而提高目标域任务性能的机器学习技术。在本研究中,我们将社区人群数据作为源域,将学生群体数据作为目标域,以改善无创血糖检测模型在目标域上的表现。为了验证迁移学习的有效性,本研究对比了迁移学习前后模型的性能。结果:通过迁移学习策略,模型在无创血糖检测任务中的表现得到了显著提升,迁移后的模型MAPE与MAE分别下降了52.5460%与6.0805%,RMSE与MSE分别下降了10.7215%与12.1135%。结论:本研究展示了迁移学习在非侵入性血糖检测领域的应用前景,通过将源域中难以获取但与血糖值相关的特征迁移到目标域,有望在未来实现便携式、连续性的血糖监测,这将极大地提高糖尿病患者的生活质量。无创血糖检测技术的进步,不仅能够减少患者的痛苦,还能提供更为便捷的血糖监测手段,为糖尿病管理提供有力支持。  相似文献   

10.
    
《IRBM》2020,41(4):185-194
Cardiac arrhythmia is a condition when the heart rate is irregular either the beat is too slow or too fast. It occurs due to improper electrical impulses that coordinates the heart beats. Sudden cardiac death may occurs due to some dangerous arrhythmias conditions. Hence the main objective of the electrocardiogram (ECG) analysis is to detect the life-threatening arrhythmias accurately for appropriate treatment in order to save life. Since the last decades, several methods were reported for automatic ECG beat classifications. In this work, we present a systematic review of the current state-of-the-art methods used to detect cardiac arrhythmia using on ECG signals. It includes the signal decomposition, feature extraction and machine learning approaches used for automatic detection and decision making process. The articles covers the pre-processing, detection of QRS complex, feature extraction and classification of ECG beats. Based on the past studies, it is understood that the automated approach using computer-aided decision making process is highly required for real-time detection of cardiac arrhythmias. The advantages and limitations of different methods are discussed and also the future scopes is highlighted in the process of effective detection of cardiac arrhythmias. This study could be beneficial for researchers to analyze the existing state-of-art techniques used in detection of arrhythmia conditions.  相似文献   

11.
Huang T  Zhang J  Xu ZP  Hu LL  Chen L  Shao JL  Zhang L  Kong XY  Cai YD  Chou KC 《Biochimie》2012,94(4):1017-1025
Longevity is one of the most basic and one of the most essential properties of all living organisms. Identification of genes that regulate longevity would increase understanding of the mechanisms of aging, so as to help facilitate anti-aging intervention and extend the life span. In this study, based on the network features and the biochemical/physicochemical features of the deletion network and deletion genes, as well as their functional features, a two-layer model was developed for predicting the deletion effects on yeast longevity. The first stage of our prediction approach was to identify whether the deletion of one gene would change the life span of yeast; if it did, the second stage of our procedure would automatically proceed to predict whether the deletion of one gene would increase or decrease the life span. It was observed by analyzing the predicted results that the functional features (such as mitochondrial function and chromatin silencing), the network features (such as the edge density and edge weight density of the deletion network), and the local centrality of deletion gene, would have important impact for predicting the deletion effects on longevity. It is anticipated that our model may become a useful tool for studying longevity from the angle of genes and networks. Moreover, it has not escaped our notice that, after some modification, the current model can also be used to study many other phenotype prediction problems from the angle of systems biology.  相似文献   

12.
    
《IRBM》2022,43(4):272-278
PurposeVulnerable plaque of carotid atherosclerosis is prone to rupture, which can easily lead to acute cardiovascular and cerebrovascular accidents. Accurate identification of the vulnerable plaque is a challenging task, especially on limited datasets.MethodsThis paper proposes a multi-feature fusion method to identify high-risk plaque, in which three types of features are combined, i.e. global features of carotid ultrasound images, echo features of regions of interests (ROI) and expert knowledge from ultrasound reports. Due to the fusion of three types of features, more critical features for identifying high-risk plaque are included in the feature set. Therefore, better performance can be achieved even on limited datasets.ResultsFrom testing all combinations of three types of features, the results showed that the accuracy of using all three types of features is the highest. The experiments also showed that the performance of the proposed method is better than other plaque classification methods and classical Convolutional Neural Networks (CNNs) on the Plaque dataset.ConclusionThe proposed method helped to build a more complete feature set so that the machine learning models could identify vulnerable plaque more accurately even on datasets with poor quality and small scale.  相似文献   

13.
单细胞转录组测序(scRNA-seq)已被广泛应用于基础医学研究中,分析和挖掘scRNA-seq数据有助于深入理解病变组织的细胞组成结构和功能,揭示复杂疾病过程和阐明药物作用机制,进而推动精准医学的发展。然而,如何基于海量的scRNA-seq数据对患者疾病表型进行预测,并筛选关键特征是单细胞技术临床转化的关键问题。本文综述了基于单细胞转录组数据进行患者疾病表型预测的相关方法,并对原理、算法、优缺点进行归纳和讨论,最后对相关研究的发展和应用进行了展望。  相似文献   

14.
         下载免费PDF全文
With the increasing dimensionality of the data, High-dimensional Feature Selection (HFS) becomes an increasingly difficult task. It is not simple to find the best subset of features due to the breadth of the search space and the intricacy of the interactions between features. Many of the Feature Selection (FS) approaches now in use for these problems perform significantly less well when faced with such intricate situations involving high-dimensional search spaces. It is demonstrated that meta-heuristic algorithms can provide sub-optimal results in an acceptable amount of time. This paper presents a new binary Boosted version of the Spider Wasp Optimizer (BSWO) called Binary Boosted SWO (BBSWO), which combines a number of successful and promising strategies, in order to deal with HFS. The shortcomings of the original BSWO, including early convergence, settling into local optimums, limited exploration and exploitation, and lack of population diversity, were addressed by the proposal of this new variant of SWO. The concept of chaos optimization is introduced in BSWO, where initialization is consistently produced by utilizing the properties of sine chaos mapping. A new convergence parameter was then incorporated into BSWO to achieve a promising balance between exploration and exploitation. Multiple exploration mechanisms were then applied in conjunction with several exploitation strategies to effectively enrich the search process of BSWO within the search space. Finally, quantum-based optimization was added to enhance the diversity of the search agents in BSWO. The proposed BBSWO not only offers the most suitable subset of features located, but it also lessens the data’s redundancy structure. BBSWO was evaluated using the k-Nearest Neighbor (k-NN) classifier on 23 HFS problems from the biomedical domain taken from the UCI repository. The results were compared with those of traditional BSWO and other well-known meta-heuristics-based FS. The findings indicate that, in comparison to other competing techniques, the proposed BBSWO can, on average, identify the least significant subsets of features with efficient classification accuracy of the k-NN classifier.>  相似文献   

15.
         下载免费PDF全文
With the increasing dimensionality of the data, High-dimensional Feature Selection (HFS) becomes an increasingly difficult task. It is not simple to find the best subset of features due to the breadth of the search space and the intricacy of the interactions between features. Many of the Feature Selection (FS) approaches now in use for these problems perform significantly less well when faced with such intricate situations involving high-dimensional search spaces. It is demonstrated that meta-heuristic algorithms can provide sub-optimal results in an acceptable amount of time. This paper presents a new binary Boosted version of the Spider Wasp Optimizer (BSWO) called Binary Boosted SWO (BBSWO), which combines a number of successful and promising strategies, in order to deal with HFS. The shortcomings of the original BSWO, including early convergence, settling into local optimums, limited exploration and exploitation, and lack of population diversity, were addressed by the proposal of this new variant of SWO. The concept of chaos optimization is introduced in BSWO, where initialization is consistently produced by utilizing the properties of sine chaos mapping. A new convergence parameter was then incorporated into BSWO to achieve a promising balance between exploration and exploitation. Multiple exploration mechanisms were then applied in conjunction with several exploitation strategies to effectively enrich the search process of BSWO within the search space. Finally, quantum-based optimization was added to enhance the diversity of the search agents in BSWO. The proposed BBSWO not only offers the most suitable subset of features located, but it also lessens the data’s redundancy structure. BBSWO was evaluated using the k-Nearest Neighbor (k-NN) classifier on 23 HFS problems from the biomedical domain taken from the UCI repository. The results were compared with those of traditional BSWO and other well-known meta-heuristics-based FS. The findings indicate that, in comparison to other competing techniques, the proposed BBSWO can, on average, identify the least significant subsets of features with efficient classification accuracy of the k-NN classifier.>  相似文献   

16.
         下载免费PDF全文
With the increasing dimensionality of the data, High-dimensional Feature Selection (HFS) becomes an increasingly difficult task. It is not simple to find the best subset of features due to the breadth of the search space and the intricacy of the interactions between features. Many of the Feature Selection (FS) approaches now in use for these problems perform significantly less well when faced with such intricate situations involving high-dimensional search spaces. It is demonstrated that meta-heuristic algorithms can provide sub-optimal results in an acceptable amount of time. This paper presents a new binary Boosted version of the Spider Wasp Optimizer (BSWO) called Binary Boosted SWO (BBSWO), which combines a number of successful and promising strategies, in order to deal with HFS. The shortcomings of the original BSWO, including early convergence, settling into local optimums, limited exploration and exploitation, and lack of population diversity, were addressed by the proposal of this new variant of SWO. The concept of chaos optimization is introduced in BSWO, where initialization is consistently produced by utilizing the properties of sine chaos mapping. A new convergence parameter was then incorporated into BSWO to achieve a promising balance between exploration and exploitation. Multiple exploration mechanisms were then applied in conjunction with several exploitation strategies to effectively enrich the search process of BSWO within the search space. Finally, quantum-based optimization was added to enhance the diversity of the search agents in BSWO. The proposed BBSWO not only offers the most suitable subset of features located, but it also lessens the data’s redundancy structure. BBSWO was evaluated using the k-Nearest Neighbor (k-NN) classifier on 23 HFS problems from the biomedical domain taken from the UCI repository. The results were compared with those of traditional BSWO and other well-known meta-heuristics-based FS. The findings indicate that, in comparison to other competing techniques, the proposed BBSWO can, on average, identify the least significant subsets of features with efficient classification accuracy of the k-NN classifier.>  相似文献   

17.
         下载免费PDF全文
With the increasing dimensionality of the data, High-dimensional Feature Selection (HFS) becomes an increasingly difficult task. It is not simple to find the best subset of features due to the breadth of the search space and the intricacy of the interactions between features. Many of the Feature Selection (FS) approaches now in use for these problems perform significantly less well when faced with such intricate situations involving high-dimensional search spaces. It is demonstrated that meta-heuristic algorithms can provide sub-optimal results in an acceptable amount of time. This paper presents a new binary Boosted version of the Spider Wasp Optimizer (BSWO) called Binary Boosted SWO (BBSWO), which combines a number of successful and promising strategies, in order to deal with HFS. The shortcomings of the original BSWO, including early convergence, settling into local optimums, limited exploration and exploitation, and lack of population diversity, were addressed by the proposal of this new variant of SWO. The concept of chaos optimization is introduced in BSWO, where initialization is consistently produced by utilizing the properties of sine chaos mapping. A new convergence parameter was then incorporated into BSWO to achieve a promising balance between exploration and exploitation. Multiple exploration mechanisms were then applied in conjunction with several exploitation strategies to effectively enrich the search process of BSWO within the search space. Finally, quantum-based optimization was added to enhance the diversity of the search agents in BSWO. The proposed BBSWO not only offers the most suitable subset of features located, but it also lessens the data’s redundancy structure. BBSWO was evaluated using the k-Nearest Neighbor (k-NN) classifier on 23 HFS problems from the biomedical domain taken from the UCI repository. The results were compared with those of traditional BSWO and other well-known meta-heuristics-based FS. The findings indicate that, in comparison to other competing techniques, the proposed BBSWO can, on average, identify the least significant subsets of features with efficient classification accuracy of the k-NN classifier.>  相似文献   

18.
         下载免费PDF全文
With the increasing dimensionality of the data, High-dimensional Feature Selection (HFS) becomes an increasingly difficult task. It is not simple to find the best subset of features due to the breadth of the search space and the intricacy of the interactions between features. Many of the Feature Selection (FS) approaches now in use for these problems perform significantly less well when faced with such intricate situations involving high-dimensional search spaces. It is demonstrated that meta-heuristic algorithms can provide sub-optimal results in an acceptable amount of time. This paper presents a new binary Boosted version of the Spider Wasp Optimizer (BSWO) called Binary Boosted SWO (BBSWO), which combines a number of successful and promising strategies, in order to deal with HFS. The shortcomings of the original BSWO, including early convergence, settling into local optimums, limited exploration and exploitation, and lack of population diversity, were addressed by the proposal of this new variant of SWO. The concept of chaos optimization is introduced in BSWO, where initialization is consistently produced by utilizing the properties of sine chaos mapping. A new convergence parameter was then incorporated into BSWO to achieve a promising balance between exploration and exploitation. Multiple exploration mechanisms were then applied in conjunction with several exploitation strategies to effectively enrich the search process of BSWO within the search space. Finally, quantum-based optimization was added to enhance the diversity of the search agents in BSWO. The proposed BBSWO not only offers the most suitable subset of features located, but it also lessens the data’s redundancy structure. BBSWO was evaluated using the k-Nearest Neighbor (k-NN) classifier on 23 HFS problems from the biomedical domain taken from the UCI repository. The results were compared with those of traditional BSWO and other well-known meta-heuristics-based FS. The findings indicate that, in comparison to other competing techniques, the proposed BBSWO can, on average, identify the least significant subsets of features with efficient classification accuracy of the k-NN classifier.>  相似文献   

19.
    
With the increasing dimensionality of the data, High-dimensional Feature Selection (HFS) becomes an increasingly difficult task. It is not simple to find the best subset of features due to the breadth of the search space and the intricacy of the interactions between features. Many of the Feature Selection (FS) approaches now in use for these problems perform significantly less well when faced with such intricate situations involving high-dimensional search spaces. It is demonstrated that meta-heuristic algorithms can provide sub-optimal results in an acceptable amount of time. This paper presents a new binary Boosted version of the Spider Wasp Optimizer (BSWO) called Binary Boosted SWO (BBSWO), which combines a number of successful and promising strategies, in order to deal with HFS. The shortcomings of the original BSWO, including early convergence, settling into local optimums, limited exploration and exploitation, and lack of population diversity, were addressed by the proposal of this new variant of SWO. The concept of chaos optimization is introduced in BSWO, where initialization is consistently produced by utilizing the properties of sine chaos mapping. A new convergence parameter was then incorporated into BSWO to achieve a promising balance between exploration and exploitation. Multiple exploration mechanisms were then applied in conjunction with several exploitation strategies to effectively enrich the search process of BSWO within the search space. Finally, quantum-based optimization was added to enhance the diversity of the search agents in BSWO. The proposed BBSWO not only offers the most suitable subset of features located, but it also lessens the data’s redundancy structure. BBSWO was evaluated using the k-Nearest Neighbor (k-NN) classifier on 23 HFS problems from the biomedical domain taken from the UCI repository. The results were compared with those of traditional BSWO and other well-known meta-heuristics-based FS. The findings indicate that, in comparison to other competing techniques, the proposed BBSWO can, on average, identify the least significant subsets of features with efficient classification accuracy of the k-NN classifier.>  相似文献   

20.
         下载免费PDF全文
With the increasing dimensionality of the data, High-dimensional Feature Selection (HFS) becomes an increasingly difficult task. It is not simple to find the best subset of features due to the breadth of the search space and the intricacy of the interactions between features. Many of the Feature Selection (FS) approaches now in use for these problems perform significantly less well when faced with such intricate situations involving high-dimensional search spaces. It is demonstrated that meta-heuristic algorithms can provide sub-optimal results in an acceptable amount of time. This paper presents a new binary Boosted version of the Spider Wasp Optimizer (BSWO) called Binary Boosted SWO (BBSWO), which combines a number of successful and promising strategies, in order to deal with HFS. The shortcomings of the original BSWO, including early convergence, settling into local optimums, limited exploration and exploitation, and lack of population diversity, were addressed by the proposal of this new variant of SWO. The concept of chaos optimization is introduced in BSWO, where initialization is consistently produced by utilizing the properties of sine chaos mapping. A new convergence parameter was then incorporated into BSWO to achieve a promising balance between exploration and exploitation. Multiple exploration mechanisms were then applied in conjunction with several exploitation strategies to effectively enrich the search process of BSWO within the search space. Finally, quantum-based optimization was added to enhance the diversity of the search agents in BSWO. The proposed BBSWO not only offers the most suitable subset of features located, but it also lessens the data’s redundancy structure. BBSWO was evaluated using the k-Nearest Neighbor (k-NN) classifier on 23 HFS problems from the biomedical domain taken from the UCI repository. The results were compared with those of traditional BSWO and other well-known meta-heuristics-based FS. The findings indicate that, in comparison to other competing techniques, the proposed BBSWO can, on average, identify the least significant subsets of features with efficient classification accuracy of the k-NN classifier.>  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号