Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

1,067 articles for “random”
Set a search alert
Also matching:1 special issue
Research ArticleOpen accessEvery word in the titleNamed Entity Recognition for Kannada using Gazetteers list with Conditional Random FieldsK. P. Pallavi, L. Sobha, M. M. RamyaNamed Entities (NEs) that exist in the sentences are essential to build Natural Language Processing (NLP) applications for Information Extraction (IE) from large corpora. However, generating a large corpus is challenging for resource poor languages, such as Kannada. Further, there is no annotated corpus available online. The challenges faced in annotating NEs with pre-defined classes are: It is morphologically joined … …Journal of Computer Science, Vol. 14, Issue 5 · 24 Feb 2018 · 8,275 accessesView PDFCite
Research ArticleOpen accessEvery word in the titlePrediction Intervals for Future Observations Based on Samples of Random SizesMohammad Z. Raqab, Haroon M. BarakatOn the basis of failure times of an informative sample (X-sample) of random size M of iid continuous random variables, we consider the prediction problem of failure times of another independent future sample (Y-sample) of random size N of iid variables from the same distribution. In this paper, we derive various exact prediction intervals for future failure times from the … …Journal of Mathematics and Statistics, Vol. 14, Issue 1 · 2 Jan 2018 · 7,902 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleLocal Large Deviations: A McMillian Theorem for Typed Random Graph ProcessesKwabena Doku-AmponsahFor a finite typed graph on n nodes and with type law µ on finite alphabet Γ, we define the spectral potential ρλ(., µ), of the graph. From the ρλ(., µ) we define the Kullback action or the divergence function, Hλ(π || v), with respect to an empirical link measure, π, as the Legendre dual. For the finite typed random … …Journal of Mathematics and Statistics, Vol. 13, Issue 4 · 29 Nov 2017 · 7,114 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Flexible, Real-Time Algorithm for Simulating Correlated Random Fields and Its PropertiesMichael A. Kouritzin, Fraser Newton, Biao WuContemporary real-time problems like CAPTCHA generation and optical character recognition can be solved effectively using correlated random fields. These random fields should be produced on a graph in order that problems of any dimension and shape can be handled. However, traditional solutions are often too slow, inaccurate or both. Herein, the Quick Simulation Random Field algorithm to produce correlated random … …Journal of Mathematics and Statistics, Vol. 13, Issue 3 · 29 Sep 2017 · 7,069 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Systematic Procedure for Square Random Lattice SamplingGirish Chandra, Neeraj TiwariAn attempt has been made in this paper to improve the method 'Square Random Lattice Sampling' by suggesting a systematic procedure for achieving the goals under controls beyond stratification. The estimator of mean and its variance are calculated. Results shows that the relative precision of the proposed procedure increases as size of the latin square and the number of latin … …Journal of Mathematics and Statistics, Vol. 13, Issue 3 · 20 Jul 2017 · 6,962 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleRandom Forest Classification and Support Vector Machine for Detecting Epilepsyusing Electroencephalograph RecordsHeri Kuswanto, Mutiah Salamah, Muhammad Idrus FachruddinComplexity in data structure has led to the rapid development of computational statistics methods. Machine learning approaches have been introduced and applied to solve complex problems in many fields. This paper applies two common machine learning approaches, Random Forest (RF) and Support Vector Machine (SVM), in the detection of epilepsy. The diagnosis of epilepsy can usually only be made when … …American Journal of Applied Sciences, Vol. 14, Issue 5 · 4 May 2017 · 8,134 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleProbabilistic Estimates of the Largest Strictly Convex Singular Values of Pregaussian Random MatricesYang LiuIn this study, the p-singular values of random matrices with Gaussian entries defined in terms of the lp-p-norm for p>1, as is studied. Mainly, using analytical techniques, we show the probabilistic estimate, precisely, the decay, on the upper tail probability of the largest strictly convex singular values, when the number of rows of the matrices becomes very large and the … …Journal of Mathematics and Statistics, Vol. 11, Issue 1 · 6 May 2015 · 6,887 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleCHARACTERIZATION OF MARKOV-BERNOULLI GEOMETRIC DISTRIBUTION RELATED TO RANDOM SUMSMohamed Gharib, Mahmoud M. Ramadan, Khaled A.H. Al-AjmiThe Markov-Bernoulli geometric distribution is obtained when a generalization, as a Markov process, of the independent Bernoulli sequence of random variables is introduced by considering the success probability changes with respect to the Markov chain. The resulting model is called the Markov- Bernoulli model and it has a wide variety of application fields. In this study, some characterizations are given … …Journal of Mathematics and Statistics, Vol. 10, Issue 2 · 31 Mar 2014 · 6,706 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleDENIAL OF SERVICE ATTACK IN DISTRIBUTED WIRELESS NETWORK BY DISTRIBUTED JAMMER NETWORK: A BIRTH-DEATH RANDOM PROCESS ANALYSISR. Dhanasekaran, G. SingaravelLarge number of low power, tiny radio jammers are constituting a Distributed Jammer Network (DJN) is used nowadays to cause a Denial of Service (DoS) attack on a Distributed Wireless Network (DWN). Using NANO technologies, it is possible to build huge number of tiny jammers in millions, if not more. The Denial of Service (DoS) attacks in Distributed Wireless Network … …Journal of Computer Science, Vol. 10, Issue 8 · 7 Mar 2014 · 6,802 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleThe use of Random Forest Classification and K-means Clustering Algorithm for Detecting Time Stamped Signatures in the Active NetworksKamalanaban Ethala, R. Shesadri, N. G. RenganathanIn day to day information security infrastructure, intrusion detection is indispensible. Signature based intrusion detection system mechanisms are often available in detecting many types of attacks. But this mechanism alone is not sufficient in many cases. Another intrusion detection method viz K-means is employed for clustering and classifying the unlabelled data. IDS is a special embedded device or relied software … …Journal of Computer Science, Vol. 9, Issue 7 · 18 Jun 2013 · 7,496 accessesView PDFCite