Search

In this paper, we present a novel paradigm for disease detection. We build an artificial intelligence based system where various biomedical data are retrieved from distributed and homogeneous sensors. We use different deep learning architectures (VGG16, RESNET, and DenseNet) with ensemble learning and attention mechanisms to study the interactions between different biomedical data to detect and diagnose diseases. We conduct extensive testing on biomedical data. The results show the benefits of using deep learning technologies in the field of artificial intelligence of medical things to diagnose diseases in the healthcare decision‐making process. For example, the disease detection rate using the proposed methodology achieves 92%, which is greatly improved compared to the higher‐level disease detection models. [ABSTRACT FROM AUTHOR]

Internet‐based information exchange has resulted in the propagation of false and misleading information, which is highly detrimental to individuals and humankind. Due to the speed and volume of social media news production, supervised artificial intelligence algorithms require many annotated data, which is difficult, costly, and time‐consuming. To address this issue, we offer a novel federated semi‐supervised framework based on self‐ensembling that utilizes the linguistic and stylometric information of annotated news articles and searches for hidden patterns in unlabeled data to denoise labels. Self‐ensembling predicts the labels of unlabeled data by using the outcomes of network‐in‐training from earlier epochs. These cumulative predictions should be a stronger predictor for unknown labels than the output of the most recent training epoch; hence, they may be utilized as a substitute for the labels of unlabeled data. The approach is distinctive in collecting all of the outputs from the neural network's past training periods. It utilizes them as an unsupervised target against which to assess the current output prediction of unlabeled articles. We intend to create a dataset centred on denoising to forward the study. The dataset is mapped using (1) the shifting focus time from published news articles and (2) the semi‐supervised method based on coincidence contexts for a neural contrast embedding model for learning low‐dimensional continuous vectors that generate a focus time‐based query in sequential news articles for temporal comprehension. The model achieved 0.83% F‐measure with lexicon expansion semi‐supervised learning. [ABSTRACT FROM AUTHOR]

Cloud computing is the on‐demand provision of computing resources over the Internet, such as cloud storage, computing power, network, and so on. Cloud computing has several advantages, including high speed, cost reduction, data security, and scalability. The main challenge in cloud environment is to balance the workloads and network traffic among the available resources to achieve maximum performance. Several methods have been proposed in the literature for effective load balancing, including heuristic, meta‐heuristic, and hybrid algorithms. The performance of these techniques has been improved by combining machine learning based Artificial Intelligence (AI) techniques and meta‐heuristic algorithms. Most of the existing load balancing techniques are not aware of the content type of user tasks. However, from the literature, the content type of the tasks can be very effective to design a balanced workload distribution system in the cloud. In this work, a novel AI‐assisted hybrid approach called Content‐aware Machine Learning based Load Balancing Scheduler (CA‐MLBS) is proposed. The scheduling system CA‐MLBS combines machine learning and meta‐heuristic algorithms to perform classification based on file type. To achieve this, a Support Vector Machine (SVM) based classifier is used to classify user tasks into different content types such as video, audio, image, and text. A metaheuristic algorithm based on Particle Swarm Optimization (PSO) is used to map users' tasks in the cloud. The proposed approach was implemented and evaluated using a renowned Cloudsim simulation kit and compared with Ant Colony Optimization File Type Format (ACOFTF) and Data Files Type Formatting (DFTF) heuristics. The results of the proposed study show that the proposed CA‐MLBS technique achieved improvements of up to 29%, 29%, and 44% in terms of makespan, response time, and throughput, respectively. [ABSTRACT FROM AUTHOR]

Continuous progress in disruptive technologies such as artificial intelligence (AI) and control theory has prompted considerable improvements in BCI applications. Brain-Machine Interface, also called Brain-Computer Interface (BCI), is an emerging research field with diverse applications ranging from rehabilitation to human augmentation. Practically speaking, control algorithms for critical components of the BCI algorithm have a high level of important and are often called a decoder. [Extracted from the article]

This paper investigates the automated medical learning and proposes hybrid intelligent framework, called Hybrid Automated Medical Learning (HAML). The goal is the efficient combination of several intelligent components in order to automatically learn the medical data. Multi agents system is proposed by using distributed deep learning, and knowledge graph for learning medical data. The distributed deep learning is used for efficient learning of the different agents in the system, where the knowledge graph is used for dealing with heterogeneous medical data. To demonstrate the usefulness and accuracy of the HAML framework, intensive simulations on medical data were conducted. A wide range of experiments were conducted to verify the efficiency of the proposed system. Three case studies are discussed in this research, the first case study is related to process mining, and more precisely on the ability of HAML to detect relevant patterns from event medical data. The second case study is related to smart building, and the ability of HAML to recognize the different activities of the patients. The third one is related to medical image retrieval, and the ability of HAML to find the most relevant medical images according to the image query. The results show that the developed HAML achieves good performance compared to the most up‐to‐date medical learning models regarding both the computational and cost the quality of returned solutions. [ABSTRACT FROM AUTHOR]

The emergence of smart sensors, artificial intelligence, and deep learning technologies yield artificial intelligence of things, also known as the AIoT. Sophisticated cooperation of these technologies is vital for the effective processing of industrial sensor data. This paper introduces a new framework for addressing the different challenges of the AIoT applications. The proposed framework is an intelligent combination of multi‐agent systems, knowledge graphs and deep learning. Deep learning architectures are used to create models from different sensor‐based data. Multi‐agent systems can be used for simulating the collective behaviours of the smart sensors using IoT settings. The communication among different agents is realized by integrating knowledge graphs. Different optimizations based on constraint satisfaction as well as evolutionary computation are also investigated. Experimental analysis is undertaken to compare the methodology presented to state‐of‐the‐art AIoT technologies. We show through experimentation that our designed framework achieves good performance compared to baseline solutions. [ABSTRACT FROM AUTHOR]

This paper investigates the semantic modeling of smart cities and proposes two ontology matching frameworks, called Clustering for Ontology Matching‐based Instances (COMI) and Pattern mining for Ontology Matching‐based Instances (POMI). The goal is to discover the relevant knowledge by investigating the correlations among smart city data based on clustering and pattern mining approaches. The COMI method first groups the highly correlated ontologies of smart‐city data into similar clusters using the generic k‐means algorithm. The key idea of this method is that it clusters the instances of each ontology and then matches two ontologies by matching their clusters and the corresponding instances within the clusters. The POMI method studies the correlations among the data properties and selects the most relevant properties for the ontology matching process. To demonstrate the usefulness and accuracy of the COMI and POMI frameworks, several experiments on the DBpedia, Ontology Alignment Evaluation Initiative, and NOAA ontology databases were conducted. The results show that COMI and POMI outperform the state‐of‐the‐art ontology matching models regarding computational cost without losing the quality during the matching process. Furthermore, these results confirm the ability of COMI and POMI to deal with heterogeneous large‐scale data in smart‐city environments. [ABSTRACT FROM AUTHOR]

The stock market is a capitalistic haven where the issued shares are transferred, traded, and circulated. It bases stock prices on the issue market, however, the structure and trading activities of the stock market are much more complicated than the issue market itself. Therefore, making an accurate prediction becomes an intricate as well as highly difficult task. On the other hand, because of the potential benefits of stock prediction, it attracts generation after generation of scholars as well as investors to continuously develop various prediction methods from different perspectives, a myriad of theories, a multitude of investment strategies, and different practical experiences. In this article, aiming at the task of time series (financial) feature extraction and prediction of price movements, a new convolutional novel neural network that can be called a framework to improve the prediction accuracy of stock trading is proposed. The method that is proposed is called SSACNN, a short form of stock sequence array convolutional neural network. SSACNN collects data including historical data of prices and its leading indicators (options/futures) for a stock to take an array as the input graph of the convolutional neural network framework. In our experimental results, five Taiwanese and American stocks were used as a benchmark to compare with the previous algorithms and proposed algorithm, the motion prediction performance of SSACNN has been improved significantly and proved that it has the potential to be applied in the real financial market. [ABSTRACT FROM AUTHOR]

Privacy‐preserving data mining (PPDM) is a popular research topic in the data mining field. For individual information protection, it is vital to protect sensitive information during data mining procedures. Furthermore, it is also a serious offense to spill sensitive private knowledge. Recently, many PPDM data mining algorithms have been proposed to conceal sensitive items in a given database to disclose high‐frequency items. These recent methods have already proven to be excellent in protecting confidential information and maintaining the integrity of the input database. All prior techniques, however, ignored a crucial problem in setting minimum support thresholds. If a sensitive itemset includes more items, it will cause it the become more likely to be found. Before performing mining processes, a fixed value of the minimum support threshold will be set. In this paper, a new concept of minimal support for solving this issue is proposed. In compliance with a given threshold function, the proposed approach would set a tighter threshold for an object containing several items. The results of the experiments show the performance of the traditional Greedy PPDM approach, Genetic algorithm (GA)‐based PPDM approaches, and the proposed particle swarm optimization‐based algorithm with the new minimal support function. The results show that the proposed method performs similarly to conventional algorithms and offers higher protection than previous methods. [ABSTRACT FROM AUTHOR]

Graph data is found in numerous domains such as for the analysis of social networks, sensor networks, bioinformatics, industrial systems, and chemistry. Analyzing graphs to identify useful and interesting patterns is an important research area. It helps understanding graphs, and hence support decision making. Since two decades, many graph mining algorithms have been proposed to identify patterns such as frequent subgraphs, paths, cliques, and trees. But most of them assume that graphs are static. This simplifying assumption makes it easy to design algorithms but discard information about how graphs evolve. This article provides a detailed survey of techniques for mining interesting patterns in dynamic graphs, which can serve both as an introduction and as a guide to recent advances and opportunities in this research area. The main tasks related to mining patterns in dynamic graphs are reviewed such as discovering frequent subgraphs, evolution rules, motifs, subgraph sequences, recurrent and triggering patterns, and trend sequences. In addition, an overview of strategies and approaches to solve dynamic graph mining problems is presented, and their advantages and limitations are highlighted. Various extensions are also discussed such as to discover patterns in data streams and big data. Finally, the article mentions several research opportunities. This article is categorized under:Algorithmic Development > Spatial and Temporal Data MiningAlgorithmic Development > Association Rules [ABSTRACT FROM AUTHOR]

Traditional association rule mining has been widely studied. But it is unsuitable for real‐world applications where factors such as unit profits of items and purchase quantities must be considered. High‐utility itemset mining (HUIM) is designed to find highly profitable patterns by considering both the purchase quantities and unit profits of items. However, most HUIM algorithms are designed to be applied to static databases. But in real‐world applications such as market basket analysis and business decision‐making, databases are often dynamically updated by inserting new data such as customer transactions. Several researchers have proposed algorithms to discover high‐utility itemsets (HUIs) in dynamically updated databases. Unlike batch algorithms, which always process a database from scratch, incremental high‐utility itemset mining (iHUIM) algorithms incrementally update and output HUIs, thus reducing the cost of discovering HUIs. This paper provides an up‐to‐date survey of the state‐of‐the‐art iHUIM algorithms, including Apriori‐based, tree‐based, and utility‐list‐based approaches. To the best of our knowledge, this is the first survey on the mining task of incremental high‐utility itemset mining. The paper also identifies several important issues and research challenges for iHUIM. WIREs Data Mining Knowl Discov 2018, 8:e1242. doi: 10.1002/widm.1242 This article is categorized under: Algorithmic Development > Association Rules Application Areas > Data Mining Software Tools Fundamental Concepts of Data and Knowledge > Knowledge Representation [ABSTRACT FROM AUTHOR]

Due to the rapid growth of resource sharing, distributed systems are developed, which can be used to utilize the computations. Data mining ( DM) provides powerful techniques for finding meaningful and useful information from a very large amount of data, and has a wide range of real-world applications. However, traditional DM algorithms assume that the data is centrally collected, memory-resident, and static. It is challenging to manage the large-scale data and process them with very limited resources. For example, large amounts of data are quickly produced and stored at multiple locations. It becomes increasingly expensive to centralize them in a single place. Moreover, traditional DM algorithms generally have some problems and challenges, such as memory limits, low processing ability, and inadequate hard disk, and so on. To solve the above problems, DM on distributed computing environment [also called distributed data mining (DDM)] has been emerging as a valuable alternative in many applications. In this study, a survey of state-of-the-art DDM techniques is provided, including distributed frequent itemset mining, distributed frequent sequence mining, distributed frequent graph mining, distributed clustering, and privacy preserving of distributed data mining. We finally summarize the opportunities of data mining tasks in distributed environment. WIREs Data Mining Knowl Discov 2017, 7:e1216. doi: 10.1002/widm.1216 For further resources related to this article, please visit the . [ABSTRACT FROM AUTHOR]

Itemset mining is an important subfield of data mining, which consists of discovering interesting and useful patterns in transaction databases. The traditional task of frequent itemset mining is to discover groups of items (itemsets) that appear frequently together in transactions made by customers. Although itemset mining was designed for market basket analysis, it can be viewed more generally as the task of discovering groups of attribute values frequently cooccurring in databases. Because of its numerous applications in domains such as bioinformatics, text mining, product recommendation, e-learning, and web click stream analysis, itemset mining has become a popular research area. This study provides an up-to-date survey that can serve both as an introduction and as a guide to recent advances and opportunities in the field. The problem of frequent itemset mining and its applications are described. Moreover, main approaches and strategies to solve itemset mining problems are presented, as well as their characteristics are provided. Limitations of traditional frequent itemset mining approaches are also highlighted, and extensions of the task of itemset mining are presented such as high-utility itemset mining, rare itemset mining, fuzzy itemset mining, and uncertain itemset mining. This study also discusses research opportunities and the relationship to other popular pattern mining problems, such as sequential pattern mining, episode mining, subgraph mining, and association rule mining. Main open-source libraries of itemset mining implementations are also briefly presented. WIREs Data Mining Knowl Discov 2017, 7:e1207. doi: 10.1002/widm.1207 For further resources related to this article, please visit the . [ABSTRACT FROM AUTHOR]

The cover image, by Wensheng Gan et al., is based on the Overview Data mining in distributed environment: a survey, DOI: . [ABSTRACT FROM AUTHOR]