Assessing continuous bivariate effects among different groups through nonparametric regression models: An application to breast cancer detection

In many applications, the joint effect of two continuous covariates on the target binary response may vary across groups defined by levels of a given factor. A testing procedure that would enable this type of surface-by-factor interactions to be detected has been designed. To accomplish this goal, a logistic generalized additive model (GAM) with bivariate continuous interactions varying across groups defined by levels of a factor is considered. A local scoring algorithm based on local linear kernel smoothers was implemented to estimate the proposed logistic GAM. Bootstrap resampling techniques were used for the purpose of testing for factor-by-surface interactions. Given the high computational cost involved, binning techniques were used to speed up computation in the estimation and testing processes. The adequacy of the bootstrap-based test was assessed by means of a simulation study. If a factor-by-surface interaction is detected in the model, it is then established that the use of the odds-ratio curves is very useful in obtaining a direct interpretation of the fitted model. The benefits of using this methodology when analyzing real data are illustrated by applying the technique to the outputs produced by a computerized system dedicated to the early detection of breast cancer.     

条件中位数L_1-模最近邻估计的渐近性质

本文在－混合随机变量的条件下，讨论了基于几个观察值的条件中位数的L1－模最近邻估计的渐近性质，得到了独立同分布时类似的结论．     

对操作系统内核动态扩展的研究

操作系统内核动态扩展有利于核心空间的利用和系统性能,被现代操作系统普遍采用,但面临的关键问题是扩展模块对系统内核安全性、可靠性的影响.通过分析主流操作系统Linux、Windows、Mac OS X的内核模块按需加载机制及其安全、可靠性措施,指出这些操作系统都存在对内核模块安全控制的不足之处.从设计的角度对内核扩展机制的安全性和可靠性提出几点建议,并介绍了所进行的研发工作,有助于弥补内核扩展安全控制的缺陷.     

初始聚类中心优化选取的核C-均值聚类算法

在通常的核C-均值聚类算法中,聚类结果对初始聚类中心敏感,随机选取初始聚类中心时,会使得迭代次数较多、分类结果不稳定.针对该问题提出一种优化选取仞始聚类中心的算法.该方法采用一种改进的最大最小距离算法对原始空间中的数据进行粗分类,将粗分类结果中每类类心作为初始聚类中心,再运用核C-均值聚类算法进行分类.仿真实验结果表明方法能有效减少迭代次数,使分类结果更加稳定,分类识别率也有一定程度的提高.     

Betweenness parameterized above tight lower bound

We study ordinal embedding relaxations in the realm of parameterized complexity. We prove the existence of a quadratic kernel for the Betweenness problem parameterized above its tight lower bound, which is stated as follows. For a set V of variables and set C of constraints “vi is between vj and vk”, decide whether there is a bijection from V to the set {1,…,|V|} satisfying at least |C|/3+κ of the constraints in C. Our result solves an open problem attributed to Benny Chor in Niedermeier's monograph “Invitation to Fixed-Parameter Algorithms”. The betweenness problem is of interest in molecular biology. An approach developed in this paper can be used to determine parameterized complexity of a number of other optimization problems on permutations parameterized above or below tight bounds.     

Combining feature spaces for classification

In this paper we offer a variational Bayes approximation to the multinomial probit model for basis expansion and kernel combination. Our model is well-founded within a hierarchical Bayesian framework and is able to instructively combine available sources of information for multinomial classification. The proposed framework enables informative integration of possibly heterogeneous sources in a multitude of ways, from the simple summation of feature expansions to weighted product of kernels, and it is shown to match and in certain cases outperform the well-known ensemble learning approaches of combining individual classifiers. At the same time the approximation reduces considerably the CPU time and resources required with respect to both the ensemble learning methods and the full Markov chain Monte Carlo, Metropolis-Hastings within Gibbs solution of our model. We present our proposed framework together with extensive experimental studies on synthetic and benchmark datasets and also for the first time report a comparison between summation and product of individual kernels as possible different methods for constructing the composite kernel matrix.     

Online face recognition system based on multi-view algorithm and Kernel PCA

An online face recognition system is presented in the paper. To online face recognition system, we should consider the recognition rate, the image compression and image size. In the paper we researched the innovation technologies for face recognition system, including Kernel Principal Component Analysis （Kernel PCA）, Delta low-pass wavelet filter, and face recognition algorithm using multiple images. Kernel PCA is derived to classify the characteristics of training images in the database. Delta low-pass wavelet filter is used to reduce the image size. A face recognition algorithm using multiple images is presented to improve the recognition rate. Simulation experiment shows that in the case of packet loss recognition rate is improved highly.     

Image edge detection based on multi-fractal spectrum analysis

In this paper, an image edge detection method based on multi-fractal spectrum analysis is presented. The coarse grain H?lder exponent of the image pixels is first computed. then, its multi-fractal spectrum is estimated by the kernel estimation method. Finally, the image edge detection is done by means of different multi-fractal spectrum values. Simulation results show that this method is efficient and has better locality compared with the traditional edge detection methods such as the Sobel method. __________ Translated from Journal of Hunan University (Natural Sciences), 2004, 31(4): 28–33     

Constructing Facial Identity Surfaces for Recognition

We present a novel approach to face recognition by constructing facial identity structures across views and over time, referred to as identity surfaces, in a Kernel Discriminant Analysis (KDA) feature space. This approach is aimed at addressing three challenging problems in face recognition: modelling faces across multiple views, extracting non-linear discriminatory features, and recognising faces over time. First, a multi-view face model is designed which can be automatically fitted to face images and sequences to extract the normalised facial texture patterns. This model is capable of dealing with faces with large pose variation. Second, KDA is developed to compute the most significant non-linear basis vectors with the intention of maximising the between-class variance and minimising the within-class variance. We applied KDA to the problem of multi-view face recognition, and a significant improvement has been achieved in reliability and accuracy. Third, identity surfaces are constructed in a pose-parameterised discriminatory feature space. Dynamic face recognition is then performed by matching the object trajectory computed from a video input and model trajectories constructed on the identity surfaces. These two types of trajectories encode the spatio-temporal dynamics of moving faces.     

结合核函数与非线性偏微分方程的图像去噪方法

传统的非线性扩散滤波方法在图像去噪时使用传统的梯度算子,易导致细节缺失。针对该缺点,以非线性偏微分方程和图像结构信息为基础,构造一类带有自适应权值的非线性扩散滤波去噪方式。这种方式选用多方向的拉普拉斯算子模板,结合核函数,自适应地调节权重系数;利用非局部信息选取合适的搜索窗宽,以减小图像噪声的影响。实验证明,该方法既能较好地保存图像纹理细节,又可以达到很好的去噪效果。