Hashing technology has the advantages of reducing data storage and improving the efficiency of the learning system,making it more and more widely used in image retrieval.Multi-view data describes image information mor...Hashing technology has the advantages of reducing data storage and improving the efficiency of the learning system,making it more and more widely used in image retrieval.Multi-view data describes image information more comprehensively than traditional methods using a single-view.How to use hashing to combine multi-view data for image retrieval is still a challenge.In this paper,a multi-view fusion hashing method based on RKCCA(Random Kernel Canonical Correlation Analysis)is proposed.In order to describe image content more accurately,we use deep learning dense convolutional network feature DenseNet to construct multi-view by combining GIST feature or BoW_SIFT(Bag-of-Words model+SIFT feature)feature.This algorithm uses RKCCA method to fuse multi-view features to construct association features and apply them to image retrieval.The algorithm generates binary hash code with minimal distortion error by designing quantization regularization terms.A large number of experiments on benchmark datasets show that this method is superior to other multi-view hashing methods.展开更多
This paper introduces some concepts such as q- process in random environment, Laplace transformation, ergodic potential kernel, error function and some basic lemmas.We study the continuity and Laplace transformation o...This paper introduces some concepts such as q- process in random environment, Laplace transformation, ergodic potential kernel, error function and some basic lemmas.We study the continuity and Laplace transformation of random transition function. Finally, we give the sufficient condition for the existence of ergodic potential kernel for homogeneous q- processes in random environments.展开更多
We primarily provide several estimates for the heat kernel defined on the 2-dimensional simple random walk. Additionally, we offer an estimate for the heat kernel on high-dimensional random walks, demonstrating that t...We primarily provide several estimates for the heat kernel defined on the 2-dimensional simple random walk. Additionally, we offer an estimate for the heat kernel on high-dimensional random walks, demonstrating that the heat kernel in higher dimensions converges rapidly. We also compute the constants involved in the estimate for the 1-dimensional heat kernel. Furthermore, we discuss the general case of on-diagonal estimates for the heat kernel.展开更多
In this paper,Edgeworth expansion for the nearest neighbor\|kernel estimate and random weighting approximation of conditional density are given and the consistency and convergence rate are proved.
In Section 1, the authors establish the models of two kinds of Markov chains in space-time random environments (MCSTRE and MCSTRE(+)) with abstract state space. In Section 2, the authors construct a MCSTRE and a MCSTR...In Section 1, the authors establish the models of two kinds of Markov chains in space-time random environments (MCSTRE and MCSTRE(+)) with abstract state space. In Section 2, the authors construct a MCSTRE and a MCSTRE(+) by an initial distribution Φ and a random Markov kernel (RMK) p(γ). In Section 3, the authors es-tablish several equivalence theorems on MCSTRE and MCSTRE(+). Finally, the authors give two very important examples of MCMSTRE, the random walk in spce-time random environment and the Markov br...展开更多
The success of any Intrusion Detection System (IDS) is a complicated problem due to its nonlinearity and the quantitative or qualitative network traffic data stream with many features. To get rid of this problem, seve...The success of any Intrusion Detection System (IDS) is a complicated problem due to its nonlinearity and the quantitative or qualitative network traffic data stream with many features. To get rid of this problem, several types of intrusion detection methods have been proposed and shown different levels of accuracy. This is why the choice of the effective and robust method for IDS is very important topic in information security. In this work, we have built two models for the classification purpose. One is based on Support Vector Machines (SVM) and the other is Random Forests (RF). Experimental results show that either classifier is effective. SVM is slightly more accurate, but more expensive in terms of time. RF produces similar accuracy in a much faster manner if given modeling parameters. These classifiers can contribute to an IDS system as one source of analysis and increase its accuracy. In this paper, KDD’99 Dataset is used and find out which one is the best intrusion detector for this dataset. Statistical analysis on KDD’99 dataset found important issues which highly affect the performance of evaluated systems and results in a very poor evaluation of anomaly detection approaches. The most important deficiency in the KDD’99 dataset is the huge number of redundant records. To solve these issues, we have developed a new dataset, KDD99Train+ and KDD99Test+, which does not include any redundant records in the train set as well as in the test set, so the classifiers will not be biased towards more frequent records. The numbers of records in the train and test sets are now reasonable, which make it affordable to run the experiments on the complete set without the need to randomly select a small portion. The findings of this paper will be very useful to use SVM and RF in a more meaningful way in order to maximize the performance rate and minimize the false negative rate.展开更多
The strong limit results of oscillation modulus of PL-process are established in this paper when the density function is not continuous function for censored data. The rates of convergence of oscillation modulus of PL...The strong limit results of oscillation modulus of PL-process are established in this paper when the density function is not continuous function for censored data. The rates of convergence of oscillation modulus of PL-process are sharp under week condition. These results can be used to derive laws of the iterated logarithm of random bandwidth kernel estimator and nearest neighborhood estimator of density under continuous conditions of density function being not assumed.展开更多
Let {Xn, n≥1} be a strictly stationary sequence of random variables, which are either associated or negatively associated, f(.) be their common density. In this paper, the author shows a central limit theorem for a k...Let {Xn, n≥1} be a strictly stationary sequence of random variables, which are either associated or negatively associated, f(.) be their common density. In this paper, the author shows a central limit theorem for a kernel estimate of f(.) under certain regular conditions.展开更多
交叉熵法可显著加速电网可靠性评估,但往往聚焦于独立随机变量,若将其拓展至相关性变量可进一步提升加速性能。为有效获取相关性变量的重要抽样密度函数以实现其重要抽样,针对相关性建模中广泛使用的核密度估计模型(kernel density esti...交叉熵法可显著加速电网可靠性评估,但往往聚焦于独立随机变量,若将其拓展至相关性变量可进一步提升加速性能。为有效获取相关性变量的重要抽样密度函数以实现其重要抽样,针对相关性建模中广泛使用的核密度估计模型(kernel density estimation,KDE)开展了交叉熵优化研究。因KDE模型不属于指数分布家族,传统交叉熵优化难以实施,故利用复合抽样算法特点提出了新颖的直接交叉熵优化方法,推导出KDE模型最优权重参数的解析表达式。因权重参数数量级较小,直接优化易导致准确性退化,故基于子集模拟思想进一步提出间接交叉熵优化方法,将较小的权重参数优化转换成较大的条件概率优化,提升了优化准确性。通过MRTS79和MRTS96可靠性测试系统的评估分析,验证了所提方法在含相关性变量电网可靠性评估中的高效加速性能。展开更多
In this paper, the normal approximation rate and the random weighting approximation rate of error distribution of the kernel estimator of conditional density function f(y|x) are studied. The results may be used to...In this paper, the normal approximation rate and the random weighting approximation rate of error distribution of the kernel estimator of conditional density function f(y|x) are studied. The results may be used to construct the confidence interval of f(y|x) .展开更多
In this paper, the problem of nonparametric estimation of finite population quantile function using multiplicative bias correction technique is considered. A robust estimator of the finite population quantile function...In this paper, the problem of nonparametric estimation of finite population quantile function using multiplicative bias correction technique is considered. A robust estimator of the finite population quantile function based on multiplicative bias correction is derived with the aid of a super population model. Most studies have concentrated on kernel smoothers in the estimation of regression functions. This technique has also been applied to various methods of non-parametric estimation of the finite population quantile already under review. A major problem with the use of nonparametric kernel-based regression over a finite interval, such as the estimation of finite population quantities, is bias at boundary points. By correcting the boundary problems associated with previous model-based estimators, the multiplicative bias corrected estimator produced better results in estimating the finite population quantile function. Furthermore, the asymptotic behavior of the proposed estimators </span><span style="font-family:Verdana;">is</span><span style="font-family:Verdana;"> presented</span><span style="font-family:Verdana;">. </span><span style="font-family:Verdana;">It is observed that the estimator is asymptotically unbiased and statistically consistent when certain conditions are satisfied. The simulation results show that the suggested estimator is quite well in terms of relative bias, mean squared error, and relative root mean error. As a result, the multiplicative bias corrected estimator is strongly suggested for survey sampling estimation of the finite population quantile function.展开更多
基于Neyman-Rubin潜在结果框架,构建k近邻核估计量来测度响应变量随机缺失情形下的条件平均处理效应(conditional average treatment effect,CATE),旨在评估不同处理方式对个体的影响.证明了k近邻核估计量的几乎完全收敛性和渐近正态性...基于Neyman-Rubin潜在结果框架,构建k近邻核估计量来测度响应变量随机缺失情形下的条件平均处理效应(conditional average treatment effect,CATE),旨在评估不同处理方式对个体的影响.证明了k近邻核估计量的几乎完全收敛性和渐近正态性.数值模拟表明k近邻核估计量的表现优良,利用真实数据进行实证分析,实证结果显示k近邻核估计量具有较小的平均绝对偏差和均方根误差.展开更多
基金This work is supported by the National Natural Science Foundation of China(No.61772561)the Key Research&Development Plan of Hunan Province(No.2018NK2012)+1 种基金the Science Research Projects of Hunan Provincial Education Department(Nos.18A174,18C0262)the Science&Technology Innovation Platform and Talent Plan of Hunan Province(2017TP1022).
文摘Hashing technology has the advantages of reducing data storage and improving the efficiency of the learning system,making it more and more widely used in image retrieval.Multi-view data describes image information more comprehensively than traditional methods using a single-view.How to use hashing to combine multi-view data for image retrieval is still a challenge.In this paper,a multi-view fusion hashing method based on RKCCA(Random Kernel Canonical Correlation Analysis)is proposed.In order to describe image content more accurately,we use deep learning dense convolutional network feature DenseNet to construct multi-view by combining GIST feature or BoW_SIFT(Bag-of-Words model+SIFT feature)feature.This algorithm uses RKCCA method to fuse multi-view features to construct association features and apply them to image retrieval.The algorithm generates binary hash code with minimal distortion error by designing quantization regularization terms.A large number of experiments on benchmark datasets show that this method is superior to other multi-view hashing methods.
基金Supported by the National Natural Science Foundation of China (10371092)
文摘This paper introduces some concepts such as q- process in random environment, Laplace transformation, ergodic potential kernel, error function and some basic lemmas.We study the continuity and Laplace transformation of random transition function. Finally, we give the sufficient condition for the existence of ergodic potential kernel for homogeneous q- processes in random environments.
文摘We primarily provide several estimates for the heat kernel defined on the 2-dimensional simple random walk. Additionally, we offer an estimate for the heat kernel on high-dimensional random walks, demonstrating that the heat kernel in higher dimensions converges rapidly. We also compute the constants involved in the estimate for the 1-dimensional heat kernel. Furthermore, we discuss the general case of on-diagonal estimates for the heat kernel.
文摘In this paper,Edgeworth expansion for the nearest neighbor\|kernel estimate and random weighting approximation of conditional density are given and the consistency and convergence rate are proved.
基金Supported by the National Natural Science Foundation of China (10771185 and 10871200)
文摘In Section 1, the authors establish the models of two kinds of Markov chains in space-time random environments (MCSTRE and MCSTRE(+)) with abstract state space. In Section 2, the authors construct a MCSTRE and a MCSTRE(+) by an initial distribution Φ and a random Markov kernel (RMK) p(γ). In Section 3, the authors es-tablish several equivalence theorems on MCSTRE and MCSTRE(+). Finally, the authors give two very important examples of MCMSTRE, the random walk in spce-time random environment and the Markov br...
文摘The success of any Intrusion Detection System (IDS) is a complicated problem due to its nonlinearity and the quantitative or qualitative network traffic data stream with many features. To get rid of this problem, several types of intrusion detection methods have been proposed and shown different levels of accuracy. This is why the choice of the effective and robust method for IDS is very important topic in information security. In this work, we have built two models for the classification purpose. One is based on Support Vector Machines (SVM) and the other is Random Forests (RF). Experimental results show that either classifier is effective. SVM is slightly more accurate, but more expensive in terms of time. RF produces similar accuracy in a much faster manner if given modeling parameters. These classifiers can contribute to an IDS system as one source of analysis and increase its accuracy. In this paper, KDD’99 Dataset is used and find out which one is the best intrusion detector for this dataset. Statistical analysis on KDD’99 dataset found important issues which highly affect the performance of evaluated systems and results in a very poor evaluation of anomaly detection approaches. The most important deficiency in the KDD’99 dataset is the huge number of redundant records. To solve these issues, we have developed a new dataset, KDD99Train+ and KDD99Test+, which does not include any redundant records in the train set as well as in the test set, so the classifiers will not be biased towards more frequent records. The numbers of records in the train and test sets are now reasonable, which make it affordable to run the experiments on the complete set without the need to randomly select a small portion. The findings of this paper will be very useful to use SVM and RF in a more meaningful way in order to maximize the performance rate and minimize the false negative rate.
基金This work was supported by Fund of National Natural Science(10171103)of China.
文摘The strong limit results of oscillation modulus of PL-process are established in this paper when the density function is not continuous function for censored data. The rates of convergence of oscillation modulus of PL-process are sharp under week condition. These results can be used to derive laws of the iterated logarithm of random bandwidth kernel estimator and nearest neighborhood estimator of density under continuous conditions of density function being not assumed.
文摘Let {Xn, n≥1} be a strictly stationary sequence of random variables, which are either associated or negatively associated, f(.) be their common density. In this paper, the author shows a central limit theorem for a kernel estimate of f(.) under certain regular conditions.
文摘交叉熵法可显著加速电网可靠性评估,但往往聚焦于独立随机变量,若将其拓展至相关性变量可进一步提升加速性能。为有效获取相关性变量的重要抽样密度函数以实现其重要抽样,针对相关性建模中广泛使用的核密度估计模型(kernel density estimation,KDE)开展了交叉熵优化研究。因KDE模型不属于指数分布家族,传统交叉熵优化难以实施,故利用复合抽样算法特点提出了新颖的直接交叉熵优化方法,推导出KDE模型最优权重参数的解析表达式。因权重参数数量级较小,直接优化易导致准确性退化,故基于子集模拟思想进一步提出间接交叉熵优化方法,将较小的权重参数优化转换成较大的条件概率优化,提升了优化准确性。通过MRTS79和MRTS96可靠性测试系统的评估分析,验证了所提方法在含相关性变量电网可靠性评估中的高效加速性能。
基金Supported by Natural Science Foundation of Beijing City and National Natural Science Foundation ofChina(2 2 30 4 1 0 0 1 30 1
文摘In this paper, the normal approximation rate and the random weighting approximation rate of error distribution of the kernel estimator of conditional density function f(y|x) are studied. The results may be used to construct the confidence interval of f(y|x) .
文摘In this paper, the problem of nonparametric estimation of finite population quantile function using multiplicative bias correction technique is considered. A robust estimator of the finite population quantile function based on multiplicative bias correction is derived with the aid of a super population model. Most studies have concentrated on kernel smoothers in the estimation of regression functions. This technique has also been applied to various methods of non-parametric estimation of the finite population quantile already under review. A major problem with the use of nonparametric kernel-based regression over a finite interval, such as the estimation of finite population quantities, is bias at boundary points. By correcting the boundary problems associated with previous model-based estimators, the multiplicative bias corrected estimator produced better results in estimating the finite population quantile function. Furthermore, the asymptotic behavior of the proposed estimators </span><span style="font-family:Verdana;">is</span><span style="font-family:Verdana;"> presented</span><span style="font-family:Verdana;">. </span><span style="font-family:Verdana;">It is observed that the estimator is asymptotically unbiased and statistically consistent when certain conditions are satisfied. The simulation results show that the suggested estimator is quite well in terms of relative bias, mean squared error, and relative root mean error. As a result, the multiplicative bias corrected estimator is strongly suggested for survey sampling estimation of the finite population quantile function.
文摘基于Neyman-Rubin潜在结果框架,构建k近邻核估计量来测度响应变量随机缺失情形下的条件平均处理效应(conditional average treatment effect,CATE),旨在评估不同处理方式对个体的影响.证明了k近邻核估计量的几乎完全收敛性和渐近正态性.数值模拟表明k近邻核估计量的表现优良,利用真实数据进行实证分析,实证结果显示k近邻核估计量具有较小的平均绝对偏差和均方根误差.
文摘为有效预测船舶油耗,提出一种基于混合核函数的船舶油耗预测模型。分别构建径向基函数(radial basis function,RBF)和多项式单核函数的支持向量回归(support vector regression,SVR)模型,并利用自适应随机搜索(adaptive random search,ARS)算法对两者进行优化。在此基础上,建立基于混合核函数ARS-SVR的船舶油耗预测模型。以一艘风帆助航的大型原油运输船(very large crude carrier,VLCC)为研究对象,基于实船监测数据开展船舶油耗预测。结果表明,与单一的RBF和多项式单核ARS-SVR相比,采用混合核函数ARS-SVR的模型的预测结果的均方根误差分别降低了19.8%和30.2%。所提出的船舶油耗预测模型可以提升风帆助航船油耗计算的准确率,有助于优化船舶能效和提升管理技术。
