您的位置: 专家智库 > >

国家自然科学基金(81171407)

作品数:2 被引量:1H指数:1
发文基金:国家自然科学基金国家教育部博士点基金更多>>
相关领域:自动化与计算机技术更多>>

文献类型

  • 2篇中文期刊文章

领域

  • 2篇自动化与计算...

主题

  • 1篇单细胞
  • 1篇细胞
  • 1篇均值
  • 1篇感受野
  • 1篇NEW
  • 1篇SHAPES
  • 1篇V1
  • 1篇APPROA...
  • 1篇BAYESI...
  • 1篇CONSTR...
  • 1篇MEAN_S...

传媒

  • 1篇Scienc...
  • 1篇Fronti...

年份

  • 1篇2018
  • 1篇2014
2 条 记 录,以下是 1-2
排序方式:
Hebbian-based mean shift for learning the diverse shapes of V1 simple cell receptive fields
2014年
The L0-norm constraint in sparse coding has the advantage of producing the same diversity of receptive field shapes as physiology data,but is difficult for analysis.It remains a challenging issue to understand how the diverse shapes of V1 simple cell receptive fields emerge in visual cortex.This paper presents a biologically plausible learning algorithm,named Hebbian-based mean shift,for this problem.The L0-norm constraint optimizes the number of basis functions rather than their coefficients.We report that the optimization procedure is essentially a 0–1 programming of the selection of basis functions.By assuming that the basis functions are independently selected from a basis set,we find the spatial distribution of input samples containing a special basis function has a star shape and peaks at this basis function.Thus,learning the basis functions for sparse coding with the L0-norm can be interpreted as mode detection where the basis functions are the modes of the kernel density estimate.We employ mean shift to detect modes and prove that the updating rule for the mean shift is Hebbian.The simulation results demonstrate the robustness of the proposed algorithm in producing both Gabor-like and blob-like basis functions.
Jiqian LiuYunde Jia
关键词:感受野单细胞均值
A new constrained maximum margin approach to discriminative learning of Bayesian classifiers被引量:1
2018年
We propose a novel discriminative learning approach for Bayesian pattern classification, called 'constrained maximum margin (CMM)'. We define the margin between two classes as the difference between the minimum decision value for positive samples and the maximum decision value for negative samples. The learning problem is to maximize the margin under the con- straint that each training pattern is classified correctly. This nonlinear programming problem is solved using the sequential un- constrained minimization technique. We applied the proposed CMM approach to learn Bayesian classifiers based on Gaussian mixture models, and conducted the experiments on 10 UCI datasets. The performance of our approach was compared with those of the expectation-maximization algorithm, the support vector machine, and other state-of-the-art approaches. The experimental results demonstrated the effectiveness of our approach.
Ke GUOXia-bi LIULun-hao GUOZong-jie LIZeng-min GENG
共1页<1>
聚类工具0