Content‐based image retrieval (CBIR) uses primitive image features for retrieval of similarimages from a dataset. Generally, researchers extract these visual features fromthe whole image. Therefore, the extracted features contain overlappedinformation of texture, colour, and shape features, and it is a criticalchallenge in the field of CBIR. This problem can be overcome by extracting thecolour features from the colour as well as shape and texture features from theintensity dominant part only. In this study, the authors have proposed aniterative algorithm to separate colour and texture dominant part of the imageinto two different images. Here, a combination of edge maps and gradients hasbeen used to achieve separate colour and texture images. Further,scale‐invariant feature transform and 2D dual‐tree complex wavelet transform hasbeen realised to extract unique shape and texture features from the textureimage. Simultaneously, a probability‐based semantic centred annular histogramhas been suggested to extract unique colour features from the colour image.Finally, a novel weighted distance‐based feature comparison scheme has beenproposed for similarity matching and retrieval. All the image retrievalexperiments have been carried out on seven standard datasets and demonstratedsignificant improvements over other state‐of‐arts CBIR systems

An evolutionary rough feature selection algorithm is used for classifying microarray gene expression patterns. Since the data typically consist of a large number of redundant features, an initial redundancy reduction of the attributes is done to enable faster convergence. Rough set theory is employed to generate reducts, which represent the minimal sets of nonredundant features capable of discerning between all objects, in a multiobjective framework. The effectiveness of the algorithm is demonstrated on three cancer datasets.

Biclustering or simultaneous clustering of both genes and conditions have generated considerable interest over the past few decades, particularly related to the analysis of high-dimensional gene expression data in information retrieval, knowledge discovery, and data mining. The objective is to find sub-matrices, i.e., maximal subgroups of genes and subgroups of conditions where the genes exhibit highly correlated activities over a range of conditions. Since these two objectives are mutually conflicting, they become suitable candidates for multi-objective modeling. In this study, a novel multi-objective evolutionary biclustering framework is introduced by incorporating local search strategies. A new quantitative measure to evaluate the goodness of the biclusters is developed. The experimental results on benchmark datasets demonstrate better performance as compared to existing algorithms available in literature.

In this study, we introduce a novel clustering architecture, in which several subsets of patterns can be processed together with an objective of finding a common structure. The structure revealed at the global level is determined by exchanging prototypes of the subsets of data and by moving prototypes of the corresponding clusters toward each other. Thereby, the required communication links are established at the level of cluster prototypes and partition matrices, without hampering the security concerns. A detailed clustering algorithm is developed by integrating the advantages of both fuzzy sets and rough sets, and a measure of quantitative analysis of the experimental results is provided for synthetic and real-world data.