Urban planning faces increasingly complex challenges, marked by rapid urbanization and the need for sustainable development. Recognizing these challenges, our research focuses on semantic segmentation in aerial imagery. In our research, we identify challenges such as inadequate delineation of environmental features and the difficulty of obtaining critical insights from aerial imagery. To tackle these issues, we propose a state-of-the-art solution employing a modified Inception-ResNet-V2 U-Net architecture. Our research encompasses a comprehensive methodology that includes meticulous dataset preparation, bespoke model architecture design, refined loss function optimization, and robust training protocols augmented by data enrichment techniques. Our results showcase an impressive model accuracy of 84.6%, underlining the method's superior performance in accurately delineating environmental features from aerial imagery. This land use and land cover classification empowers urban planners and developers with critical insights, facilitating informed decision-making and sustainable urban development. Our paper also focuses on contour detection performed on natural vegetation which is one of the crucial aspect for urban planning. This approach offers a tool that can be used in real time for urban planning and improved accuracy of environmental feature delineation.

Fuzzy clustering is a common way to divide data into groups. Even though it has been improved a lot, fuzzy clustering still has problems while clustering real high-dimensional Big Data with complicated latent distributions. To solve this problem, this study comes up with a way to represent the data in a feature space that was built from a scalable deep neural network using Apache Spark on HPC. In this paper, we proposed SDnnRSIO-FCM, a Scalable Deep Neural Network Random Sampling Iterative Optimization-FCM clustering algorithm, and the SDnnLFCM, a scalable version of the Deep Neural Network Literal Fuzzy c-Means algorithm. We focus on the design and implementation of the proposed SDnnRSIO-FCM and SDnnLFCM algorithms using the Apache Spark cluster in a High-Performance Computing (HPC) environment by representing the data in a feature space produced by the neural network to handle Big Data. First, data is mapped into new feature space to aid in the reconstruction of the original data by providing a good representation. Second, scalable fuzzy clustering is embedded with neural networks to propose deep fuzzy clustering methods. The experimental results conducted on two huge benchmark datasets show that the SDnnRSIO-FCM algorithm outperforms the SDnnLFCM algorithm in terms of Normalized Mutual Information (NMI), Adjusted Rand Index (ARI), and F-score. Furthermore, the proposed SDnnRSIO-FCM applied to huge soybean protein sequences in comparison with SDnnLFCM shows a significant improvement in terms of Silhouette index (SI), Davies-Bouldin index (DBI), and Calinski-Harabasz index (CHI).

In real life, there are many applications where we need to take care of multiple parameters to get the optimized result. Similarly, many scientific and engineering problems require optimization of various parameters to get desired results. Many algorithms work well with a few variables to get optimized results, but on increasing the number of variables, they do not perform well. In this paper, we proposed an advanced quantum-inspired evolutionary algorithm (A-QEAM) to solve optimization problems where the tuning of multiple parameters or variables is required. A-QEAM is characterized by the principle of quantum computing such as superposition and qubit. This algorithm uses a qubit in place of the classical bit. The proposed algorithm is tested on mathematical functions consisting of 2 variables, 10 variables, 30 variables, and 50 variables. The result shows that the proposed algorithm performs well even on increasing the number of variables.

Learning in non-stationary environments require modern tools and algorithms to quickly adapt to the new pattern because concept drift can change the underlying distribution. So, the existing assumption that the data is independent and identically distributed may be invalid in data stream scenarios. Given the massive volume of high-speed data streams and the concept drift, traditional machine learning algorithms must be self-adapting. One of the difficulties in handling regression tasks is the complexities of equations for the regression models when combined with drift handling techniques. The high dimensional protein data is a major challenge for bioinformatics researchers to analyse the dynamics of the sequences. This paper proposes a Scalable Fuzzy Clustering induced Regression (SFC-R) algorithm to predict the isoelectric point of the plant protein sequences using Apache Spark clusters. The SFC-R algorithm uses the input features extracted from the plant protein sequences and validates performance in terms of mean squared error (MAE) and root-mean-square error (RMSE). Experiments on plant protein datasets are carried out to validate the high accuracy and robustness of our approach.

Alzheimer's disease (AD) is a neurodegenerative disorder resulting in memory loss and cognitive decline caused due to the death of brain cells. It is the most common form of dementia and accounts for 60-80% of all dementia cases. There is no single test for diagnosis of AD, the doctors rely on medical history, neuropsychological assessments, computed tomography (CT) or magnetic resonance imaging (MRI) scan of the brain, etc. to confirm a diagnosis. In terms of the treatment, currently, there is neither a cure nor any way to slow the progression of AD. However, for people with mild or moderate stages of this disease, there are some medications available to temporarily reduce symptoms and help to improve quality of life. Hence, early diagnosis of AD is extremely crucial for overall better management of the disease. The researches have shown some relation between neuropsychological scores and atrophies of the brain. This can be leveraged for the early diagnosis of AD. This paper makes use of feature selection techniques to extract the most important features in the diagnosis of AD. This paper demonstrates the need to combine neuropsychological scores like mini-mental state examination (MMSE) with MRI features to provide better decisional space for early diagnosis of AD. Through the experiments, including MMSE along with other features are found to improve the classification of AD, significantly.

Retinopathy of Prematurity (ROP) is a disease which requires immediate precautionary measures to prevent blindness in the infants, and this condition is prevalent in premature babies in all the underdeveloped, developing, and in the developed countries as well. This paper proposes a tool by which the stage and zones of Retinopathy of Prematurity in infants can be diagnosed easily. This tool takes the input from the Retcam and detects the stage, zone, and gives a rating of 1 to 9 for classifying the severity of the disease in the infants. This is achieved by extracting the optic disc, marking the ridge, and the distance of the optic nerve. This tool can be easily used by nurses and paramedics, unlike the existing technologies which require the guidance of a specialist to come to a conclusion.

A huge amount of digital data containing useful information, called Big Data, is generated everyday. To mine such useful information, clustering is widely used data analysis technique. A large number of Big Data analytics frameworks have been developed to scale the clustering algorithms for big data analysis. One such framework called Apache Spark works really well for iterative algorithms by supporting in-memory computations, scalability etc. We focus on the design and implementation of partitional based clustering algorithms on Apache Spark, which are suited for clustering large datasets due to their low computational requirements. In this paper, we propose Scalable Random Sampling with Iterative Optimization Fuzzy c-Means algorithm (SRSIO-FCM) implemented on an Apache Spark Cluster to handle the challenges associated with big data clustering. Experimental studies on various big datasets have been conducted. The performance of SRSIO-FCM is judged in comparison with the proposed scalable version of the Literal Fuzzy c-Means (LFCM) and Random Sampling plus Extension Fuzzy c-Means (rseFCM) implemented on the Apache Spark cluster. The comparative results are reported in terms of time and space complexity, run time and measure of clustering quality, showing that SRSIO-FCM is able to run in much less time without compromising the clustering quality.

In this paper, a Quantum-Inspired Evolutionary Fuzzy C-Means (QIE-FCM) algorithm is proposed. The proposed approach find the true number of clusters and the appropriate value of weighted exponent (m) which is required to be known in advance to perform clustering using Fuzzy C-Means (FCM) algorithm. However, the selection of inappropriate value of m and C may lead the algorithm to converge to the local optima. To address the issue of selecting the appropriate value of m and corresponding value of C. In QIE-FCM, the quantum concept is used in classical computer where m is represented in terms of quantum bits (qubits). The QIE-FCM is based on generations. At each generation (g), quantum gates are used to generate a new value of m. For each generated value of m, FCM algorithm is executed by varying values of C. Then, corresponding to m value appropriate value of C is identified by evaluating local fitness function for generation g. To achieve the global best value of m and C, the global fitness function is evaluated by comparing the local best fitness value in current generation with the best fitness value obtained among all the previous generations. To judge the efficacy of QIE-FCM algorithm, it is compared with two well-known indices and three evolutionary fuzzy based clustering algorithm and their performance is evaluated on four benchmark datasets. Furthermore, the sensitivity of QIE-FCM is also experimentally investigated in this paper.

Cluster validity index is a measure to determine the optimal number of clusters denoted by (C) and an optimal fuzzy partition for clustering algorithms. In this paper, we proposed a new cluster validity index to determine an optimal number of hyper-ellipsoid or hyper-spherical shape clusters generated by Fuzzy C-Means (FCM) algorithm called as VIDSOindex. The proposed validity index jointly exploits all the three measures named as intra-cluster compactness, an inter-cluster separation and overlap between the clusters. The proposed intra-cluster compactness is based on relative variability concept which is a statistical measure of relative dispersion or scattering of data in various dimensions within the clusters. The proposed inter-cluster separation measure indicates the isolation or distance between the fuzzy clusters. The proposed inter-cluster overlap measure determines the degree of overlap between the fuzzy clusters. The best fuzzy partition produced by the VIDSOindex is expected to have low degree of intra-cluster compactness, higher degree of inter-cluster separation and low degree of inter-cluster overlap. The efficacy of VIDSOindex is evaluated on six benchmark data sets and compared with a number of known validity indices. The experimental results and the comparative study demonstrate that, the proposed index is highly effective and reliable in estimating the optimal value of C and an optimal fuzzy partition for each data set because, it is insensitive with change in values of fuzzification parameter denoted by m. In contrast, the other indices [2], [3], [6], [7] fails to achieve the optimal value of C due to it is susceptibility with change in m.