0


基本的算法,计算模型,形式化语言

Basics of algorithmics, computation models, formal languages
课程网址: http://videolectures.net/bootcamp07_higuera_bacm/  
主讲教师: Colin de la Higuera
开课单位: 国立圣艾蒂安大学
开课时间: 2007-07-02
课程语种: 英语
中文简介:
在机器学习中应该注意的许多理论计算机科学问题之间,我们在这一系列讲座中访问了两个。第一个对应于字符串,并通过字符串的研究,关于更复杂的结构(如树和图)的问题。我们描述了关于子串和子序列的主要算法和组合问题,并将我们的注意力集中在拓扑问题上:排序字符串和计算距离和内核。第二是复杂性。我们不仅要注意(并且对所涉及的技术有合理的控制)通常的障碍,而且我们应该对随机算法的类有所了解。我们还展示了一些关于拉斯维加斯和蒙特卡罗技术的例子。
课程简介: Between the many theoretical computer science issues that one should be aware of when working in Machine learning, we visit, in this series of lectures, two. The first corresponds to strings, and through the study of strings, the questions about more complex structures like trees and graphs. We describe the main algorithmic and combinatorial questions about substrings and subsequences, and concentrate our attention to the topological questions: ordering strings and computing distances and kernels. The second is complexity. Not only should we be aware (and have a reasonable control of the techniques involved) of the usual barriers, but we should know something about classes for randomized algorithms. We also show some examples concerning Las Vegas and Monte Carlo techniques.
关 键 词: 计算机科学; 主要算法和组合; 类随机算法; 拓扑问题:排序字符串; 计算距离和内核
课程来源: 视频讲座网
最后编审: 2020-06-11:dingaq
阅读次数: 76