文献^([1-9])提出了血液循环在大脑处理信息的过程中具有时序控制作用,并用量化模型结合结构风险最小化相关理论说明时序控制作用的意义。文献^([10-24])汇总介绍量化模型中的一些细节。为方便同行阅读,我们在2013年也发表了系列综合报...文献^([1-9])提出了血液循环在大脑处理信息的过程中具有时序控制作用,并用量化模型结合结构风险最小化相关理论说明时序控制作用的意义。文献^([10-24])汇总介绍量化模型中的一些细节。为方便同行阅读,我们在2013年也发表了系列综合报告^([25-29])。文献^([31-32])介绍我们开发的一个算法,这一算法实现将一个有向网络分解为一系列前向网络集合。分解出来的前向网络集合可用于分析各种情况对任一细胞活动情况的影响,也可用于搭建精细的神经网络模型,进而用于辅助医学等方面的研究。算法的网络分解能力能符合文献^([1-28])所介绍的大脑处理信息量化方案的要求。算法的设计用到了笔者在2004年论文^([30])中总结的一种算法设计思路,采用这一思路设计的算法有好的可扩展性,文献^([33])将文献^([31-32])介绍的算法升级为DG-FFN SR Trees算法,本文介绍了怎样将文献^([33])介绍的DG-FFN SR Trees算法升级扩展为DG-FFN SR TreesEI算法,升级成的DG-FFN SR Trees-EI算法可用于多种用途。展开更多
Problems existin similarity measurement and index tree construction which affect the performance of nearest neighbor search of high-dimensional data. The equidistance problem is solved using NPsim function to calculat...Problems existin similarity measurement and index tree construction which affect the performance of nearest neighbor search of high-dimensional data. The equidistance problem is solved using NPsim function to calculate similarity. And a sequential NPsim matrix is built to improve indexing performance. To sum up the above innovations,a nearest neighbor search algorithm of high-dimensional data based on sequential NPsim matrix is proposed in comparison with the nearest neighbor search algorithms based on KD-tree or SR-tree on Munsell spectral data set. Experimental results show that the proposed algorithm similarity is better than that of other algorithms and searching speed is more than thousands times of others. In addition,the slow construction speed of sequential NPsim matrix can be increased by using parallel computing.展开更多
文摘文献^([1-9])提出了血液循环在大脑处理信息的过程中具有时序控制作用,并用量化模型结合结构风险最小化相关理论说明时序控制作用的意义。文献^([10-24])汇总介绍量化模型中的一些细节。为方便同行阅读,我们在2013年也发表了系列综合报告^([25-29])。文献^([31-32])介绍我们开发的一个算法,这一算法实现将一个有向网络分解为一系列前向网络集合。分解出来的前向网络集合可用于分析各种情况对任一细胞活动情况的影响,也可用于搭建精细的神经网络模型,进而用于辅助医学等方面的研究。算法的网络分解能力能符合文献^([1-28])所介绍的大脑处理信息量化方案的要求。算法的设计用到了笔者在2004年论文^([30])中总结的一种算法设计思路,采用这一思路设计的算法有好的可扩展性,文献^([33])将文献^([31-32])介绍的算法升级为DG-FFN SR Trees算法,本文介绍了怎样将文献^([33])介绍的DG-FFN SR Trees算法升级扩展为DG-FFN SR TreesEI算法,升级成的DG-FFN SR Trees-EI算法可用于多种用途。
基金Supported by the National Natural Science Foundation of China(No.61300078)the Importation and Development of High-Caliber Talents Project of Beijing Municipal Institutions(No.CIT&TCD201504039)+1 种基金Funding Project for Academic Human Resources Development in Beijing Union University(No.BPHR2014A03,Rk100201510)"New Start"Academic Research Projects of Beijing Union University(No.Hzk10201501)
文摘Problems existin similarity measurement and index tree construction which affect the performance of nearest neighbor search of high-dimensional data. The equidistance problem is solved using NPsim function to calculate similarity. And a sequential NPsim matrix is built to improve indexing performance. To sum up the above innovations,a nearest neighbor search algorithm of high-dimensional data based on sequential NPsim matrix is proposed in comparison with the nearest neighbor search algorithms based on KD-tree or SR-tree on Munsell spectral data set. Experimental results show that the proposed algorithm similarity is better than that of other algorithms and searching speed is more than thousands times of others. In addition,the slow construction speed of sequential NPsim matrix can be increased by using parallel computing.
