scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Multiobjective Simulated Annealing-Based Clustering of Tissue Samples for Cancer Diagnosis

TL;DR: A MOO-based clustering technique utilizing archived multiobjective simulated annealing (AMOSA) as the underlying optimization strategy for classification of tissue samples from cancer datasets and significant gene markers have been identified and demonstrated visually from the clustering solutions obtained.
Abstract: In the field of pattern recognition, the study of the gene expression profiles of different tissue samples over different experimental conditions has become feasible with the arrival of microarray-based technology. In cancer research, classification of tissue samples is necessary for cancer diagnosis, which can be done with the help of microarray technology. In this paper, we have presented a multiobjective optimization (MOO)-based clustering technique utilizing archived multiobjective simulated annealing(AMOSA) as the underlying optimization strategy for classification of tissue samples from cancer datasets. The presented clustering technique is evaluated for three open source benchmark cancer datasets [Brain tumor dataset, Adult Malignancy, and Small Round Blood Cell Tumors (SRBCT)]. In order to evaluate the quality or goodness of produced clusters, two cluster quality measures viz, adjusted rand index and classification accuracy ( $\% CoA$ ) are calculated. Comparative results of the presented clustering algorithm with ten state-of-the-art existing clustering techniques are shown for three benchmark datasets. Also, we have conducted a statistical significance test called t -test to prove the superiority of our presented MOO-based clustering technique over other clustering techniques. Moreover, significant gene markers have been identified and demonstrated visually from the clustering solutions obtained. In the field of cancer subtype prediction, this study can have important impact.
Citations
More filters
Journal ArticleDOI
TL;DR: An improved, density based version of K-Means, which involves a novel and systematic method for selecting initial centroids and gives stable results, which provides comparatively better predictions of cancer subtypes from gene expression data.

68 citations


Cites background from "Multiobjective Simulated Annealing-..."

  • ...In addition, the model complexity of classifiers is high [11, 12], and usually, there are model parameters for which only experts in Machine Learning can set appropriate values....

    [...]

Journal ArticleDOI
TL;DR: The results show that the proposed framework for gene selection using multi-objective spotted hyena optimizer (MOSHO) and salp swarm algorithm (SSA) significantly outperforms existing state-of-the-art techniques.

52 citations

Journal ArticleDOI
TL;DR: It seems that by modifying MOABC and increasing its effectiveness, it could be a proper algorithm for evacuation planning, and in terms of effectiveness, AMOSA and MOABC achieve good quality solutions that satisfy the objective functions.
Abstract: Evacuation planning is an important activity in disaster management to reduce the effects of disasters on urban communities. It is regarded as a multi-objective optimization problem that involves conflicting spatial objectives and constraints in a decision-making process. Such problems are difficult to solve by traditional methods. However, metaheuristics methods have been shown to be proper solutions. Well-known classical metaheuristic algorithms—such as simulated annealing (SA), artificial bee colony (ABC), standard particle swarm optimization (SPSO), genetic algorithm (GA), and multi-objective versions of them—have been used in the spatial optimization domain. However, few types of research have applied these classical methods, and their performance has not always been well evaluated, specifically not on evacuation planning problems. This research applies the multi-objective versions of four classical metaheuristic algorithms (AMOSA, MOABC, NSGA-II, and MSPSO) on an urban evacuation problem in Rwanda in order to compare the performances of the four algorithms. The performances of the algorithms have been evaluated based on the effectiveness, efficiency, repeatability, and computational time of each algorithm. The results showed that in terms of effectiveness, AMOSA and MOABC achieve good quality solutions that satisfy the objective functions. NSGA-II and MSPSO showed third and fourth-best effectiveness. For efficiency, NSGA-II is the fastest algorithm in terms of execution time and convergence speed followed by AMOSA, MOABC, and MSPSO. AMOSA, MOABC, and MSPSO showed a high level of repeatability compared to NSGA-II. It seems that by modifying MOABC and increasing its effectiveness, it could be a proper algorithm for evacuation planning.

17 citations


Cites methods from "Multiobjective Simulated Annealing-..."

  • ...It has been used to solve medical and engineering-related problems [30,31], but so far there is no literature on AMOSA applied to solve evacuation problems....

    [...]

Journal ArticleDOI
TL;DR: The membership matrix is expected to assist pathologists and oncologists in cases of unresectable tumors or scant biopsy materials for histological subtyping and cancer therapy.

16 citations

Journal ArticleDOI
01 Jul 2019
TL;DR: This study has posed the problem of automatically uncovering functionally related genes in the multi-objective optimization (MOO) framework where different bi-cluster quality measures are optimized simultaneously and the search potentiality of a simulated annealing-based MOO technique, AMOSA, is used for the simultaneous optimization of these measures.
Abstract: High-throughput technologies, like DNA microarray, help in simultaneous monitoring of the expression levels of thousands of genes during important biological processes and over the collection of experimental conditions. Automatically uncovering functionally related genes is a basic building block to solve various problems related to functional genomics. But sometimes a subset of genes may not be similar with respect to all the conditions present in the dataset; thus, bi-clustering concept becomes popular where different subsets of genes and the corresponding subsets of conditions with respect to which genes are most similar are automatically identified. In the current study, we have posed this problem in the multi-objective optimization (MOO) framework where different bi-cluster quality measures are optimized simultaneously. The search potentiality of a simulated annealing-based MOO technique, AMOSA, is used for the simultaneous optimization of these measures. A case study on the suitability of different distance measures in solving the bi-clustering problem is also conducted. The competency of the proposed multi-objective-based bi-clustering approach is shown for three benchmark datasets. The obtained results are further validated using statistical and biological significance tests.

13 citations


Cites background or methods from "Multiobjective Simulated Annealing-..."

  • ...As supported by the existing literature, Euclidean distance has been used widely in performing clustering on biological datasets (Acharya et al. 2016)....

    [...]

  • ...These distances are also proven to perform well for detecting clusters from gene expression datasets (Acharya et al. 2016;Acharya andSaha 2016)....

    [...]

  • ...Literature survey shows that commonly used distance measure in most of the clustering and bi-clustering algorithms is Euclidean distance (Acharya et al. 2016; Sahoo et al. 2016)....

    [...]

  • ...Literature survey supports the use of this distance function in performing clustering on gene expression datasets (Acharya et al. 2016; Acharya and Saha 2016)....

    [...]

  • ...Recent study (Acharya et al. 2016; Acharya and Saha 2016) revealed that simulated annealing-based multi-objective technique, AMOSA, performs better than existing multi-objective evolutionary techniques, namelyNSGA-II, PAES, etc....

    [...]

References
More filters
Journal ArticleDOI
13 May 1983-Science
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Abstract: There is a deep and useful connection between statistical mechanics (the behavior of systems with many degrees of freedom in thermal equilibrium at a finite temperature) and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters). A detailed analogy with annealing in solids provides a framework for optimization of the properties of very large and complex systems. This connection to statistical mechanics exposes new information and provides an unfamiliar perspective on traditional optimization problems and methods.

41,772 citations

Journal ArticleDOI
TL;DR: This paper suggests a non-dominated sorting-based MOEA, called NSGA-II (Non-dominated Sorting Genetic Algorithm II), which alleviates all of the above three difficulties, and modify the definition of dominance in order to solve constrained multi-objective problems efficiently.
Abstract: Multi-objective evolutionary algorithms (MOEAs) that use non-dominated sorting and sharing have been criticized mainly for: (1) their O(MN/sup 3/) computational complexity (where M is the number of objectives and N is the population size); (2) their non-elitism approach; and (3) the need to specify a sharing parameter. In this paper, we suggest a non-dominated sorting-based MOEA, called NSGA-II (Non-dominated Sorting Genetic Algorithm II), which alleviates all of the above three difficulties. Specifically, a fast non-dominated sorting approach with O(MN/sup 2/) computational complexity is presented. Also, a selection operator is presented that creates a mating pool by combining the parent and offspring populations and selecting the best N solutions (with respect to fitness and spread). Simulation results on difficult test problems show that NSGA-II is able, for most problems, to find a much better spread of solutions and better convergence near the true Pareto-optimal front compared to the Pareto-archived evolution strategy and the strength-Pareto evolutionary algorithm - two other elitist MOEAs that pay special attention to creating a diverse Pareto-optimal front. Moreover, we modify the definition of dominance in order to solve constrained multi-objective problems efficiently. Simulation results of the constrained NSGA-II on a number of test problems, including a five-objective, seven-constraint nonlinear problem, are compared with another constrained multi-objective optimizer, and the much better performance of NSGA-II is observed.

37,111 citations


"Multiobjective Simulated Annealing-..." refers methods in this paper

  • ...…results prove that the proposed AMOSA-based clustering technique without using any postprocessing mechanism (without using the advantages of SVM) performs much better than MOGASVM approach, which utilizes the advantages of both NSGA-II [3] and SVM, as well as other chosen clustering algorithms....

    [...]

  • ...2) Experimental results on three open access datasets show that AMOSA-based clustering technique outperforms all the state-of-the-art clustering techniques including a recently introduced MOO-based clustering technique, MOGASVM utilizing the search capability of NSGA-II [3], a GA-based MOO technique....

    [...]

  • ...Obtained results prove that the proposed AMOSA-based clustering technique without using any postprocessing mechanism (without using the advantages of SVM) performs much better than MOGASVM approach, which utilizes the advantages of both NSGA-II [3] and SVM, as well as other chosen clustering algorithms....

    [...]

  • ...MOGASVM clustering algorithm is a combination of NSGA-II and SVM [13] (after getting clustering solutions using NSGA-II [3], those are combined using majority voting concept following the principles of SVM [14])....

    [...]

  • ...In [13], a MOO-based clustering technique is developed using the search capability of NSGA-II (nondominated sorting GA-II) [3] for gene marker identification from cancer tissue samples....

    [...]

01 Jan 1998
TL;DR: Presenting a method for determining the necessary and sufficient conditions for consistency of learning process, the author covers function estimates from small data pools, applying these estimations to real-life problems, and much more.
Abstract: A comprehensive look at learning and generalization theory. The statistical theory of learning and generalization concerns the problem of choosing desired functions on the basis of empirical data. Highly applicable to a variety of computer science and robotics fields, this book offers lucid coverage of the theory as a whole. Presenting a method for determining the necessary and sufficient conditions for consistency of learning process, the author covers function estimates from small data pools, applying these estimations to real-life problems, and much more.

26,531 citations


"Multiobjective Simulated Annealing-..." refers methods in this paper

  • ...In [13], a MOO-based clustering technique is developed using the search capability of NSGA-II (nondominated sorting GA-II) [3] for gene marker identification from cancer tissue samples....

    [...]

Journal ArticleDOI
TL;DR: A new graphical display is proposed for partitioning techniques, where each cluster is represented by a so-called silhouette, which is based on the comparison of its tightness and separation, and provides an evaluation of clustering validity.

14,144 citations

Journal ArticleDOI
TL;DR: An overview of pattern clustering methods from a statistical pattern recognition perspective is presented, with a goal of providing useful advice and references to fundamental concepts accessible to the broad community of clustering practitioners.
Abstract: Clustering is the unsupervised classification of patterns (observations, data items, or feature vectors) into groups (clusters). The clustering problem has been addressed in many contexts and by researchers in many disciplines; this reflects its broad appeal and usefulness as one of the steps in exploratory data analysis. However, clustering is a difficult problem combinatorially, and differences in assumptions and contexts in different communities has made the transfer of useful generic concepts and methodologies slow to occur. This paper presents an overview of pattern clustering methods from a statistical pattern recognition perspective, with a goal of providing useful advice and references to fundamental concepts accessible to the broad community of clustering practitioners. We present a taxonomy of clustering techniques, and identify cross-cutting themes and recent advances. We also describe some important applications of clustering algorithms such as image segmentation, object recognition, and information retrieval.

14,054 citations