
Editorial
Select search scope: search across all journals or within the current journal

Relation extraction is one of the core tasks of natural language processing, which aims to identify entities in unstructured text and judge the semantic relationships between them. In the traditional methods, the extraction of rich features and the judgment of complex semantic relations are inadequate. Therefore, in this paper, we propose a relation extraction model, HAGCN, based on heterogeneous graph convolutional neural network and graph attention mechanism. We have constructed two different types of nodes, words and relations, in a heterogeneous graph convolutional neural network, which are used to extract different semantic types and attributes and further extract contextual semantic representations. By incorporating the graph attention mechanism to distinguish the importance of different information, and the model has stronger representation ability. In addition, an information update mechanism is designed in the model. Relation extraction is performed after iteratively fusing the node semantic information to obtain a more comprehensive node representation. The experimental results show that the HAGCN model achieves good relation extraction performance, and its F1 value reaches 91.51% in the SemEval-2010 Task 8 dataset. In addition, the HAGCN model also has good results in the WebNLG dataset, verifying the generalization ability of the model.
Social relationships among students at campus are closely related to their mental health and academic performance. Therefore, it is a very important task for educators to analyze students’ social relationships. However, existing studies have focused on one-to-one social relationships between students, few ones have explored the high-order community relationships hidden in social networks, especially in a visual manner. To solve this problem, a visual analysis system called ViSSR is proposed in this paper, which utilizes the Louvain algorithm to detect the hierarchical community structure of students’ social network at campus, and then provides four coordinated views to visualize the detection results. Among the views, the hierarchical hypergraph view is to visualize the hierarchical community structure that greatly breaks through the limitations of first-order relationships available in a traditional node-link social network, the community analysis view and individual analysis view show the social characteristics of a community and individual student respectively, and the matrix view displays the behavioral features of students. Case studies and experts evaluation have been conducted to demonstrate the usability of the system.
Multi-behavior recommendation models excel in extracting abundant information from user-item interactions to enhance performance; however, they encounter challenges in accuracy due to noise disturbance and ambiguous weight allocation. In this paper, we propose cd-MBRec, a novel model designed to amplify commonality among various behaviors, thereby minimizing noise interference while preserving behavior diversity to highlight semantic variations in feedback across distinct scenarios. Specifically, the model begins by constructing behavior matrices that models separate behaviors, along with an interaction matrix offering a broad overview of user behaviors. It employs graph neural networks to extract higher-order semantic and structural information from input data. Concurrently, the model integrates principles of Weber-Fechner Law for the adaptive allocation of initial weights to the multiple behaviors and utilizes matrix factorization techniques for efficient behavior embedding. Extensive experiments on two real-world datasets demonstrate that cd-MBRec surpasses existing state-of-the-art models in recommendation performance, achieving notable average improvements of 4.96% in HR@10 and 7.75% in NDCG@10.
Graph clustering is a crucial technique for partitioning graph data. Recent research has concentrated on integrating topology and attribute information from attribute graphs to generate node embeddings, which are subsequently clustered using classical algorithms. However, these methods have some limitations, such as insufficient information inheritance in shallow networks or inadequate quality of reconstructed nodes, leading to suboptimal clustering performance. To tackle these challenges, we introduce two normalization techniques within the graph attention autoencoder framework, coupled with an MSE loss, to facilitate node embedding learning. Furthermore, we integrate Transformers into the self-optimization module to refine node embeddings and clustering outcomes. Our model can induce appropriate node embeddings for graph clustering in a shallow network. Our experimental results demonstrate that our proposed approach outperforms the state-of-the-art in graph clustering over multiple benchmark datasets. In particular, we achieved 76.3% accuracy on the Pubmed dataset, an improvement of at least 7% compared to other methods.
Neural style transfer is used as an optimization technique that combines two different images – a content image and a style reference image – to produce an output image that retains the appearance of the content image but has been modified to match the actual style of the style reference image. This is achieved by fine-tuning the output image to match the style reference images and the statistics for both content and style in the content image. These statistics are extracted from the images using a convolutional network. Primitive models such as WCT were improved upon by models such as PhotoWCT, whose spatial and temporal limitations were improved upon by Deep Photo Style Transfer. Eventually, wavelet transforms were introduced to perform photorealistic style transfer. A wavelet-corrected transfer based on whitening and colouring transforms, i.e., WCT2, was proposed that allowed the preservation of core content and eliminated the need for any post-processing steps and constraints. A model called Domain-Aware Universal Style Transfer also came into the picture. It supported both artistic and photorealistic style transfer. This study provides an overview of the neural style transfer technique. The recent advancements and improvements in the field, including the development of multi-scale and adaptive methods and the integration of semantic segmentation, are discussed and elaborated upon. Experiments have been conducted to determine the roles of encoder-decoder architecture and Haar wavelet functions. The optimum levels at which these can be leveraged for effective style transfer are ascertained. The study also highlights the contrast between VGG-16 and VGG-19 structures and analyzes various performance parameters to establish which works more efficiently for particular use cases. On comparing quantitative metrics across Gatys, AdaIN, and WCT, a gradual upgrade was seen across the models, as AdaIN was performing 99.92 percent better than the primitive Gatys model in terms of processing time. Over 1000 iterations, we found that VGG-16 and VGG-19 have comparable style loss metrics, but there is a difference of 73.1 percent in content loss. VGG-19, however, is displaying a better overall performance since it can keep both content and style losses at bay.
With the modernization of cities, public sculptures are constantly being designed and constructed. The artistic form and image expression effect of sculpture based on intelligent and parametric design needs to be designed and developed to guide and assist the construction of sculpture. This paper applies the NAS architecture search method to explore the field of image expression effect models. Through the end-to-end search of the experiment designed in this paper, the separable convolution lightweight design is used, and the new model AestheticNet is used to predict the image form effect score distribution. Secondly, this paper proposes optimization strategies combining image expression effect theory and convolutional neural network, including improvement of Loss function self-weighted Loss, two-dimensional Attention mechanism – introduction of CBAM, and adaptive pooling layer. Optimization of several aspects, such as adaptive input. Finally, the validation set is compared with other existing image-morphological effect model algorithms, which proves the effectiveness of the customized search scheme. It demonstrates the efficacy of the AestheticNet model compared to other algorithms by validating its prediction of public sculpture image form effect ratings. The artistic form using intelligent and parametric design methodologies may improve. Image expression of sculptures may be enhanced by applying the image form effect model, which should be pervasive. We can use it to intelligently and parametrically guide the design and manufacture of sculptures.
Periodic high-utility sequential patterns (PHUSPs) mining is one of the research hotspots in data mining, which aims to discover patterns that not only have high utility but also regularly appear in sequence datasets. Traditional PHUSP mining mainly focuses on mining patterns from a single sequence, which often results in some interesting patterns being discarded due to strict constraints, and most of the discovered patterns are unstable and difficult to use for decision-making. In response to this issue, a novel algorithm called TKSPUS (top-k stable periodic high-utility sequential pattern mining) is proposed to discover stable top-k periodic high-utility sequential patterns that co-occur in multi-sequences. TKSPUS extends the traditional periodic high-utility sequential patterns mining, and designs two new metrics, namely utility stability coefficient (usc) and periodic stability coefficient (sr), to determine the periodic stability and utility stability of patterns in multi-sequences respectively. Additionally, the TKSPUS algorithm adopts the projection mechanism to mine stable periodic high-utility patterns over multi-sequence, while a new data structure called
Missing data is one of the challenges a researcher encounters while attempting to draw information from data. The first step in solving this issue is to have the data stage ready for processing. Much effort has been made in this area; removing instances with missing data is a popular method for handling missing data, but it has drawbacks, including bias. It will be impacted negatively on the results. How missing values are handled depends on several vectors, including data types, missing rates, and missing mechanisms. It covers missing data patterns as well as missing at random, missing at completely random, and missing not at random. Other suggestions include using numerous imputation techniques divided into various categories, such as statistical and machine learning methods. One strategy to improve a model’s output is to weight the feature values to better the performance of classification or regression approaches. This research developed a new imputation technique called correlation coefficient min-max weighted imputation (CCMMWI). It combines the correlation coefficient and min-max normalization techniques to balance the feature values. The proposed technique seeks to increase the contribution of features by considering how those elements relate to the desired functionality. We evaluated several established techniques to assess the findings, including statistical techniques, mean and EM imputation, and machine learning imputation techniques, including
Joint spectral-spatial feature extraction has been proven to be the most effective part of hyperspectral image (HSI) classification. But, due to the mixing of informative and noisy bands in HSI, joint spectral-spatial feature extraction using convolutional neural network (CNN) may lead to information loss and high computational cost. More specifically, joint spectral-spatial feature extraction from excessive bands may cause loss of spectral information due to the involvement of convolution operation on non-informative spectral bands. Therefore, we propose a simple yet effective deep learning model, named deep hierarchical spectral-spatial feature fusion (DHSSFF), where spectral-spatial features are exploited separately to reduce the information loss and fuse the deep features to learn the semantic information. It makes use of abundant spectral bands and few informative bands of HSI for spectral and spatial feature extraction, respectively. The spectral and spatial features are extracted through 1D CNN and 3D CNN, respectively. To validate the effectiveness of our model, the experiments have been performed on five well-known HSI datasets. Experimental results demonstrate that the proposed method outperforms other state-of-the-art methods and achieved 99.17%, 98.84%, 98.70%, 99.18%, and 99.24% overall accuracy on Kennedy Space Center, Botswana, Indian Pines, University of Pavia, and Salinas datasets, respectively.
There has been extensive use of machine learning (ML) based tools for mathematical symbol and phrase categorization and prediction. Aiming to thoroughly analyze the existing methods for categorizing brain tumors, this paper considers both machine-learning and non-machine-learning approaches. From 2013 to 2023, the writers compiled and reviewed research papers on brain tumor detection. Wiley, IEEE-Explore, Science-Direct, Scopus, ACM-Digital Library, and others provide the relevant data. A systematic literature review examines the efficacy of research methodologies over the last ten years or more by compiling relevant publications and studies from various sources. Accuracy, sensitivity, specificity, and computing efficiency are some of the criteria that researchers use to evaluate these methods. The availability of labeled data, the required degree of automation and accuracy in the classification process, and the unique dataset are generally the deciding factors in the method choice. This work integrates previous research findings to summarize the current state of brain tumor categorization. This paper summarizes the 169 research papers in brain tumor detection between 2013–2023 and explores the application and development of machine learning methods in brain tumor detection, which has significant research implications and value in the field of brain tumor classification research. All research findings of previous studies are arranged in this paper in the form of research questions and answers format.
Technological developments in medical image processing have created a state-of-the-art framework for accurately identifying and classifying brain tumors. To improve the accuracy of brain tumor segmentation, this study introduced VisioFlow FusionNet, a robust neural network architecture that combines the best features of DeepVisioSeg and SegFlowNet. The proposed system uses deep learning to identify the cancer site from medical images and provides doctors with valuable information for diagnosis and treatment planning. This combination provides a synergistic effect that improves segmentation performance and addresses challenges encountered across various tumor shapes and sizes. In parallel, robust brain tumor classification is achieved using NeuraClassNet, a classification component optimized with a dedicated catfish optimizer. NeuraClassNet’s convergence and generalization capabilities are powered by the Cat Fish optimizer, which draws inspiration from the adaptive properties of aquatic predators. By complementing a comprehensive diagnostic pipeline, this classification module helps clinicians accurately classify brain tumors based on various morphological and histological features. The proposed framework outperforms current approaches regarding segmentation accuracy (99.2%) and loss (2%) without overfitting.
Breast cancer poses a significant threat to women’s health, emphasizing the crucial role of timely detection. Traditional pathology reports, though widely used, face challenges prompting the development of automated Deep Learning (DL) tools. DL models, gaining traction in radiology, offer precise diagnoses; however, issues with generalization on varying dataset sizes persist. This paper introduces a computationally efficient DL framework, addressing dataset imbalance through a hybrid model design, ensuring both accuracy and speed in breast cancer image classification. Proposed model novel design excels in accuracy and generalization across medical imaging datasets, providing a robust tool for precise diagnostics. The proposed model integrates features from two classifiers, Inception ResNet V2 and Vision Transformers (ViT), to enhance the classification of breast cancer. This synergistic blend enhances adaptability, ensuring consistent performance across diverse dataset scales. A key contribution is the introduction of an Efficient Attention Mechanism within one of the classifiers, optimizing focus on critical features for improved accuracy and computational efficiency. Further, a Resource-Efficient Optimization model through feature selection is proposed, streamlining computational usage without compromising accuracy. Addressing the inherent heterogeneity within classifiers, our framework integrates high dimensional features comprehensively, leading to more accurate tumor class predictions. This consideration of heterogeneity marks a significant leap forward in precision for breast cancer diagnosis. An extensive analysis on datasets, BreakHis and BACH, that are imbalanced in nature is conducted by evaluating complexity, performance, and resource usage. Comprehensive evaluation using the datasets and standard performance metrics accuracy, precision, Recall, F1-score, MCC reveals the model’s high efficacy, achieving a testing accuracy of 0.9936 and 0.994, with precision, recall, F1-score and MCC scores of 0.9919, 0.987, 0.9898, 0.9852 and 0.989, 1.0, 0.993, 0.988 on the BreakHis and BACH datasets, respectively. Our proposed model outperforms state-of-the-art techniques, demonstrating superior accuracy across different datasets, with improvements ranging from 0.25% to 15% on the BACH dataset and from 0.36% to 15.02% on the BreakHis dataset. Our results position the framework as a promising solution for advancing breast cancer prediction in both clinical and research applications. The collective contributions, from framework and hybrid model design to feature selection and classifier heterogeneity consideration, establish a holistic and state-of-the-art approach, significantly improving accuracy and establishing optimization in breast cancer classification from MRI images. Future research for the DL framework in breast cancer image classification includes enhancing interpretability, integrating multi-modal data, and developing personalized treatments.
Medical assisted decision-making plays a key role in providing accurate and reliable medical advice. But in medical decision-making, various uncertainties are often accompanied. The belief rule base (BRB) has a strong nonlinear modeling capability and can handle uncertainties well. However, BRB suffers from combinatorial explosion and tends to influence explainability during the optimization process. Therefore, an interval belief rule base with explainability (IBRB-e) is explored in this paper. Firstly, pre-processing using extreme gradient boosting (XGBoost) is performed to filter out features with lower importance. Secondly, based on the filtered features, explainability criterion is defined. Thirdly, evidence reasoning (ER) rule is chosen as an inference tool, while projection covariance matrix adaptive evolutionary strategy (P-CMA-ES) algorithm with explainability constraints is chosen as an optimization algorithm. Lastly, the validation of the model is performed through a breast cancer case. The experimental results show that IBRB-e has good explainability while maintaining high accuracy.
Bones collaborate with muscles and joints to sustain and maintain our freedom of mobility. The proper musculoskeletal activity of bone protects and strengthens the brain, heart, and lung function. When a bone is subjected to a force greater than its structural capacity, it fractures. Bone fractures should be detected with the appropriate type and should be treated early to avoid acute neurovascular complications. The manual detection of bone fracture may lead to highly delayed complications like malunion, Joint stiffness, Contractures, Myositis ossificans, and Avascular necrosis. A proper classification system must be integrated with deep learning technology to classify bone fractures accurately. This motivates me to propose a Systematized Attention Gate UNet (SAG-UNet) that classifies the type of bone fracture with high accuracy. The main contribution of this research is two-fold. The first contribution focuses on dataset preprocessing through feature extraction using unsupervised learning by adapting the Growing Neural Gas (GNG) method. The second contribution deals with refining the supervised learning Attention UNet model that classifies the ten types of bone fracture. The attention gate of the Attention UNet model is refined and applied to the upsampling decoding layer of Attention UNet. The KAGGLE Bone Break Classification dataset was processed to extract only the essential features using GNG extraction. The quantized significant feature RGB X-ray image was divided into 900 training and 230 testing images in the ratio of 80:20. The training images are fitted with the existing CNN models like DenseNet, VGG, AlexNet, MobileNet, EfficientNet, Inception, Xception, UNet and Attention UNet to choose the best CNN model. Experiment results portray that Attention UNet offers the classification of bone fractures with an accuracy of 89% when testing bone break images. Now, the Attention UNet was chosen to refine the Attention gate of the Decoding upsampling layer that occurs after the encoding layer. The Attention Gate of the proposed SAG-UNet forms the gating coefficient from the input feature map and gate signal. The gating coefficient is then processed with batch normalization that centers the aligned features in the active region, thereby leaving the focus on the unaligned weights of feature maps. Then, the ReLU activation function is applied to introduce the nonlinearity in the aligned features, thereby learning the complex representation in the feature vector. Then, dropout is used to exclude the error noise in the aligned weights of the feature map. Then, 1
The pharmaceutical supply chain, which ensures that drugs are accessible to patients in a trusted process, is a complex arrangement in the healthcare industry. For that, a secure pharmachain framework is proposed. Primarily, the users register their details. Then, the details are converted into cipher text and stored in the blockchain. If a user requests an order, the manufacturer receives the request, and the order is handed to the distributor. Labeling is performed through Hypergeometric Distribution Centroid Selection K-Medoids Clustering (HDCS-KMC) to track the drugs. The healthcare Pharmachain architecture uses IoT to control the supply chain and provide safe medication tracking. The framework includes security with a classifier and block mining consensus method, boosts performance with a decision controller, and protects user and medication information with encryption mechanisms. After that, the drugs are assigned to vehicles, where the vehicle ID and Internet of Things (IoT) sensor data are collected and pre-processed. Afterward, the pre-processed data is analyzed in the fog node by utilizing a decision controller. Now, the status ID is generated based on vehicle id and location. The generated status ID is meant for fragmentation, encryption, and block mining processes. If a user requests to view the drug’s status ID, then the user needs to get authentication. The user’s forking behavior and request activities were extracted and given to the classifier present in the block-mining consensus algorithm for authentication purposes. Block mining happens after authentication, thereby providing the status ID. Furthermore, the framework demonstrates an efficaciousness in identifying assaults with a low False Positive Rate (FPR) of 0.022483% and a low False Negative Rate (FNR) of 1.996008%. Additionally, compared to traditional methods, the suggested strategy exhibits good precision (97.869%), recall (97.0039%), accuracy (98%), and F-measure (97.999%).