• <tr id="yyy80"></tr>
  • <sup id="yyy80"></sup>
  • <tfoot id="yyy80"><noscript id="yyy80"></noscript></tfoot>
  • 99热精品在线国产_美女午夜性视频免费_国产精品国产高清国产av_av欧美777_自拍偷自拍亚洲精品老妇_亚洲熟女精品中文字幕_www日本黄色视频网_国产精品野战在线观看 ?

    Enhancing Cancer Classification through a Hybrid Bio-Inspired Evolutionary Algorithm for Biomarker Gene Selection

    2024-05-25 14:40:24HalaAlShamlanandHalahAlMazrua
    Computers Materials&Continua 2024年4期

    Hala AlShamlan and Halah AlMazrua

    Department of Information Technology,College of Computer and Information Sciences,King Saud University,P.O.Box 145111,Riyadh,4545,Saudi Arabia

    ABSTRACT In this study,our aim is to address the problem of gene selection by proposing a hybrid bio-inspired evolutionary algorithm that combines Grey Wolf Optimization (GWO) with Harris Hawks Optimization (HHO) for feature selection.The motivation for utilizing GWO and HHO stems from their bio-inspired nature and their demonstrated success in optimization problems.We aim to leverage the strengths of these algorithms to enhance the effectiveness of feature selection in microarray-based cancer classification.We selected leave-one-out cross-validation(LOOCV)to evaluate the performance of both two widely used classifiers,k-nearest neighbors(KNN)and support vector machine(SVM),on high-dimensional cancer microarray data.The proposed method is extensively tested on six publicly available cancer microarray datasets,and a comprehensive comparison with recently published methods is conducted.Our hybrid algorithm demonstrates its effectiveness in improving classification performance,Surpassing alternative approaches in terms of precision.The outcomes confirm the capability of our method to substantially improve both the precision and efficiency of cancer classification,thereby advancing the development of more efficient treatment strategies.The proposed hybrid method offers a promising solution to the gene selection problem in microarray-based cancer classification.It improves the accuracy and efficiency of cancer diagnosis and treatment,and its superior performance compared to other methods highlights its potential applicability in realworld cancer classification tasks.By harnessing the complementary search mechanisms of GWO and HHO,we leverage their bio-inspired behavior to identify informative genes relevant to cancer diagnosis and treatment.

    KEYWORDS Bio-inspired algorithms;bioinformatics;cancer classification;evolutionary algorithm;feature selection;gene expression;grey wolf optimizer;harris hawks optimization;k-nearest neighbor;support vector machine

    1 Introduction

    Authors are required to adhere to this Microsoft Word template in preparing their manuscripts for submission.It will speed up the review and typesetting process.

    In 2020,cancer claimed the lives of almost 10 million people worldwide,as reported by the World Health Organization(WHO).Disturbingly,there are dire projections indicating a 50%surge,leading to approximately 15 million new cases.Consequently,there is an urgent requirement for effective cancer prevention and treatment strategies[1,2].In cancer,cells within the organs or tissues of the human body exhibit uncontrolled growth,potentially spreading to adjacent regions or,in more advanced stages,to distant organs.Early detection is of paramount importance to enhance survival rates.Therefore,the identification of effective and predictive genes for cancer classification is critical.Achieving this objective entails the careful selection of an adequate number of features(genes)from DNA microarrays.

    It can be difficult to extract meaningful information from gene expression data due to the vast number of genes involved [3].The growing popularity of microarray data in cancer research classification has been attributed to the emergence of gene expression technologies,due mainly to the abundance of gene expression information (features/genes) available for detecting common patterns within a collection of samples.Cancer cells are identified with microarrays,which analyze DNA proteins to gain insight into their genes.Microarray data are organized according to a gene expression matrix,in which rows represent genes,and columns indicate experimental conditions[4].

    Our understanding of disease-gene associations is greatly enhanced by the use of microarray technology.When dimensionality is present,irrelevant genes can complicate cancer classification and data analysis.In order to solve this problem and extract useful information,a feature selection method and classification algorithm are employed.Through the use of these algorithms,cancer-related genes can be removed from microarrays in order to facilitate cancer classification [5].In the context of existing work,previous studies have focused on gene selection methods to improve the accuracy of cancer classification.However,the vast number of genes involved in gene expression data makes it difficult to extract meaningful information[3].This issue has led to the emergence of feature selection techniques,such as filtering,wrapping,and embedding,to identify informative genes and reduce dimensionality[5].Nevertheless,there is a need for more effective approaches that can overcome the limitations of existing methods.Recent publications indicate a growth in hybrid approaches to feature selection as part of the overall framework,as evidenced by the growing number of publications in recent years[6].Gene selection is a process that identifies the most informative and valuable genes for the classification problem.Achieving this is possible by eliminating irrelevant genes and noise in the data,resulting in a more accurate classification of cancer[4].By combining both filter and wrapper techniques,the hybrid method is able to provide the best of both worlds.The development of hybrid approaches has increased in recent years,including the combination of two wrappers and the merger of filter and wrapper methods.For accurate diagnosis,these approaches identify valuable genes.As a result of integrating the strengths of both techniques,hybrid methods achieve optimal results[4].

    In recent years,there has been significant research and development in the field of metaheuristic algorithms to tackle complex optimization problems.Notably,several novel algorithms have emerged,which have shown promising results in various domains.The liver cancer algorithm(LCA)[7] draws inspiration from the behavior of liver cells in response to tumor growth and has been successfully applied in tasks related to liver cancer,such as feature selection and classification.The slime mould algorithm(SMA)[8]replicates the foraging behavior of slime molds and has been used for optimization problems like routing optimization,image segmentation,and clustering.The moth search algorithm(MSA)[9]mimics moths’attraction to light and has found applications in feature selection,image processing,and data clustering.The hunger games search(HGS)[10] algorithm incorporates survival of the fittest principles,and it has been employed in feature selection,scheduling,and parameter tuning.The Runge Kutta method(RUN)[10],originally a numerical integration technique for solving differential equations,has been adapted for optimization problems in engineering design,control systems,and economic modeling.The colony predation algorithm (CPA) [10] is inspired by predator-prey interactions and has been applied to data clustering,image segmentation,and function optimization.The weighted mean of vectors (INFO) [10] algorithm combines candidate solutions using weighted means and has been used in feature selection,image processing,and data mining tasks.These recently proposed meta-heuristic algorithms offer innovative approaches to optimization and have the potential to address complex real-world challenges.

    In this study,we propose a novel hybrid feature selection method that addresses the challenges in cancer classification.Our approach combines two bio-inspired wrapper feature selection techniques and leverages the evolutionary and bio-inspired optimization algorithm GWO-HHO (Grey Wolf Optimizer-Harris Hawks Optimization),which integrates Grey Wolf Optimizer (GWO) and Harris Hawks Optimization(HHO).The main contributions of our research can be summarized as follows:

    Development of a Hybrid Feature Selection Method: We introduce a novel approach that combines bio-inspired wrapper techniques and the GWO-HHO algorithm.This hybrid method aims to overcome the limitations of existing feature selection methods and enhance the accuracy of cancer classification.

    Effective Selection of Relevant and Informative Genes:By utilizing our hybrid feature selection method,we aim to identify the most relevant and informative genes for cancer classification.This process helps to reduce dimensionality,eliminate irrelevant genes,and improve the accuracy of cancer diagnosis.

    Comprehensive Evaluation and Comparison: We conduct a comprehensive evaluation of our proposed method by analyzing six diverse binary and multiclass gene expression microarray datasets.Through this evaluation,we compare the performance of our hybrid approach against recently published algorithms,showcasing its superior accuracy in cancer classification and gene selection.

    Advancements in Cancer Research:By accurately classifying cancer and identifying informative genes,our approach contributes to advancing our understanding of the underlying biology of cancer.This knowledge can potentially lead to the development of more effective diagnostic and therapeutic strategies.

    In summary,our study addresses the challenges in cancer classification through the introduction of a hybrid feature selection method.By effectively selecting relevant and informative genes,our approach overcomes the limitations of existing methods and achieves superior performance in accurately classifying cancer.The results of our research contribute to advancements in cancer research and hold promise for the development of improved diagnostic and therapeutic interventions.

    In the subsequent sections of the paper,we have organized the content as follows: Section 2 provides the necessary background information related to the perspectives discussed in the related works section,which significantly influenced the development of our proposed method.In Section 3,we describe the approaches we propose for gene selection,outlining the methodologies and techniques employed.Section 4 presents the analysis of the data and experimental results,where we evaluate the performance of our method using diverse gene expression microarray datasets.Finally,in Section 5,we provide a comprehensive conclusion that summarizes the key findings of our research and discusses the implications,limitations,and potential future directions.

    2 Related Works

    In recent years,several methods have been proposed for cancer classification and gene selection in bioinformatics research.In this section,we review some of the related works that have addressed similar problems using different optimization algorithms and machine learning techniques.One of the related works is the GWO-SVM method proposed by AlMazrua et al.[11].They combined the Grey Wolf Optimizer (GWO)algorithm with Support Vector Machines(SVM)for feature selection in cancer classification.Their approach aimed to enhance the classification accuracy by selecting the most relevant genes for cancer diagnosis.Another related work is the GWO-KNN method,also proposed by AlMazrua et al.[11].In this study,they employed the GWO algorithm with the k-Nearest Neighbors(KNN)classifier for cancer classification.The GWO algorithm was used to optimize the feature subset selection process,while KNN was utilized for the classification task.

    The HHO-SVM method proposed by AlMazrua et al.[12]is another relevant work in this area.Here,they combined the Harris Hawks Optimization(HHO)algorithm with SVM for gene selection in cancer classification.Their approach aimed to improve the classification performance by identifying the most informative genes associated with cancer.

    Similarly,the HHO-KNN method proposed by AlMazrua et al.[12]utilized the HHO algorithm with KNN for cancer biomarker gene detection.By applying the HHO algorithm,they aimed to identify the most discriminative genes that could serve as potential biomarkers for cancer diagnosis.The HS-GA method[13]is also worth mentioning,as it employed a Hybridization of Harmony Search(HS) and Genetic Algorithm (GA) for gene selection in cancer classification.The hybrid algorithm aimed to improve the search efficiency by combining the exploration capabilities of HS and the exploitation abilities of GA.

    Additionally,the FF-SVM method proposed by Almugren et al.[14] utilized a Fuzzy Expert System(FF)along with SVM for classification of microarray data.Their approach aimed to improve the classification accuracy by incorporating fuzzy logic to handle the uncertainty in gene expression data.Lastly,the GBC method proposed by Alshamlan et al.[15]introduced the Genetic Bee Colony(GBC)algorithm for gene selection in microarray cancer classification.The GBC algorithm aimed to optimize the gene selection process by simulating the foraging behavior of bee colonies.

    In the context of evolutionary algorithms and feature selection,several relevant studies have contributed to the advancement of this field.One study proposed a method for learning correlation information for multi-label feature selection[16].Their approach aimed to enhance the discrimination capability of selected features by integrating correlation learning and feature selection.Another study presented a multi-label feature selection technique that considers label correlations and utilizes a local discriminant model [17].Additionally,a study introduced a multi-label feature selection approach based on label correlations and feature redundancy [18].Their method aimed to select a subset of features that maximized discriminative power while considering relationships among labels and features.Moreover,another study explored manifold learning with a structured subspace for multilabel feature selection[19].They leveraged the inherent data structure to identify informative features for multi-label classification tasks.In addition to these studies,another investigation also focused on manifold learning with a structured subspace for multi-label feature selection[19].Lastly,an approach was proposed that integrates a differential evolution algorithm with dynamic multiple populations based on weighted strategies[20],demonstrating improvements in feature selection performance.

    These related works have contributed to the field of cancer classification and gene selection by employing various optimization algorithms and machine learning techniques.However,the reviewed algorithms have certain limitations regarding the number of selected genes,overfitting,and computational complexity.Firstly,they may not effectively reduce the number of selected genes,resulting in larger feature sets that can be challenging to interpret and may introduce noise into the classification process.This can hinder the identification of the most informative genes and potentially lead to reduced performance.Secondly,the algorithms may not explicitly address the issue of overfitting,which can occur when the model becomes overly complex relative to the available data,leading to poor generalization performance on unseen data.Overfitting can limit the practical utility of the models in real-world applications.Lastly,these methods may lack efficient strategies to handle computational complexity,particularly when dealing with large-scale datasets.The computational demands of these algorithms can become prohibitive,requiring substantial time and resources for analysis.These limitations highlight the need for a hybrid algorithm that combines the strengths of different optimization techniques to overcome these challenges and improve the accuracy,interpretability,and efficiency of gene selection in cancer classification.In the following sections,we will present our novel GWO-HHO hybrid algorithm,which aims to address these limitations and demonstrate its effectiveness in cancer analysis.

    3 Method

    The primary objective of our study is to develop a novel hybrid bio-inspired evolutionary algorithm,termed GWO-HHO,which aims to identify predictive and relevant genes for achieving high classification accuracy in cancer classification tasks.The proposed model consists of three phases:The GWO phase,the HHO phase,and the classification phase.

    In the GWO phase,we employ the Grey Wolf Optimizer algorithm to identify the most informative genes from a pool of candidate genes.This phase focuses on selecting the genes that exhibit significant discriminatory power for cancer classification.Subsequently,in the HHO phase,we utilize the Harris Hawks Optimization algorithm to further refine the selected genes and enhance their predictive power.This phase aims to optimize the selected genes by leveraging the search capabilities of the HHO algorithm.

    Finally,in the classification phase,we employ a classification algorithm to accurately classify cancer samples based on the selected genes.The classification algorithm will be chosen based on its suitability for the dataset and its ability to handle the selected features effectively.

    By integrating these three phases,our proposed hybrid algorithm aims to improve the accuracy of cancer classification by identifying and utilizing the most relevant genes.We believe that this approach has the potential to significantly contribute to the field of cancer research and facilitate the development of more effective diagnostic and treatment strategies.

    For a visual representation,we have included Fig.1,which illustrates the proposed model and the steps involved in the GWO-HHO algorithms.Additionally,Algorithm 1 presents the pseudo code for our proposed algorithm.

    3.1 Proposed GWO-HHO Algorithm

    In this section,we will delve into the various phases of our proposed GWO-HHO algorithm.

    3.1.1 First Phase:Pre-Processing Using Gray Wolf Optimization(GWO)

    The Gray Wolf Optimization (GWO) algorithm represents an advanced swarm intelligence optimization technique,particularly well-suited for wrapper feature selection.It draws inspiration from the coordinated hunting behavior of gray wolves in their natural habitat,where each member of the wolf pack plays a distinct role in identifying and capturing prey.In a similar fashion,the GWO algorithm adopts a strategy reminiscent of gray wolf hunting behavior to discern and select the most informative features for classification tasks.

    The GWO algorithm has exhibited promising outcomes in the realm of feature selection,proving its effectiveness across various applications such as image classification,prediction,and modeling.This algorithm was initially introduced by Mirjalili et al.[21]in 2014.The GWO approach leverages a nature-inspired optimization technique to craft optimal solutions for various problem domains.In the context of enhancing accuracy,GWO proves to be a highly effective feature selection method.Notably,it stands out by not requiring the utilization of a threshold parameter to weed out irrelevant features,a step often necessary in other methods.

    As the number of variables increases,the task of selecting the most relevant subset of features becomes increasingly complex.However,GWO’s wrapper feature selection method is notably less timeconsuming compared to alternative techniques in addressing this complexity.

    GWO possesses a unique advantage in that it circumvents the challenge of getting trapped in local minima,a problem frequently encountered by other bio-inspired optimization methods.For more indepth information regarding GWO and its efficacy in feature selection,interested readers can refer to a previously published paper[11].This paper not only presents a mathematical model for gray wolves but also provides experimental results utilizing GWO as a standalone feature selection algorithm.

    The GWO algorithm was selected as the first phase of the proposed model because of the high dimensionality of the dataset.Among other things,GWO’s demonstrated ability to deal with real-world problems,such as spring tension and compression,welded beams,and pressure vessels,contributed to the decision.This has resulted in GWO being widely recognized as an excellent tool for solving complex optimization problems.The dataset used in this study has a high dimensionality,so it is a great candidate to address it.

    The GWO was designed based on a mathematical model of gray wolves’social hierarchy in which selected the fittest solution as the Alpha(α).Due to this,the second and third best solutions are known as Beta(β)and Delta(δ),respectively.There are no more possible solutions,so Omega(ω)is assumed to be the only solution available.Alpha,beta,and delta are all used in the GWO algorithm in order to lead the search.In this case,theωwolves are pursuing these three wolves.

    There are usually three stages of predation by wolves:Hunting,encircling,and attacking.

    ? Encircling:In GWO,the hunting behavior of gray wolves is emulated,specifically the encircling behavior during a hunt.This behavior is mathematically represented by Eqs.(1)–(3).

    where t is the number of iterations,X(t)is one gray wolf,X(t+1)will be the next position it lands at,and Xp(t)corresponds to one of the following:α,β,δ.coefficient vectors A and C are represented as follows:

    where r1 and r2 are random vectors in the range[0,1]and is a decreasing number in the range[0,2],with a=2-2t/MaxIteration being the most prominent example.

    ? Hunting: In the context of gray wolf hunting behavior,it is noteworthy that these wolves can collectively locate and encircle their prey.Although beta or delta wolves may take part in the hunt at times,it is primarily the alpha wolf that leads the charge.However,when dealing with an abstract search space where the optimal solution(prey)is unknown,we make certain assumptions to mathematically mimic the hunting behavior of gray wolves.In this abstraction,we consider the alpha wolf to represent the best candidate solution,with beta and delta wolves also possessing superior knowledge regarding the probable location of potential prey.As a result,we keep track of the three best solutions that have been developed thus far.We then require other search agents to update their positions based on the information obtained from the positions of these best search agents.This concept is elucidated by Eqs.(5)–(7).

    ? Attacking:The gray wolves encircled the prey and were preparing to catch it(con-165 vergence and get results).Because of A ∈[-2a,2a],this operation was normally 166 performed by lowering a in Eq.(3).When |A| ≥1 occurs,the gray wolves stay 167 away from the prey to achieve global search;when |A|<1 occurs,the gray wolf pack 168 approaches the prey and finally finishes it.

    3.1.2 Second Phase:Gene Selection Using Harris Hawks Optimization(HHO)

    The GWO algorithm operates on a continuous search space,which means that it is not capable of solving the feature selection problem on its own.in addition,as revealed by Niu et al.[22] who analyzed the GWO,and demonstrated that it has a severe structural defect.The algorithm performs best when the solution to an optimization problem is zero.Nevertheless,if the optimal solution is not zero,the same performance cannot be achieved.As a result,the further the function’s optimal solution is from zero,the lower the performance of GWO.To address this limitation,an additional feature selection method must be applied after GWO.To this end,HHO was used in the second phase after GWO.HHO was applied to the dataset produced by GWO to resolve the issue of the continuous search space.By combining these two techniques,the proposed hybrid feature selection algorithm can effectively address the dimensionality problem of the dataset and identify the most informative features for accurate cancer classification.

    HHO is a swarm computation technique that was developed by Heidari et al.in 2019 [23].It draws inspiration from the cooperative hunting and chasing behavior observed in Harris’s hawks,particularly their“surprise pounces”or“the seven kills”.During a cooperative attack,multiple hawks work together and attack a rabbit that has revealed itself.The HHO algorithm employs a similar strategy,where multiple solutions explore the search space and converge on the most effective solution.This cooperative approach enables the algorithm to effectively navigate complex search spaces and identify optimal solutions to problems.In another published paper,AlMazrua et al.[12] discussed the inspiration behind HHO,the mathematical model employed by the algorithm,and presented the results of using HHO as a standalone feature selection method.The authors explained how HHO drew inspiration from the cooperative hunting behavior of Harris’s hawks and elaborated on the mathematical model used to implement the algorithm.Additionally,they presented the results of their experiments,which demonstrated the effectiveness of HHO as a feature selection method.Overall,their study provides valuable insights into the capabilities of HHO and its potential applications in various domains.

    Hawks are known to chase their prey by tracing,encircling,and eventually striking and killing.

    The mathematical model,inspired by the hunting behaviors of Harris’s hawks,encompasses three distinct stages: Exploration,the transition between exploration and exploitation,and exploitation.Throughout each stage of the hunt,the Harris’s hawks represent the candidate solutions,while the targeted prey represents the best candidate solution,nearly approaching the optimal.

    During their search for prey,Harris’s hawks employ two distinct exploration techniques.The candidate solutions aim to position themselves as close to the prey as possible,while the best candidate solution is the one intended to be the prey.

    In the first technique,Harris’s hawks select a location by taking into account the positions of other hawks and their prey.In the second method,the hawks perch atop random tall trees.Eq.(8)enables the simulation of these two methods with equal probabilities denoted as q.

    ? Vector x(t) is the current hawk position,whereas vector x(t+1) is the hawk’s position at the next iteration.

    ? The hawk xrandom(t)is selected at random from the population.

    ? The rabbit position is xrabbit(t).

    ? q,r1,r2,r3 and r4 are randomly generated numbers inside(0,1).

    ? LB and UB are the upper and lower bounds of variables.

    ? xmean(t)is the average position of the current population of hawks,which is calculated as shown in Eq.(9).

    ? t is the total number of iterations.

    ? xi(t)is the position for each hawk in iteration t.

    ? The total number of hawks is represented by N.

    The algorithm switches from exploration to exploitation(transition from exploration to exploitation)depending on the rabbit’s running or escaping energy,as shown in Eq.(10).

    ? E represents the prey’s escaping energy.

    ? The initial state of the energy is indicated by E0,which changes randomly inside(-1,1)at each iteration.

    When|E|≥1,hawks seek out more areas to investigate the rabbit’s whereabouts;alternatively,the exploitation stage begins.The algorithm formulates the rabbit’s escape successp≥0.5 or failurep<0.5 with an equal chance p.The Hawks also will also carry out a soft|E|≥0.5 or hard siege|E|<0.5,based on the rabbit’s energy.The soft siege is defined as in Eqs.(11)–(13).

    ? The difference between the hawk and rabbit positions is represented byΔx(t).

    ? J is a random number used to generate the rabbit’s random jump force.

    A hard siege,on the other hand,can be calculated as follows in Eq.(14):

    A soft siege with repeated fast dives is attempted when|E|≥0.5 andp<0.5,as the rabbit could successfully escape.The hawks have the option of selecting the best dive.Le′vy flight is employed to imitate the prey’s hopping.The hawks’next action is calculated as shown in Eq.(15) to determine whether the dive is successful or not.

    The hawks will dive following Eq.(16),the Le′vy flight L pattern,if the previous dive turns out to be ineffective.

    ? The problem dimension dim is the size of the RandomVector,and dim is the dimension of the problem.

    Eq.(17)has been used to update the final soft-siege rapid dives.

    Eqs.(8) and (9) are used to calculate k and z,respectively.A hard siege with progressive rapid dives occurs when|E|≥0.5 andp<0.5 are not sufficient for the rabbit to flee,as it no longer possesses enough energy.The rabbit’s z is calculated via Eq.(16),while k is updated using Eq.(18).

    3.1.3 Third Phase:Classification

    In this study,two different classifiers,Support Vector Machine(SVM)and K-Nearest Neighbors(KNN),were used.This decision was based on the demonstrated performance of GWO with KNN and HHO with SVM.In the classification phase,the fitness function score was calculated using both classifiers,with the primary objective being to improve classification accuracy while minimizing the number of selected genes.To evaluate the robustness of the proposed approach,a cross-validation method was employed.Specifically,Leave-One-Out Cross-Validation(LOOCV),which is widely used in machine learning,was used to assess the performance of the proposed algorithm.

    In the first phase of the proposed hybrid method,the initial microarray gene dataset is preprocessed and filtered using the GWO gene selection technique.Each gene is evaluated individually and sorted according to its importance.An analysis is then conducted to identify a subset of genes that yield the highest classification accuracy when analyzed using a KNN classifier.The KNN classifier is employed in place of the SVM classifier due to its superior classification accuracy.Through the GWO approach,a dataset is produced that contains fewer redundant and more relevant genes.By using GWO to filter out irrelevant and noisy genes,the computational load during the next phase of the algorithm,which utilizes the HHO technique and SVM classifier,is reduced.This approach allows for the identification of the most informative genes,resulting in improved classification accuracy and reduced computational cost.

    In the second phase of the proposed hybrid method,a gene selection process utilizing HHO is employed to identify the most predictive and informative genes from the GWO dataset,which yield the highest accuracy for the KNN classifier.In the HHO search space,each solution is represented by one or more gene indices drawn from the GWO dataset.The fitness value associated with each solution is determined by the SVM classifier,which measures the classification accuracy of the solution to a gene selection problem.By using HHO,the proposed method can explore the search space more efficiently and identify the optimal subset of genes,resulting in improved classification accuracy.The use of SVM as the fitness function enables the algorithm to identify the most informative genes that yield the best classification results.

    In the final phase of the proposed hybrid method,the informative and predictive genes identified by the GWO algorithm in the first phase are utilized to train a KNN classifier using LOOCV.Next,the HHO algorithm is employed to train an SVM classifier using LOOCV.This phase is designed to evaluate the efficiency of the pro-posed hybrid method.By utilizing both classifiers and LOOCV,the algorithm can identify the most informative genes and achieve the highest possible classification accuracy while minimizing the number of selected genes.The use of LOOCV allows for unbiased estimates of classification accuracy,which is important for assessing the effectiveness of the proposed approach.The aim of this phase is to identify the most significant genes for improving the performance of the SVM and KNN classifiers and determine which classifier performs best when utilized with GWO.GWO is employed as a pre-processing phase to reduce the dimensionality of the microarray data,eliminating duplicate and irrelevant genes.Statistically similar genes are then selected as inputs for the gene selection phase.

    The fitness function,as shown in Eq.(19),is calculated for GWO,allowing the algorithm to exclude as many features as possible while maintaining high levels of accuracy.This approach enables the identification of the most informative genes,which are subsequently utilized to train both classifiers and evaluate their performance.By comparing the performance of the SVM and KNN classifiers,the proposed method aims to determine the most effective approach for cancer classification using the GWO algorithm.

    3.2 Dataset Description

    In this study,two kind of publicly available microarray cancer datasets were utilized,consisting of binary and multiclass datasets.To evaluate the performance and effectiveness of the proposed algorithms,six benchmark microarray datasets were employed.By utilizing these datasets,the study aims to provide a comprehensive evaluation of the proposed approach and demonstrate its potential applicability in real-world cancer classification tasks.The use of benchmark datasets also allows for the comparison of the proposed approach against existing methods,providing valuable insights into its relative effectiveness.The study employed three binary datasets for colon tumors [24],lung cancer[25],and leukemia3[26].Additionally,three multiclass datasets were used,including leukemia2[24],lymphoma[27]and SRBCT[27].A detailed breakdown of the experimental datasets,including information on the number of samples and classes,can be found in Table 1.By utilizing a diverse range of datasets,the study aims to demonstrate the applicability and effectiveness of the proposed approach across various cancer types and classification scenarios.

    Table 1: Description of microarray data sets

    3.3 Parameter Settings

    The best solution was determined by using KNNs and SVMs.We determined the value of k using a trial-and-error approach.Across all datasets in the experiments,k=7 produced the best results.

    The number of iterations(Max_iter)and the size(dim)of a method play an important role in its practicality.Additional parameters to k,dim,up,and lp can be found in Table 2.

    Table 2: Parameter settings for GWO-HHO Algorithm

    3.4 Model Evaluation

    The proposed method will be evaluated based on two factors: Classification accuracy and the number of selected genes.The objective is to minimize the number of selected genes while maximizing the accuracy of classification.To obtain a reliable estimation of the accuracy of a classification algorithm on a small number of samples,LOOCV can be used.In contrast to LOOCV,k-fold cross validation incorporates randomness so that the mean accuracy associated with k-fold cross validation on a data set is not constant.Due to the low number of samples in our datasets,LOOCV is used in the evaluation process.As validation data,LOOCV uses one sample of the original data,whereas residual samples are used for training.The process is repeated in order to ensure that each sample in the data is only used once for the purposes of validation.Therefore,LOOCV is a special case of k-fold cross validation,where k equals the number of samples in the data,and every sample is evaluated exactly once for validity [28].In addition,we applied k-fold cross validation at 5-fold,to compare the results between LOOCV and k-fold in order to determine if there are any overfitting issues.Moreover,LOOCV maximizes data utilization,provides an unbiased estimate of performance,minimizes variance,and ensures robust evaluation.LOOCV evaluates the proposed method on all instances,identifies overfitting,and reduces reliance on specific train-test splits,resulting in a comprehensive and reliable assessment of the method’s effectiveness on the given dataset.

    Furthermore,LOOCV(Leave-One-Out Cross-Validation)was chosen in our study to address the challenges associated with high-dimensional gene expression data,limited sample sizes,and noise.LOOCV is suitable for limited sample sizes as it maximizes the use of available data by leaving out one sample at a time for validation [28].Moreover,it is worth noting that LOOCV has been extensively utilized and demonstrated its effectiveness in handling high-dimensional datasets,as supported by multiple previous studies[11–15,28].It helps mitigate the risk of overfitting in high-dimensional gene expression data by providing a more rigorous assessment of the classification algorithm’s performance.By employing LOOCV,we aimed to ensure a robust and reliable evaluation of our proposed hybrid algorithm’s performance in cancer classification tasks.

    The classification accuracy will be determined using Eq.(20).

    4 Experimental Results and Discussions

    In this section,we will delve into the experimental results of our proposed hybrid method,the GWO-HHO algorithm.Subsequently,we will conduct a comparative analysis with state-of-the-art research to demonstrate the efficiency of our algorithm.

    4.1 The Experiments Results of(GWO-HHO)Method

    The primary objective of this study was to assess and compare the performance of the proposed hybrid feature selection method across a selection of six cancer microarray expression datasets.The aim was to determine its effectiveness in terms of classification accuracy.Additionally,we evaluated the proposed feature selection method using both Leave-One-Out Cross-Validation(LOOCV)and 5-fold Cross-Validation and compared its performance with that of other evolutionary algorithms.Tables 3 and 4 provide insights into how the proposed hybrid feature selection method performs with regard to accuracy and the number of selected features.Notably,LOOCV was employed in Table 3 for assessing classification accuracy,while Table 4 utilized the 5-fold Cross-Validation approach.The experimental results clearly indicate that overfitting does not adversely impact the accuracy of microarray data.

    Table 3: GWO-HHO LOOCV long results

    Table 4: GWO-HHO 5-fold long results

    In the first phase of the proposed method,we applied GWO independently to each dataset and classifier to identify the optimal number of informative genes while achieving high accuracy.Next,HHO was utilized on the GWO-selected dataset to further decrease the number of selected genes and improve accuracy.Based on the experimental results,it was observed that GWO performed best with the KNN classifier while HHO performed best with the SVM classifier.As a result,each phase was associated with a specific classifier.

    As shown in Tables 3 and 4,the results highlight the remarkable performance of the proposed hybrid method.It achieved an impressive 100%accuracy for most datasets,demonstrating its robustness in accurately classifying cancer samples.Notably,the algorithm achieved perfect classification accuracy for leukemia2,leukemia3,lung,and lymphoma datasets.For these datasets,the number of selected genes was found to be less than 5,indicating the algorithm’s ability to identify a small set of highly informative genes for accurate classification.

    For the leukemia3,colon,and SRBCT datasets,the proposed method achieved 100% accuracy while selecting less than 13 genes.This demonstrates the algorithm’s effectiveness in accurately classifying cancer samples with a relatively small number of selected genes.The ability to minimize the number of genes is crucial in reducing the complexity and computational burden associated with cancer diagnosis and treatment.

    Although the colon dataset did not achieve 100% accuracy,the proposed hybrid method still achieved notable results.The algorithm accurately classified the colon dataset with an accuracy above 78%while selecting a small number of genes.This suggests that the selected genes are highly relevant to the classification task,contributing to the algorithm’s performance.

    Overall,the results from Tables 3 and 4 provide strong evidence for the effectiveness of the proposed hybrid method.The algorithm demonstrated high accuracy in most datasets,while simultaneously minimizing the number of selected genes.These findings have significant implications for cancer diagnosis and treatment,as they highlight the potential of the proposed method to accurately classify cancer samples using a small subset of informative genes.

    4.2 Comparison of Results

    In order to assess its effectiveness,we compared the proposed GWO-HHO algorithm with previous metaheuristic bio-inspired methods,focusing on classification accuracy and the number of selected genes as shown in Table 5.

    Table 5: Performance comparison between GWO-HHO algorithm and recent related works in literature based on classification accuracy and number of selected genes

    The results of this comparison revealed that GWO-HHO outperformed other bio-inspired gene selection methods in terms of accuracy.Remarkably,it achieved a remarkable 100% classification accuracy while selecting fewer genes.While it did not yield the smallest number of genes for the lung dataset,it still achieved a perfect accuracy rate of 100%.Additionally,GWO-HHO consistently outperformed its competitors across all datasets except for lung.This demonstrated the algorithm’s ability to accurately classify cancer datasets while keeping the gene selection to a minimum.

    As shown in Table 5,the proposed approach can be applied to real-world cancer classification tasks compared with other state-of-the-art methods.A promising tool for cancer diagnosis and treatment,the GWO-HHO algorithm selects informative genes efficiently and accurately while minimizing computational costs.

    We have integrated several studies to address relevant aspects of our research and identify research gaps in the related works.Al-Khafaji et al.[29]focused on the classification of breast cancer images using new transfer learning techniques,highlighting a research gap in innovative transfer learning techniques specific to breast cancer image classification.Li et al.[30]proposed a dual transfer learning approach for medical image analysis,emphasizing the need for improved methodologies and addressing challenges in transfer learning,which highlights the research gap in the application of this approach for breast cancer detection.Liang et al.[31] introduced an enhanced approach for breast cancer detection by incorporating improved multi-fractal dimension techniques and feature fusion methods,emphasizing the importance of advanced image analysis techniques,and highlighting the research gap in integrating these techniques for breast cancer detection.Additionally,Rahmah et al.[32]conducted a systematic review of computing approaches for breast cancer detection through computer-aided diagnosis,emphasizing the need for a comprehensive understanding of existing approaches and their limitations,which highlights the research gap in developing more effective and accurate computeraided diagnosis systems for breast cancer detection.By incorporating these studies,we provide a clearer understanding of the research landscape and highlight the research gaps that our proposed research aims to address.

    One of the limitations we identified is the reliance on microarray data.While microarray technology has been widely used in cancer research,it is important to acknowledge that the field has seen advancements in other high-throughput technologies such as RNA sequencing.Future studies could explore the effectiveness of the proposed hybrid method on RNA sequencing data to validate its performance across different data modalities.

    5 Conclusion

    This study tackled the challenge of dimensionality within microarray gene expression profiles by introducing a hybrid feature selection approach.This approach integrates the Gray Wolf Optimization(GWO)and Harris Hawks Optimization(HHO)algorithms with the support vector machines(SVM)and K-nearest neighbors(KNN)algorithms.The objective of our method was to enhance the precision of cancer gene selection and classification while simultaneously minimizing the number of genes selected.

    The effectiveness of our hybrid technique was confirmed through the evaluation of multiple cancer microarray datasets.In comparison to other wrapper-based feature selection methods and the standalone GWO and HHO algorithms,our hybrid approach consistently exhibited superior performance in both accuracy and the reduction of selected genes.This underscores the substantial improvements our approach brings not only in terms of performance but also in functionality compared to existing methods.Furthermore,our hybrid approach outperformed recently published hybrid feature selection algorithms,further demonstrating its superiority.

    The theoretical implications of our research lie in the development of a bio-inspired algorithm,the GWO-HHO hybrid,for solving gene selection problems.By combining the strengths of GWO and HHO algorithms,we achieved improved accuracy and efficiency in cancer classification tasks.This contributes to the field of bioinformatics and supports the advancement of gene selection methodologies.

    Practically,our findings have several advantages that can benefit real-world cancer classification problems.The ability of our hybrid method to accurately classify cancer datasets while reducing the number of selected genes holds great potential for clinical applications.The identification of a smaller set of highly informative genes can aid in the development of more targeted and effective diagnostic and therapeutic strategies.

    While our study presents promising results,it is important to acknowledge its limitations.Firstly,our research relied on microarray data,and future investigations should explore the performance of the proposed hybrid method on other data modalities,such as RNA sequencing data,to validate its effectiveness across different technologies.Additionally,our evaluation was based on cross-validation techniques,and further studies should incorporate independent validation on external datasets to assess the generalizability of our method.

    Future research should focus on investigating the integration of the proposed hybrid method with complementary techniques like feature extraction or dimensionality reduction methods,enabling the development of a comprehensive framework for cancer analysis.Additionally,exploring the application of the GWO-HHO hybrid algorithm in other areas of bioinformatics,such as protein structure prediction or biomarker identification,would expand its potential beyond cancer classification.Furthermore,there is a need to consider the development of an interpretable framework that provides insights into the biological relevance of the selected genes,offering a deeper understanding of the underlying mechanisms driving cancer development and progression.Such efforts will contribute to advancements in cancer research and pave the way for improved diagnostic and therapeutic strategies.

    Acknowledgement:The authors extend their appreciation to the Deputyship for Research and Innovation,“Ministry of Education”in Saudi Arabia for supporting this research(IFKSUOR3-014-3).

    Funding Statement:The authors extend their appreciation to the Deputyship for Research and Innovation,“Ministry of Education”in Saudi Arabia for funding this research(IFKSUOR3-014-3).

    Author Contributions:Hala AlShamlan,and Halah AlMazrua equally contributed to the manuscript and revised the codes.All authors approved the manuscript.

    Availability of Data and Materials:The microarray dataset used in this study is available at the following website:Https://csse.szu.edu.cn/staff/zhuzx/datasets.html.

    Conflicts of Interest:All authors declare that they have no competing interests.

    国产真人三级小视频在线观看| 欧美+亚洲+日韩+国产| 国内精品美女久久久久久| 久久久久久九九精品二区国产| 热99在线观看视频| 99久久无色码亚洲精品果冻| 色av中文字幕| 手机成人av网站| 亚洲自拍偷在线| 亚洲av日韩精品久久久久久密| 亚洲五月婷婷丁香| 国产精品一区二区免费欧美| 国产老妇女一区| 国产不卡一卡二| 我要搜黄色片| 中出人妻视频一区二区| 国产精品国产高清国产av| 亚洲乱码一区二区免费版| 有码 亚洲区| 日韩亚洲欧美综合| 美女被艹到高潮喷水动态| 国产午夜福利久久久久久| 色噜噜av男人的天堂激情| 国内毛片毛片毛片毛片毛片| 亚洲第一欧美日韩一区二区三区| 国产精品国产高清国产av| 啦啦啦免费观看视频1| 欧美性感艳星| 蜜桃亚洲精品一区二区三区| 欧美乱色亚洲激情| 国产不卡一卡二| 日日干狠狠操夜夜爽| 性欧美人与动物交配| 91在线观看av| 好男人电影高清在线观看| 天堂√8在线中文| 毛片女人毛片| 免费一级毛片在线播放高清视频| av中文乱码字幕在线| 露出奶头的视频| 欧美精品啪啪一区二区三区| 婷婷精品国产亚洲av在线| 久久精品综合一区二区三区| 美女cb高潮喷水在线观看| 国产日本99.免费观看| 在线观看免费午夜福利视频| 深夜精品福利| 久久精品综合一区二区三区| 一个人免费在线观看的高清视频| 岛国在线免费视频观看| 欧美黑人巨大hd| 毛片女人毛片| 欧美成人免费av一区二区三区| 亚洲男人的天堂狠狠| e午夜精品久久久久久久| 亚洲欧美激情综合另类| xxxwww97欧美| av黄色大香蕉| 小蜜桃在线观看免费完整版高清| 老司机在亚洲福利影院| 国产精品综合久久久久久久免费| 美女大奶头视频| 长腿黑丝高跟| 亚洲精华国产精华精| 99热6这里只有精品| 国产综合懂色| 中文亚洲av片在线观看爽| 18禁国产床啪视频网站| 午夜精品久久久久久毛片777| 可以在线观看毛片的网站| 91久久精品电影网| 日韩欧美免费精品| 成人18禁在线播放| 在线天堂最新版资源| 美女黄网站色视频| 午夜激情欧美在线| 亚洲欧美激情综合另类| 啦啦啦韩国在线观看视频| 国产一级毛片七仙女欲春2| 88av欧美| 免费在线观看亚洲国产| 岛国在线观看网站| 岛国视频午夜一区免费看| 精品欧美国产一区二区三| 中文字幕久久专区| 亚洲av成人不卡在线观看播放网| 18禁在线播放成人免费| 欧美国产日韩亚洲一区| 国产免费一级a男人的天堂| 亚洲真实伦在线观看| 久久中文看片网| 超碰av人人做人人爽久久 | 一边摸一边抽搐一进一小说| 91麻豆av在线| 夜夜躁狠狠躁天天躁| 婷婷亚洲欧美| av福利片在线观看| 波多野结衣高清无吗| 午夜a级毛片| 亚洲狠狠婷婷综合久久图片| 欧美成狂野欧美在线观看| 精品一区二区三区视频在线 | 日韩欧美精品v在线| 亚洲国产欧洲综合997久久,| 国产精品久久视频播放| 成年女人毛片免费观看观看9| 一卡2卡三卡四卡精品乱码亚洲| 国产欧美日韩精品一区二区| 在线观看66精品国产| 男女午夜视频在线观看| 亚洲av免费在线观看| 欧美黑人巨大hd| 夜夜夜夜夜久久久久| 色综合婷婷激情| 国产野战对白在线观看| 嫩草影院入口| 国产欧美日韩精品一区二区| 又紧又爽又黄一区二区| 午夜福利18| 97超视频在线观看视频| 日本a在线网址| 国产成人aa在线观看| 亚洲午夜理论影院| 黄色女人牲交| 非洲黑人性xxxx精品又粗又长| 成人永久免费在线观看视频| 国产91精品成人一区二区三区| 一本久久中文字幕| 欧美日韩国产亚洲二区| 色噜噜av男人的天堂激情| 最后的刺客免费高清国语| 亚洲av成人精品一区久久| 午夜福利高清视频| 亚洲黑人精品在线| 国产高清三级在线| 国产真实伦视频高清在线观看 | 天天添夜夜摸| 制服人妻中文乱码| 国产午夜精品久久久久久一区二区三区 | 香蕉丝袜av| 免费在线观看成人毛片| 蜜桃久久精品国产亚洲av| 久久精品国产综合久久久| 亚洲国产精品sss在线观看| 亚洲精品影视一区二区三区av| 国产精品一区二区免费欧美| 国产真实伦视频高清在线观看 | 搡老妇女老女人老熟妇| 人妻丰满熟妇av一区二区三区| 日韩精品青青久久久久久| 日本免费a在线| 成人18禁在线播放| 精品电影一区二区在线| 国产成年人精品一区二区| 亚洲黑人精品在线| 久99久视频精品免费| 成人18禁在线播放| 午夜福利视频1000在线观看| 成人亚洲精品av一区二区| 国产午夜精品论理片| 欧美+亚洲+日韩+国产| 亚洲18禁久久av| 一边摸一边抽搐一进一小说| 亚洲久久久久久中文字幕| 久久精品亚洲精品国产色婷小说| av中文乱码字幕在线| 黄色视频,在线免费观看| 免费在线观看成人毛片| 免费人成在线观看视频色| 熟女电影av网| 男人舔女人下体高潮全视频| 欧美性猛交╳xxx乱大交人| e午夜精品久久久久久久| 成人国产综合亚洲| 少妇的逼好多水| 首页视频小说图片口味搜索| 色哟哟哟哟哟哟| 免费大片18禁| 亚洲人成网站在线播| 亚洲中文字幕日韩| 亚洲欧美一区二区三区黑人| 女人被狂操c到高潮| 久久精品亚洲精品国产色婷小说| 人妻夜夜爽99麻豆av| 国产精品一及| 色精品久久人妻99蜜桃| 国产精品久久电影中文字幕| 国内精品一区二区在线观看| 村上凉子中文字幕在线| 国产一区二区三区在线臀色熟女| 99精品久久久久人妻精品| 免费在线观看日本一区| 两个人的视频大全免费| 99精品欧美一区二区三区四区| 嫁个100分男人电影在线观看| 观看免费一级毛片| 夜夜看夜夜爽夜夜摸| 欧美黄色片欧美黄色片| 黄色片一级片一级黄色片| 激情在线观看视频在线高清| 成人特级av手机在线观看| 特大巨黑吊av在线直播| 国内精品美女久久久久久| 一个人免费在线观看电影| 午夜久久久久精精品| 久久精品人妻少妇| 99久久无色码亚洲精品果冻| 脱女人内裤的视频| 老熟妇乱子伦视频在线观看| 尤物成人国产欧美一区二区三区| 国产 一区 欧美 日韩| av在线蜜桃| 久久久精品欧美日韩精品| 日韩有码中文字幕| 给我免费播放毛片高清在线观看| 99精品欧美一区二区三区四区| 国产精品国产高清国产av| 午夜激情欧美在线| 精品久久久久久,| 国产色婷婷99| 亚洲av一区综合| 久9热在线精品视频| 成人一区二区视频在线观看| 不卡一级毛片| 免费av毛片视频| 亚洲欧美一区二区三区黑人| 国内久久婷婷六月综合欲色啪| 黄色成人免费大全| 日本 av在线| 性色av乱码一区二区三区2| 三级毛片av免费| 欧美区成人在线视频| 99国产综合亚洲精品| 九色国产91popny在线| 精品久久久久久,| 久久午夜亚洲精品久久| h日本视频在线播放| 久久久久久大精品| 国内精品久久久久精免费| 一级a爱片免费观看的视频| 麻豆国产av国片精品| 岛国在线观看网站| 在线观看美女被高潮喷水网站 | 亚洲熟妇中文字幕五十中出| 夜夜夜夜夜久久久久| 999久久久精品免费观看国产| 日本免费a在线| 国产成人啪精品午夜网站| 国产精品乱码一区二三区的特点| 97碰自拍视频| 久久久久久久精品吃奶| 欧美日本视频| 床上黄色一级片| 国产精品永久免费网站| 国产午夜精品久久久久久一区二区三区 | 在线播放国产精品三级| 色噜噜av男人的天堂激情| 午夜激情欧美在线| 12—13女人毛片做爰片一| 欧美xxxx黑人xx丫x性爽| 中文字幕av在线有码专区| 国产91精品成人一区二区三区| www国产在线视频色| 日本免费一区二区三区高清不卡| tocl精华| av天堂中文字幕网| av视频在线观看入口| 看黄色毛片网站| 国产三级在线视频| 欧美日韩乱码在线| 蜜桃亚洲精品一区二区三区| 日本五十路高清| 一本一本综合久久| 国产激情欧美一区二区| 老汉色∧v一级毛片| 少妇的逼好多水| 色综合欧美亚洲国产小说| 亚洲av成人不卡在线观看播放网| 在线观看免费午夜福利视频| 悠悠久久av| 日韩欧美精品免费久久 | 美女免费视频网站| 国产69精品久久久久777片| 午夜福利在线观看免费完整高清在 | 桃红色精品国产亚洲av| h日本视频在线播放| 日韩欧美免费精品| 人人妻人人看人人澡| 亚洲精品色激情综合| 天堂av国产一区二区熟女人妻| 欧美bdsm另类| 老司机福利观看| 亚洲真实伦在线观看| 别揉我奶头~嗯~啊~动态视频| 欧美最新免费一区二区三区 | 俺也久久电影网| 亚洲午夜理论影院| 国产一区二区三区在线臀色熟女| 少妇的逼水好多| 十八禁网站免费在线| 在线播放国产精品三级| 国产免费av片在线观看野外av| 亚洲精品456在线播放app | 免费在线观看影片大全网站| 亚洲精品影视一区二区三区av| 一个人看视频在线观看www免费 | 亚洲中文字幕日韩| 久久久久九九精品影院| 国产精品亚洲一级av第二区| 日韩av在线大香蕉| 婷婷亚洲欧美| 啪啪无遮挡十八禁网站| www日本在线高清视频| 亚洲性夜色夜夜综合| 亚洲av中文字字幕乱码综合| 国产三级黄色录像| 可以在线观看毛片的网站| 欧美黄色片欧美黄色片| 99热这里只有是精品50| 五月伊人婷婷丁香| 午夜精品在线福利| 丁香六月欧美| eeuss影院久久| 最新在线观看一区二区三区| av中文乱码字幕在线| 精品熟女少妇八av免费久了| 老熟妇仑乱视频hdxx| 亚洲成av人片免费观看| 午夜福利在线观看免费完整高清在 | 精品熟女少妇八av免费久了| 久久久久久人人人人人| 一级作爱视频免费观看| 国产高清视频在线播放一区| av女优亚洲男人天堂| 一区二区三区激情视频| 桃红色精品国产亚洲av| 欧美日韩黄片免| 午夜福利视频1000在线观看| 国产一级毛片七仙女欲春2| 高清毛片免费观看视频网站| 午夜两性在线视频| 欧美成狂野欧美在线观看| 中文亚洲av片在线观看爽| 免费看十八禁软件| 麻豆成人av在线观看| 欧美黑人巨大hd| 亚洲av五月六月丁香网| 一区二区三区免费毛片| 日韩中文字幕欧美一区二区| 毛片女人毛片| 99久久久亚洲精品蜜臀av| 国产亚洲精品久久久com| 午夜两性在线视频| 午夜精品在线福利| 久久久久久人人人人人| 99热6这里只有精品| 嫩草影视91久久| 无人区码免费观看不卡| 男女午夜视频在线观看| 蜜桃亚洲精品一区二区三区| 午夜a级毛片| 99热这里只有精品一区| 国产蜜桃级精品一区二区三区| 国产成人啪精品午夜网站| 国产高清激情床上av| 午夜福利成人在线免费观看| 在线观看一区二区三区| 日本在线视频免费播放| 黄片小视频在线播放| 国产高清三级在线| 19禁男女啪啪无遮挡网站| 窝窝影院91人妻| 亚洲熟妇熟女久久| 99热精品在线国产| 露出奶头的视频| netflix在线观看网站| 久久精品综合一区二区三区| 亚洲无线观看免费| 天美传媒精品一区二区| 国产毛片a区久久久久| 69av精品久久久久久| 又黄又爽又免费观看的视频| 18美女黄网站色大片免费观看| 小说图片视频综合网站| 欧美乱妇无乱码| 国产午夜福利久久久久久| 真人一进一出gif抽搐免费| 国产免费一级a男人的天堂| 一级作爱视频免费观看| 人人妻,人人澡人人爽秒播| 午夜激情福利司机影院| 亚洲自拍偷在线| 婷婷丁香在线五月| 亚洲美女视频黄频| 亚洲天堂国产精品一区在线| 天堂√8在线中文| 免费一级毛片在线播放高清视频| 久久久久久大精品| 日韩国内少妇激情av| 久久6这里有精品| 欧美不卡视频在线免费观看| 中国美女看黄片| 在线观看免费视频日本深夜| 国产欧美日韩一区二区精品| 国产三级中文精品| 在线看三级毛片| 在线视频色国产色| 欧美国产日韩亚洲一区| 天堂动漫精品| 精品久久久久久久人妻蜜臀av| 亚洲无线在线观看| 日本熟妇午夜| 午夜老司机福利剧场| 亚洲 欧美 日韩 在线 免费| 一本一本综合久久| 欧美又色又爽又黄视频| 99久国产av精品| 国产精品av视频在线免费观看| 法律面前人人平等表现在哪些方面| 黄色女人牲交| 国产探花在线观看一区二区| 听说在线观看完整版免费高清| 国产探花极品一区二区| 免费看十八禁软件| 国产极品精品免费视频能看的| 久9热在线精品视频| 国产三级中文精品| 99久久综合精品五月天人人| 高清日韩中文字幕在线| 窝窝影院91人妻| 国产精品自产拍在线观看55亚洲| 无限看片的www在线观看| 九九热线精品视视频播放| 丰满人妻熟妇乱又伦精品不卡| 亚洲av成人不卡在线观看播放网| 免费看日本二区| 亚洲片人在线观看| 高潮久久久久久久久久久不卡| 麻豆国产97在线/欧美| 天堂av国产一区二区熟女人妻| 99精品欧美一区二区三区四区| 国产av一区在线观看免费| 成人三级黄色视频| 色尼玛亚洲综合影院| 88av欧美| 国产亚洲精品av在线| 岛国在线免费视频观看| 九九在线视频观看精品| 狂野欧美白嫩少妇大欣赏| 日韩成人在线观看一区二区三区| 国产av一区在线观看免费| www.999成人在线观看| 欧美高清成人免费视频www| 国产伦人伦偷精品视频| 亚洲人成网站在线播放欧美日韩| av欧美777| 久久久久精品国产欧美久久久| 欧美黑人欧美精品刺激| 少妇的逼水好多| 天美传媒精品一区二区| 亚洲人成网站在线播放欧美日韩| 狂野欧美白嫩少妇大欣赏| 少妇人妻一区二区三区视频| av黄色大香蕉| 成人特级av手机在线观看| 两性午夜刺激爽爽歪歪视频在线观看| 久久久久国内视频| 亚洲专区中文字幕在线| 精品日产1卡2卡| 在线免费观看的www视频| 国产av麻豆久久久久久久| 欧美性猛交╳xxx乱大交人| 手机成人av网站| 国产亚洲精品久久久com| 日韩精品青青久久久久久| 热99re8久久精品国产| 精品不卡国产一区二区三区| av天堂在线播放| 一本综合久久免费| 一个人免费在线观看的高清视频| 国产激情欧美一区二区| 亚洲av美国av| 色尼玛亚洲综合影院| 一a级毛片在线观看| 国产高清videossex| 女生性感内裤真人,穿戴方法视频| 欧美绝顶高潮抽搐喷水| 美女cb高潮喷水在线观看| 日韩欧美国产一区二区入口| 日韩欧美在线二视频| 国产高清视频在线观看网站| 中文资源天堂在线| 成人无遮挡网站| 久久精品人妻少妇| 最新在线观看一区二区三区| 91麻豆精品激情在线观看国产| 国产探花在线观看一区二区| 亚洲av第一区精品v没综合| 亚洲中文字幕日韩| xxxwww97欧美| 丰满的人妻完整版| 色综合婷婷激情| 天天躁日日操中文字幕| 精品人妻偷拍中文字幕| 熟女少妇亚洲综合色aaa.| 十八禁网站免费在线| 国产精品99久久久久久久久| 午夜福利视频1000在线观看| 国产三级在线视频| 最近最新中文字幕大全电影3| 亚洲av电影在线进入| 99久久九九国产精品国产免费| 精品欧美国产一区二区三| 精品久久久久久,| 九色国产91popny在线| 国产精品自产拍在线观看55亚洲| 麻豆成人av在线观看| 中文字幕精品亚洲无线码一区| 精品国产三级普通话版| 免费一级毛片在线播放高清视频| 色播亚洲综合网| 国产爱豆传媒在线观看| 蜜桃久久精品国产亚洲av| 有码 亚洲区| 国产毛片a区久久久久| 亚洲国产色片| 在线观看一区二区三区| 国产激情偷乱视频一区二区| 男女视频在线观看网站免费| 成人国产一区最新在线观看| 亚洲国产精品久久男人天堂| 欧美一区二区国产精品久久精品| 亚洲精品一卡2卡三卡4卡5卡| 欧美日韩一级在线毛片| 国产精品香港三级国产av潘金莲| 美女被艹到高潮喷水动态| 色播亚洲综合网| 大型黄色视频在线免费观看| 国产精品永久免费网站| 天天添夜夜摸| 日本黄色视频三级网站网址| 狂野欧美激情性xxxx| 五月玫瑰六月丁香| 一个人看视频在线观看www免费 | 一区二区三区激情视频| 狂野欧美激情性xxxx| 波多野结衣高清作品| 国产精品99久久久久久久久| 国产精品嫩草影院av在线观看 | 国产精品99久久99久久久不卡| 日韩亚洲欧美综合| 日韩人妻高清精品专区| 日本黄色片子视频| 日韩 欧美 亚洲 中文字幕| 精品久久久久久成人av| 男女做爰动态图高潮gif福利片| 精品久久久久久久人妻蜜臀av| 最近最新免费中文字幕在线| 在线观看av片永久免费下载| e午夜精品久久久久久久| 美女大奶头视频| 亚洲久久久久久中文字幕| 色综合亚洲欧美另类图片| 精品一区二区三区av网在线观看| 亚洲熟妇熟女久久| 在线十欧美十亚洲十日本专区| 99精品久久久久人妻精品| 亚洲美女视频黄频| 91九色精品人成在线观看| 亚洲最大成人手机在线| 欧美在线黄色| 少妇的逼水好多| 十八禁人妻一区二区| 亚洲精品日韩av片在线观看 | 高清日韩中文字幕在线| 特级一级黄色大片| 一级作爱视频免费观看| 99久久精品热视频| 国产亚洲精品av在线| 给我免费播放毛片高清在线观看| 中文字幕人成人乱码亚洲影| 高潮久久久久久久久久久不卡| 亚洲黑人精品在线| 女人高潮潮喷娇喘18禁视频| 午夜精品一区二区三区免费看| 欧美在线一区亚洲| 成人国产一区最新在线观看| 真实男女啪啪啪动态图| 成人午夜高清在线视频| 久久精品人妻少妇| 国产高清三级在线| 色播亚洲综合网| 人人妻,人人澡人人爽秒播| 久久久久久久亚洲中文字幕 | 精品久久久久久久久久久久久| 99国产综合亚洲精品| 两个人的视频大全免费| 黄色丝袜av网址大全| 一个人免费在线观看电影| 日韩免费av在线播放| 最新美女视频免费是黄的| 久久6这里有精品| 欧美av亚洲av综合av国产av| 精品久久久久久成人av| 欧美性猛交╳xxx乱大交人| 网址你懂的国产日韩在线| 欧美成狂野欧美在线观看| 亚洲真实伦在线观看| 亚洲不卡免费看| 变态另类丝袜制服| 国产伦在线观看视频一区| 欧美成人a在线观看| 一区二区三区激情视频| 午夜激情欧美在线| 欧美bdsm另类|