Development of Two Highly-Efficient and Innovative Inspection Schemes for PSC Inspection

2021 ◽  
Vol 38 (03) ◽  
pp. 2040013
Author(s):  
Ran Yan ◽  
Dan Zhuge ◽  
Shuaian Wang
Keyword(s):  
Association Rules ◽  
Numerical Experiments ◽  
State Control ◽  
Occurrence Probability ◽  
Data Set ◽  
Inspection Cost ◽  
High Efficient ◽  
Critical Challenge ◽  
Better Than ◽  
Inspection Schemes

Port state control (PSC) inspection contributes a lot to improving maritime safety and protecting the marine environment. After selecting the ships coming to a port for inspection, one critical challenge faced by the PSC authorities is deciding what deficiency items should be inspected and what the inspection sequence of these items is. To address this problem, two innovative and high-efficient PSC inspection schemes describing specific PSC inspection items and sequence are proposed for the inspectors’ reference when time and resources are limited, especially when there are difficulties in estimating the possible deficiencies in advance. Both schemes take the occurrence probability, inspection cost, and ignoring loss of each deficiency item into account. More specifically, the first inspection scheme is based on the occurrence probabilities of the deficiency items in the whole data set, while the second scheme further considers the correlations among the deficiency items extracted by association rules. The results of numerical experiments show that the efficiency of the two proposed inspection schemes is 1.5 times higher than that of the currently used inspection scheme. In addition, the second inspection scheme performs better than the first inspection scheme, especially with inspecting ships with no less than five deficiency items and limited inspection resources.

Evaluation for estimating of the PDF and the CDF of Generalized Inverted Exponential Distribution with Application in Industry

2020 ◽  
pp. 507-522
Author(s):  
Parisa Torkaman
Keyword(s):  
Least Squares ◽  
Exponential Distribution ◽  
Mean Squared Error ◽  
Weighted Least Squares ◽  
Real Data ◽  
Minimum Variance ◽  
Cumulative Distribution ◽  
Estimation Methods ◽  
Data Set ◽  
Better Than

The generalized inverted exponential distribution is introduced as a lifetime model with good statistical properties. This paper, the estimation of the probability density function and the cumulative distribution function of with five different estimation methods: uniformly minimum variance unbiased(UMVU), maximum likelihood(ML), least squares(LS), weighted least squares (WLS) and percentile(PC) estimators are considered. The performance of these estimation procedures, based on the mean squared error (MSE) by numerical simulations are compared. Simulation studies express that the UMVU estimator performs better than others and when the sample size is large enough the ML and UMVU estimators are almost equivalent and efficient than LS, WLS and PC. Finally, the result using a real data set are analyzed.

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.

Applying Artificial Neural Networks. I. Estimating Nicotine in Tobacco from near Infrared Data

1995 ◽  
Vol 3 (3) ◽  
pp. 133-142 ◽  
Author(s):  
M. Hana ◽  
W.F. McClure ◽  
T.B. Whitaker ◽  
M. White ◽  
D.R. Bahler
Keyword(s):  
Linear Regression ◽  
Regression Model ◽  
Linear Regression Model ◽  
Near Infrared ◽  
Back Propagation ◽  
Linear Network ◽  
Data Set ◽  
Input Layer ◽  
Propagation Network ◽  
Better Than

Two artificial neural network models were used to estimate the nicotine in tobacco: (i) a back-propagation network and (ii) a linear network. The back-propagation network consisted of an input layer, an output layer and one hidden layer. The linear network consisted of an input layer and an output layer. Both networks used the generalised delta rule for learning. Performances of both networks were compared to the multiple linear regression method MLR of calibration. The nicotine content in tobacco samples was estimated for two different data sets. Data set A contained 110 near infrared (NIR) spectra each consisting of reflected energy at eight wavelengths. Data set B consisted of 200 NIR spectra with each spectrum having 840 spectral data points. The Fast Fourier transformation was applied to data set B in order to compress each spectrum into 13 Fourier coefficients. For data set A, the linear regression model gave better results followed by the back-propagation network which was followed by the linear network. The true performance of the linear regression model was better than the back-propagation and the linear networks by 14.0% and 18.1%, respectively. For data set B, the back-propagation network gave the best result followed by MLR and the linear network. Both the linear network and MLR models gave almost the same results. The true performance of the back-propagation network model was better than the MLR and linear network by 35.14%.

scholarly journals Fast effect size shrinkage software for beta-binomial models of allelic imbalance

F1000Research ◽  
2020 ◽  
Vol 8 ◽  
pp. 2024
Author(s):  
Joshua P. Zitovsky ◽  
Michael I. Love
Keyword(s):  
Allelic Imbalance ◽  
Real Data ◽  
Shrinkage Estimators ◽  
Data Set ◽  
Bayesian Shrinkage ◽  
In Cis ◽  
Posterior Estimation ◽  
Binomial Models ◽  
Better Than ◽  
Diploid Organism

Allelic imbalance occurs when the two alleles of a gene are differentially expressed within a diploid organism and can indicate important differences in cis-regulation and epigenetic state across the two chromosomes. Because of this, the ability to accurately quantify the proportion at which each allele of a gene is expressed is of great interest to researchers. This becomes challenging in the presence of small read counts and/or sample sizes, which can cause estimators for allelic expression proportions to have high variance. Investigators have traditionally dealt with this problem by filtering out genes with small counts and samples. However, this may inadvertently remove important genes that have truly large allelic imbalances. Another option is to use pseudocounts or Bayesian estimators to reduce the variance. To this end, we evaluated the accuracy of four different estimators, the latter two of which are Bayesian shrinkage estimators: maximum likelihood, adding a pseudocount to each allele, approximate posterior estimation of GLM coefficients (apeglm) and adaptive shrinkage (ash). We also wrote C++ code to quickly calculate ML and apeglm estimates and integrated it into the apeglm package. The four methods were evaluated on two simulations and one real data set. Apeglm consistently performed better than ML according to a variety of criteria, and generally outperformed use of pseudocounts as well. Ash also performed better than ML in one of the simulations, but in the other performance was more mixed. Finally, when compared to five other packages that also fit beta-binomial models, the apeglm package was substantially faster and more numerically reliable, making our package useful for quick and reliable analyses of allelic imbalance. Apeglm is available as an R/Bioconductor package at http://bioconductor.org/packages/apeglm.

scholarly journals Extreme Learning Machine with sigmoid activation function on large data

2019 ◽  
Vol 8 (2S11) ◽  
pp. 3523-3526
Keyword(s):  
Efficient Algorithm ◽  
Large Data ◽  
Activation Function ◽  
Large Data Sets ◽  
Data Sets ◽  
Data Set ◽  
Learning Machine ◽  
Sigmoid Activation Function ◽  
State Of Art ◽  
Better Than

This paper describes an efficient algorithm for classification in large data set. While many algorithms exist for classification, they are not suitable for larger contents and different data sets. For working with large data sets various ELM algorithms are available in literature. However the existing algorithms using fixed activation function and it may lead deficiency in working with large data. In this paper, we proposed novel ELM comply with sigmoid activation function. The experimental evaluations demonstrate the our ELM-S algorithm is performing better than ELM,SVM and other state of art algorithms on large data sets.

A Novel Network Traffic Anomaly Detection Based on Multi-Scale Fusion

2011 ◽  
Vol 48-49 ◽  
pp. 102-105
Author(s):  
Guo Zhen Cheng ◽  
Dong Nian Cheng ◽  
He Lei
Keyword(s):  
Anomaly Detection ◽  
False Alarm ◽  
False Alarm Rate ◽  
Network Traffic ◽  
Self Similarity ◽  
Data Set ◽  
Multi Scale ◽  
Traffic Anomaly ◽  
Detection Evaluation ◽  
Better Than

Detecting network traffic anomaly is very important for network security. But it has high false alarm rate, low detect rate and that can’t perform real-time detection in the backbone very well due to its nonlinearity, nonstationarity and self-similarity. Therefore we propose a novel detection method—EMD-DS, and prove that it can reduce mean error rate of anomaly detection efficiently after EMD. On the KDD CUP 1999 intrusion detection evaluation data set, this detector detects 85.1% attacks at low false alarm rate which is better than some other systems.

Modifying Transactional Databases to Hide Sensitive Association Rules

2021 ◽  
Author(s):  
Syam Menon ◽  
Abhijeet Ghoshal ◽  
Sumit Sarkar
Keyword(s):  
Supply Chain ◽  
Association Rules ◽  
Association Rule ◽  
Sensitive Information ◽  
Data Set ◽  
Problem Reduction ◽  
Transactional Databases ◽  
Potential Risks ◽  
Integer Formulations ◽  
Number Of Firms

Although firms recognize the value in sharing data with supply chain partners, many remain reluctant to share for fear of sensitive information potentially making its way to competitors. Approaches that can help hide sensitive information could alleviate such concerns and increase the number of firms that are willing to share. Sensitive information in transactional databases often manifests itself in the form of association rules. The sensitive association rules can be concealed by altering transactions so that they remain hidden when the data are mined by the partner. The problem of hiding these rules in the data are computationally difficult (NP-hard), and extant approaches are all heuristic in nature. To our knowledge, this is the first paper that introduces the problem as a nonlinear integer formulation to hide the sensitive association rule while minimizing the alterations needed in the data set. We apply transformations that linearize the constraints and derive various results that help reduce the size of the problem to be solved. Our results show that although the nonlinear integer formulations are not practical, the linearizations and problem-reduction steps make a significant impact on solvability and solution time. This approach mitigates potential risks associated with sharing and should increase data sharing among supply chain partners.

Finding Persistent Strong Rules

2010 ◽  
pp. 85-107
Author(s):  
Anthony Scime ◽  
Karthik Rajasethupathy ◽  
Kulathur S. Rajasethupathy ◽  
Gregg R. Murray
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Strong Association ◽  
National Election ◽  
Data Sets ◽  
Rule Discovery ◽  
Discovery Process ◽  
Data Set ◽  
Rule Sets ◽  
Election Studies

Data mining is a collection of algorithms for finding interesting and unknown patterns or rules in data. However, different algorithms can result in different rules from the same data. The process presented here exploits these differences to find particularly robust, consistent, and noteworthy rules among much larger potential rule sets. More specifically, this research focuses on using association rules and classification mining to select the persistently strong association rules. Persistently strong association rules are association rules that are verifiable by classification mining the same data set. The process for finding persistent strong rules was executed against two data sets obtained from the American National Election Studies. Analysis of the first data set resulted in one persistent strong rule and one persistent rule, while analysis of the second data set resulted in 11 persistent strong rules and 10 persistent rules. The persistent strong rule discovery process suggests these rules are the most robust, consistent, and noteworthy among the much larger potential rule sets.

A Novel Evolutionary Biclustering Approach using MapReduce(EBC-MR)

2016 ◽  
Vol 6 (1) ◽  
pp. 26-36 ◽  
Author(s):  
Rathipriya R.
Keyword(s):  
Genetic Algorithm ◽  
Expression Data ◽  
Correlation Measure ◽  
Web Data ◽  
Mapreduce Framework ◽  
Average Correlation ◽  
Data Set ◽  
Cluster Data ◽  
Value Measure ◽  
Better Than

A novel biclustering approach is proposed in this paper, which can be used to cluster data (like web data, gene expression data) into local pattern using MapReduce framework. The proposed biclustering approach extracts the highly coherent bicluster using a correlation measure called Average Correlation Value measure. Furthermore, MapReduce based genetic algorithm is firstly used to the biclustering of web data. This method can avoid local convergence in the optimization algorithms mostly. The MSWeb dataset and MSNBC web usage data set are used to test the performance of new MapReduce based Evolutionary biclustering algorithm. The experimental study is carried out for comparison of proposed algorithm with traditional genetic algorithm in biclustering. The results reveal that novel proposed approach preforms better than existing evolutionary biclustering approach.

Sign in / Sign up

Export Citation Format

Share Document