一种Weyl群轨道生成学习算法研究  

A Learning Algorithm Research for Generating Weyl Group Orbit

作　　者：严海双[1] 何书萍[1] 李凡长[1] 

机构地区：[1]苏州大学计算机科学与技术学院机器学习与数据分析中心,江苏苏州215006

出　　处：《微电子学与计算机》2009年第10期103-106,共4页Microelectronics & Computer

基　　金：国家自然科学基金项目(60775045)

摘　　要：利用Weyl群的性质,给出了Weyl群轨道生成原理及相关学习算法.首先描述了学习算法,重点阐述了轨道生成广度优先和深度优先学习算法;然后对测试数据进行分析比较.实验结果表明深度优先算法可以节约存储空间,并在一定程度上提高了时间效率.Using the properties of Weyl group, principle for generating Weyl group orbits and learning algorithm are discussed. At first learning algorithms are described. Then depth-first and bread-first algorithm are listed. According to the result of the analysis, the latter technique for each newly created orbit element is extremely fast and efficient. While it might not be easy to store a large orbit permanently, this technique, due to its small memory requirements, could be used to calculate on the spot where it is needed in other formulas.

关 键 词：李群机器学习 WEYL群 Weyl群轨道生成学习算法 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]