Search

Lung tumor is a complex disease caused due to the irregular growth of lung cells. A key factor in effective treatment planning is the early detection of lung tumor. Visual similarity between benign and malignant nodules, heterogeneity and low contrast variation are the factors that make accurate cancerous lesion recognition, a very challenging task. In this paper, Optimized Deep convolutional neural network (DCNN) and Fuzzy C‐means with Equilibrium optimizer (FCM‐EO) is proposed for classification and segmentation of CT lung images. The proposed architecture is comprised of four phases such as preprocessing, feature extraction, classification and segmentation. In preprocessing, the weighted mean histogram analysis (WMHA) is utilized to enhance the quality of images and noise removal. Hybrid Dual tree‐complex wavelet transform (DT‐CWT) with Gabor filter is proposed in feature extraction to extract the features from the preprocessed images. DCNN model is designed to classify the original images into benign and malignant images. The weight of DCNN model is updated using the Enhanced black widow optimization algorithm (EBWOA). In segmentation, FCM‐EO is introduced to identify the tumor regions and remove the outliers from the malignant images. LIDC‐IDRI dataset is utilized for the experimental analysis and MATLAB is the implementation tool. The simulation analysis is performed for both the classification and segmentation processes. Accuracy, specificity, sensitivity, precision, F‐measure, FROC, DSC, MCC, and IoU are evaluated for both these processes. The experimental results showed the proposed framework is efficient for the identification of tumor from the CT lung images. [ABSTRACT FROM AUTHOR]

The oddity in large information is rising step by step so that the current programming instruments faces trouble in supervision of huge information. Moreover, the pace of the irregularity information in the immense datasets is a key imperative to the exploration business. Along these lines, this paper proposes a novel method for taking care of the large information utilizing Spark structure. The proposed method experiences two stages for arranging the enormous information, which includes highlight choice and arrangement, which is acted in the underlying hubs of Spark engineering. The proposed improvement calculation is named Rider Chaotic Biography streamlining (RCBO) calculation, which is the incorporation of the Rider Optimization Algorithm (ROA) and the standard confused biogeography-based-advancement (CBBO). The proposed RCBO-profound stacked auto-encoder utilizing Spark structure successfully handles the large information for achieving powerful huge information arrangement. Here, the proposed RCBO is utilized for choosing reasonable highlights from the monstrous dataset. Besides, the profound stacked auto-encoder utilizes RCBO for preparing so as to characterize colossal datasets. In this research we focused on problem of supervision related to big information of The Cover type Data in UCI machine learning repository. The dataset describes the forest cover set data to predict the forest cover type from cartographic variables. The dataset is multivariate in nature with number of web hits 263,361. The number of instances is 581012 with 54 numbers of attributes and the task associated for the dataset is classification. The examination of the proposed RCBO-profound stacked auto-encoder-based Spark structure utilizing the UCI AI datasets uncovered that the proposed technique beat different strategies, by procuring maximal exactness of 86.71%, dice coefficient of 92.7%, affectability of 75.2% and explicitness of 95.4% separately. [ABSTRACT FROM AUTHOR]

Many current intrinsically interpretable machine learning models can only handle the data that are linear, low-dimensional, and relatively independent attributes and often with discrete attribute values, while the models that are capable of handling high-dimensional nonlinear data, like deep learning, have very poor interpretability. Based on the geometric characteristics, a new idea of accurately wrapping the data region with minimum-volume geometry is proposed for pattern classification. The Variance Hyper Rectangle (VHR) model presented in this paper is a realization of the idea. The VHR model uses the minimum-volume hyper rectangles, obtained through projection variance calculation, to wrap the regions occupied by a category of data, hence it has strong and clear geometric interpretability. In addition, the VHR model is well suited for large data volume, as it approaches the linear complexity in both time and space. Extensive qualitative and quantitative experiments are performed on seven real-world data sets, demonstrating that VHR outperforms the state-of-the-art interpretable methods while running quickly. [Display omitted] • VHR has strong geometric interpretability, and is much reliable and trustworthy. • VHR can provide a clear range of values in each direction for a category of data. • VHR naturally supports incremental learning without any extra processing. • VHR has great performance and stability, and is able to handle big data. [ABSTRACT FROM AUTHOR]