scholarly journals Prediction and optimization of sharing bikes queuing model in grid of Geohash coding

2020 ◽  
Vol 53 (7-8) ◽  
pp. 1250-1266
Author(s):  
Kui Yu ◽  
Changyue Qu
Keyword(s):  
Support Vector Machine ◽  
Human Mobility ◽  
Expectation Maximization Algorithm ◽  
Support Vector ◽  
Mobility Patterns ◽  
Queuing Model ◽  
Data Set ◽  
Queuing Models ◽  
Imbalance Problem ◽  
Bike Sharing

Dockless bike-sharing systems provide parking anywhere feature and environment-friendly approach for commuter. It is booming all over the world. Different from dockless bike-sharing systems, for example, previous studies focus on rental mode and docking stations planning. Yet, due to the fact that human mobility patterns of temporal and geographic lead to bike imbalance problem, we modeled human mobility patterns, predicted bike usage, and optimized management of the bike-sharing service. First, we proposed adaptive Geohash-grid clustering to classify bike flow patterns. For simplicity and rapid modeling, we defined three queuing models: over-demand, self-balance, and over-supply. Second, we improved adaptive Geohash-grid clustering-support vector machine algorithm to recognize self-balance pattern. Third, based on the result of adaptive Geohash-grid clustering-support vector machine, we proposed Markov state prediction model and Poisson mixture model expectation-maximization algorithm. Based on data set from Mobike and OFO, we conduct experiments to evaluate models. Results show that our models offer better prediction and optimization performance.

A Computational Method for the Identification of Endolysins and Autolysins

2020 ◽  
Vol 27 (4) ◽  
pp. 329-336 ◽  
Author(s):  
Lei Xu ◽  
Guangmin Liang ◽  
Baowen Chen ◽  
Xu Tan ◽  
Huaikun Xiang ◽  
...  
Keyword(s):  
Support Vector Machine ◽  
Cell Wall ◽  
Experimental Results ◽  
Computational Method ◽  
Lytic Enzyme ◽  
Support Vector ◽  
Lytic Enzymes ◽  
Data Set ◽  
Optimal Feature ◽  
Better Than

Background: Cell lytic enzyme is a kind of highly evolved protein, which can destroy the cell structure and kill the bacteria. Compared with antibiotics, cell lytic enzyme will not cause serious problem of drug resistance of pathogenic bacteria. Thus, the study of cell wall lytic enzymes aims at finding an efficient way for curing bacteria infectious. Compared with using antibiotics, the problem of drug resistance becomes more serious. Therefore, it is a good choice for curing bacterial infections by using cell lytic enzymes. Cell lytic enzyme includes endolysin and autolysin and the difference between them is the purpose of the break of cell wall. The identification of the type of cell lytic enzymes is meaningful for the study of cell wall enzymes. Objective: In this article, our motivation is to predict the type of cell lytic enzyme. Cell lytic enzyme is helpful for killing bacteria, so it is meaningful for study the type of cell lytic enzyme. However, it is time consuming to detect the type of cell lytic enzyme by experimental methods. Thus, an efficient computational method for the type of cell lytic enzyme prediction is proposed in our work. Method: We propose a computational method for the prediction of endolysin and autolysin. First, a data set containing 27 endolysins and 41 autolysins is built. Then the protein is represented by tripeptides composition. The features are selected with larger confidence degree. At last, the classifier is trained by the labeled vectors based on support vector machine. The learned classifier is used to predict the type of cell lytic enzyme. Results: Following the proposed method, the experimental results show that the overall accuracy can attain 97.06%, when 44 features are selected. Compared with Ding's method, our method improves the overall accuracy by nearly 4.5% ((97.06-92.9)/92.9%). The performance of our proposed method is stable, when the selected feature number is from 40 to 70. The overall accuracy of tripeptides optimal feature set is 94.12%, and the overall accuracy of Chou's amphiphilic PseAAC method is 76.2%. The experimental results also demonstrate that the overall accuracy is improved by nearly 18% when using the tripeptides optimal feature set. Conclusion: The paper proposed an efficient method for identifying endolysin and autolysin. In this paper, support vector machine is used to predict the type of cell lytic enzyme. The experimental results show that the overall accuracy of the proposed method is 94.12%, which is better than some existing methods. In conclusion, the selected 44 features can improve the overall accuracy for identification of the type of cell lytic enzyme. Support vector machine performs better than other classifiers when using the selected feature set on the benchmark data set.

scholarly journals Multi-phase classification by a least-squares support vector machine approach in tomography images of geological samples

Solid Earth ◽  
2016 ◽  
Vol 7 (2) ◽  
pp. 481-492 ◽  
Author(s):  
Faisal Khan ◽  
Frieder Enzmann ◽  
Michael Kersten
Keyword(s):  
Support Vector Machine ◽  
Least Squares ◽  
Image Data ◽  
Main Beam ◽  
Support Vector ◽  
Geological Samples ◽  
Data Set ◽  
Corrected Image ◽  
Phase Classification ◽  
Multi Phase

Abstract. Image processing of X-ray-computed polychromatic cone-beam micro-tomography (μXCT) data of geological samples mainly involves artefact reduction and phase segmentation. For the former, the main beam-hardening (BH) artefact is removed by applying a best-fit quadratic surface algorithm to a given image data set (reconstructed slice), which minimizes the BH offsets of the attenuation data points from that surface. A Matlab code for this approach is provided in the Appendix. The final BH-corrected image is extracted from the residual data or from the difference between the surface elevation values and the original grey-scale values. For the segmentation, we propose a novel least-squares support vector machine (LS-SVM, an algorithm for pixel-based multi-phase classification) approach. A receiver operating characteristic (ROC) analysis was performed on BH-corrected and uncorrected samples to show that BH correction is in fact an important prerequisite for accurate multi-phase classification. The combination of the two approaches was thus used to classify successfully three different more or less complex multi-phase rock core samples.

Predicting Students Grades Using Artificial Neural Networks and Support Vector Machine

2019 ◽  
pp. 751-766
Author(s):  
Sajid Umair ◽  
Muhammad Majid Sharif
Keyword(s):  
Neural Networks ◽  
Support Vector Machine ◽  
Artificial Neural Networks ◽  
Student Performance ◽  
Semantic Analysis ◽  
Vital Role ◽  
Support Vector ◽  
Data Set ◽  
Important Research Topic ◽  
Artificial Neural

Prediction of student performance on the basis of habits has been a very important research topic in academics. Studies show that selection of the correct data set also plays a vital role in these predictions. In this chapter, the authors took data from different schools that contains student habits and their comments, analyzed it using latent semantic analysis to get semantics, and then used support vector machine to classify the data into two classes, important for prediction and not important. Finally, they used artificial neural networks to predict the grades of students. Regression was also used to predict data coming from support vector machine, while giving only the important data for prediction.

scholarly journals Preliminary verification for application of a support vector machine-based cloud detection method to GOSAT-2 CAI-2

2018 ◽  
Vol 11 (5) ◽  
pp. 2863-2878 ◽  
Author(s):  
Yu Oishi ◽  
Haruma Ishida ◽  
Takashi Y. Nakajima ◽  
Ryosuke Nakamura ◽  
Tsuneo Matsunaga
Keyword(s):  
Support Vector Machine ◽  
Land Cover ◽  
Greenhouse Gases ◽  
Visual Inspection ◽  
Fiscal Year ◽  
Tropical Rainforests ◽  
Support Vector ◽  
Accuracy Evaluation ◽  
Data Set ◽  
Land Cover Types

Abstract. The Greenhouse Gases Observing Satellite (GOSAT) was launched in 2009 to measure global atmospheric CO2 and CH4 concentrations. GOSAT is equipped with two sensors: the Thermal And Near infrared Sensor for carbon Observations (TANSO)-Fourier transform spectrometer (FTS) and TANSO-Cloud and Aerosol Imager (CAI). The presence of clouds in the instantaneous field of view of the FTS leads to incorrect estimates of the concentrations. Thus, the FTS data suspected to have cloud contamination must be identified by a CAI cloud discrimination algorithm and rejected. Conversely, overestimating clouds reduces the amount of FTS data that can be used to estimate greenhouse gas concentrations. This is a serious problem in tropical rainforest regions, such as the Amazon, where the amount of useable FTS data is small because of cloud cover. Preparations are continuing for the launch of the GOSAT-2 in fiscal year 2018. To improve the accuracy of the estimates of greenhouse gases concentrations, we need to refine the existing CAI cloud discrimination algorithm: Cloud and Aerosol Unbiased Decision Intellectual Algorithm (CLAUDIA1). A new cloud discrimination algorithm using a support vector machine (CLAUDIA3) was developed and presented in another paper. Although the use of visual inspection of clouds as a standard for judging is not practical for screening a full satellite data set, it has the advantage of allowing for locally optimized thresholds, while CLAUDIA1 and -3 use common global thresholds. Thus, the accuracy of visual inspection is better than that of these algorithms in most regions, with the exception of snow- and ice-covered surfaces, where there is not enough spectral contrast to identify cloud. In other words, visual inspection results can be used as truth data for accuracy evaluation of CLAUDIA1 and -3. For this reason visual inspection can be used for the truth metric for the cloud discrimination verification exercise. In this study, we compared CLAUDIA1–CAI and CLAUDIA3–CAI for various land cover types, and evaluated the accuracy of CLAUDIA3–CAI by comparing both CLAUDIA1–CAI and CLAUDIA3–CAI with visual inspection (400  ×  400 pixels) of the same CAI images in tropical rainforests. Comparative results between CLAUDIA1–CAI and CLAUDIA3–CAI for various land cover types indicated that CLAUDIA3–CAI had a tendency to identify bright surface and optically thin clouds. However, CLAUDIA3–CAI had a tendency to misjudge the edges of clouds compared with CLAUDIA1–CAI. The accuracy of CLAUDIA3–CAI was approximately 89.5 % in tropical rainforests, which is greater than that of CLAUDIA1–CAI (85.9 %) for the test cases presented here.

scholarly journals Key Feature Recognition Algorithm of Network Intrusion Signal Based on Neural Network and Support Vector Machine

Symmetry ◽  
2019 ◽  
Vol 11 (3) ◽  
pp. 380 ◽  
Author(s):  
Kai Ye
Keyword(s):  
Neural Network ◽  
Support Vector Machine ◽  
Feature Recognition ◽  
False Positive Rate ◽  
Principal Component ◽  
Recognition Algorithm ◽  
Support Vector ◽  
Data Set ◽  
Network Intrusion ◽  
Key Features

When identifying the key features of the network intrusion signal based on the GA-RBF algorithm (using the genetic algorithm to optimize the radial basis) to identify the key features of the network intrusion signal, the pre-processing process of the network intrusion signal data is neglected, resulting in an increase in network signal data noise, reducing the accuracy of key feature recognition. Therefore, a key feature recognition algorithm for network intrusion signals based on neural network and support vector machine is proposed. The principal component neural network (PCNN) is used to extract the characteristics of the network intrusion signal and the support vector machine multi-classifier is constructed. The feature extraction result is input into the support vector machine classifier. Combined with PCNN and SVM (Support Vector Machine) algorithms, the key features of network intrusion signals are identified. The experimental results show that the algorithm has the advantages of high precision, low false positive rate and the recognition time of key features of R2L (it is a common way of network intrusion attack) data set is only 3.18 ms.

A Kind of Network Intrusion Detection Method Using Improved Support Vector Machine Based on Ant Colony Algorithm

2012 ◽  
Vol 263-266 ◽  
pp. 2995-2998
Author(s):  
Xiaoqin Zhang ◽  
Guo Jun Jia
Keyword(s):  
Genetic Algorithm ◽  
Support Vector Machine ◽  
Feature Extraction ◽  
Ant Colony Algorithm ◽  
Small Sample ◽  
Ant Colony ◽  
Support Vector ◽  
Algorithm Selection ◽  
Data Set ◽  
Network Intrusion

Support vector machine (SVM) is suitable for the classification problem which is of small sample, nonlinear, high dimension. SVM in data preprocessing phase, often use genetic algorithm for feature extraction, although it can improve the accuracy of classification. But in feature extraction stage the weak directivity of genetic algorithm impact the time and accuracy of the classification. The ant colony algorithm is used in genetic algorithm selection stage, which is better for the data pretreatment, so as to improve the classification speed and accuracy. The experiment in the KDD99 data set shows that this method is feasible.

Short-Term Wind Speed and Power Prediction Using Fuzzy Information Granulation-Support Vector Machine

2012 ◽  
Vol 608-609 ◽  
pp. 814-817
Author(s):  
Xiao Fu ◽  
Dong Xiang Jiang
Keyword(s):  
Support Vector Machine ◽  
Wind Speed ◽  
Wind Farm ◽  
Support Vector ◽  
Fuzzy Information ◽  
Short Term ◽  
Power Fluctuation ◽  
Data Set ◽  
Information Granulation ◽  
Fuzzy Information Granulation

The power fluctuation of wind turbine often causes serious problems in electricity grids. Therefore, short term prediction of wind speed and power as to eliminate the uncertainty determined crucially the development of wind energy. Compared with physical methods, support vector machine (SVM) as an intelligent artificial method is more general and shows better nonlinear modeling capacity. A model which combined fuzzy information granulation with SVM method was developed and implemented in short term future trend prediction of wind speed and power. The data, including the daily wind speed and power, from a wind farm in northern China were used to evaluate the proposed method. The prediction results show that the proposed model performs better and more stable than the standard SVM model when apply them into the same data set.

Artificial bee colony algorithm for feature selection and improved support vector machine for text classification

2019 ◽  
Vol 47 (3) ◽  
pp. 154-170
Author(s):  
Janani Balakumar ◽  
S. Vijayarani Mohan
Keyword(s):  
Support Vector Machine ◽  
Feature Selection ◽  
Text Classification ◽  
Support Vector ◽  
Data Sets ◽  
Selection Algorithm ◽  
Data Set ◽  
Content Type ◽  
Benchmark Data ◽  
Bee Colony

Purpose Owing to the huge volume of documents available on the internet, text classification becomes a necessary task to handle these documents. To achieve optimal text classification results, feature selection, an important stage, is used to curtail the dimensionality of text documents by choosing suitable features. The main purpose of this research work is to classify the personal computer documents based on their content. Design/methodology/approach This paper proposes a new algorithm for feature selection based on artificial bee colony (ABCFS) to enhance the text classification accuracy. The proposed algorithm (ABCFS) is scrutinized with the real and benchmark data sets, which is contrary to the other existing feature selection approaches such as information gain and χ2 statistic. To justify the efficiency of the proposed algorithm, the support vector machine (SVM) and improved SVM classifier are used in this paper. Findings The experiment was conducted on real and benchmark data sets. The real data set was collected in the form of documents that were stored in the personal computer, and the benchmark data set was collected from Reuters and 20 Newsgroups corpus. The results prove the performance of the proposed feature selection algorithm by enhancing the text document classification accuracy. Originality/value This paper proposes a new ABCFS algorithm for feature selection, evaluates the efficiency of the ABCFS algorithm and improves the support vector machine. In this paper, the ABCFS algorithm is used to select the features from text (unstructured) documents. Although, there is no text feature selection algorithm in the existing work, the ABCFS algorithm is used to select the data (structured) features. The proposed algorithm will classify the documents automatically based on their content.

A PRUNING APPROACH TO PATTERN DISCOVERY

2008 ◽  
Vol 07 (04) ◽  
pp. 721-736 ◽  
Author(s):  
HSIAO-FAN WANG ◽  
ZU-WEN CHAN
Keyword(s):  
Support Vector Machine ◽  
Pattern Discovery ◽  
Large Data ◽  
Support Vector ◽  
Large Database ◽  
Data Set ◽  
Learning Function ◽  
Large Data Set ◽  
Learning Functions ◽  
The Given

In this study, we proposed a general pruning procedure to reduce the dimension of a large database so that the properties of the extracted subset can be well defined. Since learning functions have been widely applied, we take this group of functions as an example to demonstrate the proposed procedure. Based on the concept of Support Vector Machine (SVM), three major stages of preliminary pruning, fitting function, and refining are proposed to discover a subset that possess the characteristics of some learning function from the given large data set. Three models were used to illustrate and evaluate the proposed pruning procedure and the results have shown to be promising in application.

Sign in / Sign up

Export Citation Format

Share Document