Search

In this paper, we develop a healthcare biclustering model in the field of healthcare to reduce the inconveniences linked to the data clustering on gene expression. The present study uses two separate healthcare biclustering approaches to identify specific gene activity in certain environments and remove the duplication of broad gene information components. Moreover, because of its adequacy in the problem where populations of potential solutions allow exploration of a greater portion of the research area, machine learning or heuristic algorithm has become extensively used for healthcare biclustering in the field of healthcare. The study is evaluated in terms of average match score for nonoverlapping modules, overlapping modules through the influence of noise for constant bicluster and additive bicluster, and the run time. The results show that proposed FCM blustering method has higher average match score, and reduced run time proposed FCM than the existing PSO-SA and fuzzy logic healthcare biclustering methods. [ABSTRACT FROM AUTHOR]

k nearest neighbor (k NN) is a simple and widely used classifier; it can achieve comparable performance with more complex classifiers including decision tree and artificial neural network. Therefore, k NN has been listed as one of the top 10 algorithms in machine learning and data mining. On the other hand, in many classification problems, such as medical diagnosis and intrusion detection, the collected training sets are usually class imbalanced. In class imbalanced data, although positive examples are heavily outnumbered by negative ones, positive examples usually carry more meaningful information and are more important than negative examples. Similar to other classical classifiers, k NN is also proposed under the assumption that the training set has approximately balanced class distribution, leading to its unsatisfactory performance on imbalanced data. In addition, under a class imbalanced scenario, the global resampling strategies that are suitable to decision tree and artificial neural network often do not work well for k NN, which is a local information-oriented classifier. To solve this problem, researchers have conducted many works for k NN over the past decade. This paper presents a comprehensive survey of these works according to their different perspectives and analyzes and compares their characteristics. At last, several future directions are pointed out. [ABSTRACT FROM AUTHOR]

The special text has a lot of features, such as professional words, abbreviations, large datasets, different themes, and uneven distribution of labels. While the existing text data mining classification methods use simple machine learning models, it has a bad performance on text classification. To solve this drawback, a text data mining algorithm based on convolutional neural network (CNN) model and deep Boltzmann machines (DBM) model is proposed in this paper. This method combines the CNN and DBM models with good feature extraction to realize the double feature extraction. It can realize the tag tree by constructing the tag tree and design the effective hierarchical network to achieve classification. At the same time, the model can suppress the input noise on the classification. Experimental results show that the improved algorithm achieves good classification results in special text data mining. [ABSTRACT FROM AUTHOR]

With the development of technologies in various fields, more and more technologies have been applied to safety clothing, which has led to the rapid development of safety clothing. The improvement of living standards is accompanied by the change of consumption concepts. Consumers' requirements for clothing products have become more artistic, healthier, and more ecological, and they look forward to more and better safety clothing to meet their health needs. In this context, this article studies traffic safety outdoor clothing design based on big data (BD) and AI. This article introduces the design method of outdoor safety clothing for traffic based on BD and machine learning in artificial intelligence (AI) and did two experiments. To this end, this paper adopts a Deep Belief Network (DBN), which is trained layer by layer through Restricted Boltzmann Machine (RBM), and successfully solves the problems of lack of a large number of labeled samples and easy to fall into local optimum. The first experiment is to test the accuracy of various machine learning algorithms for clothing size measurement. The results obtained are as follows: the predicted value of the DBN neural network is the closest to the actual value, the average prediction accuracy of DBN for the cuff size is 90%, and the average prediction accuracy for the neck circumference is 91.5%. The second experiment is to investigate the functional needs and performance concerns of children and outdoor workers. The results of the experiment are as follows: for children, 79.9% of people want clothing to have a positioning function, which accounts for the highest proportion. For outdoor workers, the most important clothing function they need is eye-catching style, and 90.1% of those choose this option. In terms of clothing performance concerns, most people choose to care very much, and the second most people choose to care about comfort., Author(s): Ya Zhou (corresponding author) [1]; Yun Shi [1] 1. Introduction 1.1. Background With safety as the main purpose, emphasizing a healthy, comfortable, green, and environmentally friendly living environment is [...]

With the rapid development of the Internet and the rapid development of big data analysis technology, data mining has played a positive role in promoting industry and academia. Classification is an important problem in data mining. This paper explores the background and theory of support vector machines (SVM) in data mining classification algorithms and analyzes and summarizes the research status of various improved methods of SVM. According to the scale and characteristics of the data, different solution spaces are selected, and the solution of the dual problem is transformed into the classification surface of the original space to improve the algorithm speed. Research Process. Incorporating fuzzy membership into multicore learning, it is found that the time complexity of the original problem is determined by the dimension, and the time complexity of the dual problem is determined by the quantity, and the dimension and quantity constitute the scale of the data, so it can be based on the scale of the data Features Choose different solution spaces. The algorithm speed can be improved by transforming the solution of the dual problem into the classification surface of the original space. Conclusion. By improving the calculation rate of traditional machine learning algorithms, it is concluded that the accuracy of the fitting prediction between the predicted data and the actual value is as high as 98%, which can make the traditional machine learning algorithm meet the requirements of the big data era. It can be widely used in the context of big data. [ABSTRACT FROM AUTHOR]

Fast road emergency response can minimize the losses caused by traffic accidents. However, emergency rescue on urban arterial roads is faced with the high probability of congestion caused by accidents, which makes the planning of rescue path complicated. This paper proposes a refined path planning method for emergency rescue vehicles on congested urban arterial roads during traffic accidents. Firstly, a rescue path planning environment for emergency vehicles on congested urban arterial roads based on the Markov decision process is established, which focuses on the architecture of arterial roads, taking the traffic efficiency and vehicle queue length into consideration of path planning; then, the prioritized experience replay deep Q-network (PERDQN) reinforcement learning algorithm is used for path planning under different traffic control schemes. The proposed method is tested on the section of East Youyi Road in Xi'an, Shaanxi Province, China. The results show that compared with the traditional shortest path method, the rescue route planned by PERDQN reduces the arrival time to the accident site by 67.1%, and the queue length at upstream of the accident point is shortened by 16.3%, which shows that the proposed method is capable to plan the rescue path for emergency vehicles in urban arterial roads with congestion, shorten the arrival time, and reduce the vehicle queue length caused by accidents., Author(s): Longhao Yan [1]; Ping Wang (corresponding author) [1]; Jingwen Yang [1]; Yu Hu [1]; Yu Han [2,3]; Junfeng Yao [4,5] 1. Introduction Urban arterial roads are important components of [...]

It is commonly believed that diversity is crucial for an evolutionary system to succeed, especially when the problem to be solved contains local optima from which the population cannot easily escape. There exist numerous methods to measure population diversity, but none of these have been shown to be consistently useful. In this paper, a new diversity measure is introduced, and it is shown that high diversity according to this new measure generally leads to a more successful overall evolution in most of the cases considered. [ABSTRACT FROM AUTHOR]

Short-term traffic prediction is a key component of Intelligent Transportation Systems. It uses historical data to construct models for reliably predicting traffic state at specific locations in road networks in the near future. Despite being a mature field, short-term traffic prediction still poses some open problems related to the choice of optimal data resolution, prediction of nonrecurring congestion, and the modelling of relevant spatiotemporal dependencies. As a step towards addressing these problems, this paper investigates the ability of Artificial Neural Networks, Random Forests, and Support Vector Regression algorithms to reliably model traffic flow at different data resolutions and respond to unexpected traffic incidents. We also explore different feature selection methods to identify and better understand the spatiotemporal attributes that most influence the reliability of these models. Experimental results indicate that data aggregation does not necessarily achieve good performance for multivariate spatiotemporal machine learning models. The models learned using high-resolution 30-second input data outperformed the corresponding baseline ARIMA models by 8%. Furthermore, feature selection based on Recursive Feature Elimination resulted in models that outperformed those based on linear correlation-based feature selection., 1. Introduction Traffic congestion results in significant monetary losses in countries around the world, with the cost of traffic congestion in 2014 estimated to be $160 billion in the US [...]

The recent trend for vehicles to be connected to unspecified devices, vehicles, and infrastructure increases the potential for external threats to vehicle cybersecurity. Thus, intrusion detection is a key network security function in vehicles with open connectivity, such as self-driving and connected cars. Specifically, when a vehicle is connected to an external device through a smartphone inside the vehicle or when a vehicle communicates with external infrastructure, security technology is required to protect the software network inside the vehicle. Existing technology with this function includes vehicle gateways and intrusion detection systems. However, it is difficult to block malicious code based on application behaviors. In this study, we propose a machine learning-based data analysis method to accurately detect abnormal behaviors due to malware in large-scale network traffic in real time. First, we define a detection architecture, which is required by the intrusion detection module to detect and block malware attempting to affect the vehicle via a smartphone. Then, we propose an efficient algorithm for detecting malicious behaviors in a network environment and conduct experiments to verify algorithm accuracy and cost through comparisons with other algorithms., 1. Introduction As automobiles become more intelligent, so do transportation systems [1]. New business requirements in the automotive market and advances in automotive communication technology are increasing the connectivity of [...]

Professional auditors provide audit services to businesses and they are key participants in enterprise development. Effective identification of audit risks can help auditors plan their audit work rationally and issue correct audit opinions. In the era of big data and the Internet, enterprises generate a large amount of data in their daily operations. For auditors, it is a great challenge to use data mining algorithms, machine learning, artificial intelligence, and other emerging technologies to identify high-quality audit data from the vast amount of data of audited enterprises. At the same time, some companies may falsify and modify their financial statements for their own benefit, which further increases the difficulty for auditors in conducting audits. Traditional auditing methods are costly and consuming and cannot meet standard auditing requirements. Therefore, this study applies computer data mining algorithms to construct an audit risk model that provides a reference for auditors to conduct big data analysis and mines valuable data, thereby improving the efficiency and accuracy of the audit process. [ABSTRACT FROM AUTHOR]

To gain a more comprehensive and systematic understanding of the impact of government assistance to poor households on poverty reduction targets, a targeted poverty alleviation information statistics and analysis integrated with big data mining algorithm is proposed. Combined with the big data knowledge of the new era, according to the machine learning (ML) pipeline module in spark, a big data computing framework, combined with known data mining algorithms, massive sample data are used to replace random stratified sampling data for modeling and analysis, and random forest model, logistic model, and newly proposed waterfall model are constructed for poor households. Finally, through the comparative evaluation of several poor household identification models, the results show that when 100 real data test the accuracy of the three poor household models, the random forest model and logistic model are slightly reduced, which are 82% and 72%, respectively, but the waterfall model is basically unchanged, which is 83%, and the three models have little change. The new waterfall design proposed in this article has the advantage of a high percentage of sample reuse and can effectively prevent overfitting, and there is no need for massive data. It is a stable and reliable new model. The combination of targeted poverty reduction algorithms and big information technology and mining data can get the most common causes more accurate and convincing results. The right rib trunk and rib are often separated from the common cause because of the population. [ABSTRACT FROM AUTHOR]

In this study, we developed the solution of roadside LiDAR object detection using a combination of two unsupervised learning algorithms. The 3D point clouds are firstly converted into spherical coordinates and filled into the elevation-azimuth matrix using a hash function. After that, the raw LiDAR data were rearranged into the new data structure to store the information of range, azimuth, and intensity. Then, the dynamic mode decomposition method is applied to decompose the LiDAR data into low-rank backgrounds and sparse foregrounds based on intensity channel pattern recognition. The coarse-fine triangle algorithm (CFTA) automatically finds the dividing value to separate the moving targets from static background according to range information. After intensity and range background subtraction, the foreground moving objects will be detected using a density-based detector and encoded into the state-space model for tracking. The output of the proposed solution includes vehicle trajectories that can enable many mobility and safety applications. The method was validated at both path and point levels and outperformed the state of the art. In contrast to the previous methods that process directly on the scattered and discrete point clouds, the dynamic classification method can establish the less sophisticated linear relationship of the 3D measurement data, which captures the spatial-temporal structure that we often desire., Author(s): Tianya Zhang (corresponding author) [1]; Peter J. Jin (corresponding author) [1] 1. Introduction Light detection and ranging (LiDAR) is a high-precision sensor that uses a laser transmitter and receiver [...]

Commuting pattern is one of the most important travel patterns on the road network; the analysis of commuting pattern can provide support for public transport system optimization, policy formulation, and urban planning. In this study, a framework of the key commuting route mining algorithm based on license plate recognition (LPR) data is proposed. And the proposed algorithm framework can be migrated to any similar spatiotemporal data, such as GPS trajectory data. Commuting pattern vehicles are first extracted, and then, the spatiotemporal trip chains of all commuting pattern vehicles are mined. Based on the spatiotemporal trip chains, the spatiotemporal similarity matrix is constructed by dynamic time warping (DTW) algorithm. Finally, the characteristics of commuting pattern are analysed by the density-based spatial clustering of applications with noise (DBSCAN) algorithm. Different from other researches that analyse the commuting pattern using machine learning algorithms based on all data, this study first extracts commuting pattern vehicles and then designs a key commuting route mining algorithm framework for commuting pattern vehicles. Taking Hangzhou as an example, through the framework of mining algorithm proposed in this study, the commuting pattern characteristics and key commuting routes in Hangzhou have been successfully excavated, and policy suggestions based on the analysis results have also been put forward., Author(s): Wenbin Yao [1]; Caijun Chen [2]; Hongyang Su [1]; Nuo Chen [1]; Sheng Jin (corresponding author) [1,3]; Congcong Bai [1] 1. Introduction With the increasing number of motor vehicles, [...]

The identification of discriminative features from information-rich data with the goal of clinical diagnosis is crucial in the field of biomedical science. In this context, many machine-learning techniques have been widely applied and achieved remarkable results. However, disease, especially cancer, is often caused by a group of features with complex interactions. Unlike traditional feature selection methods, which only focused on finding single discriminative features, a multilayer feature subset selection method (MLFSSM), which employs randomized search and multilayer structure to select a discriminative subset, is proposed herein. In each level of this method, many feature subsets are generated to assure the diversity of the combinations, and the weights of features are evaluated on the performances of the subsets. The weight of a feature would increase if the feature is selected into more subsets with better performances compared with other features on the current layer. In this manner, the values of feature weights are revised layer-by-layer; the precision of feature weights is constantly improved; and better subsets are repeatedly constructed by the features with higher weights. Finally, the topmost feature subset of the last layer is returned. The experimental results based on five public gene datasets showed that the subsets selected by MLFSSM were more discriminative than the results by traditional feature methods including LVW (a feature subset method used the Las Vegas method for randomized search strategy), GAANN (a feature subset selection method based genetic algorithm (GA)), and support vector machine recursive feature elimination (SVM-RFE). Furthermore, MLFSSM showed higher classification performance than some state-of-the-art methods which selected feature pairs or groups, including top scoring pair (TSP), k-top scoring pairs (K-TSP), and relative simplicity-based direct classifier (RS-DC). [ABSTRACT FROM AUTHOR]