python 实现 Peceptron Learning Algorithm ( 一) 几个函数的记录

numpy.random.normal( )

                            

对应于numpy中

numpy.random.normal(loc=0.0, scale=1.0, size=None)

参数的意义为:

loc:float
    此概率分布的均值(对应着整个分布的中心centre)
scale:float
    此概率分布的标准差(对应于分布的宽度,scale越大越矮胖,scale越小,越瘦高)
size:int or tuple of ints
    输出的shape,默认为None,只输出一个值

np.random.randn(size)所谓标准正态分布(μ=0,σ=1μ=0,σ=11 ), 对应于np.random.normal(loc=0, scale=1, size)。 

【zip() 】

参考   http://www.runoob.com/python/python-func-zip.html

 

zip() 函数用于将可迭代的对象作为参数,将对象中对应的元素打包成一个个元组,然后返回由这些元组组成的列表。

如果各个迭代器的元素个数不一致,则返回列表长度与最短的对象相同,利用 * 号操作符,可以将元组解压为列表。

 

【numpy.dot( )】

如果参数是一维数组,返回两个数组的点乘,即内积

如果参数是二维数组(矩阵),返回矩阵相乘之积。

(1)一维数组:

(2)二维数组:(矩阵相乘,第i行依次乘以第i列然后相加)

【numpy.where( )】

参考:https://docs.scipy.org/doc/numpy/reference/generated/numpy.where.html

"

the output array contains elements of x where condition is True, and elements from y elsewhere.

If only condition is given, return the tuple condition.nonzero(), the indices where condition is True.

"

[condition , x , y]    ——>   如果condition为TRUE,返回x对应位置的值;为FALSE,返回y对应位置的值

【numpy.linalg.norm( )】

求范数

norm(x, ord=None, axis=None, keepdims=False)

默认为求二范数。 order = 2 二范数; order = 1 ,L1范数 ;order = np.inf 无穷范数

【ListedColormap()】

参考文章  https://matplotlib.org/api/_as_gen/matplotlib.colors.ListedColormap.html#matplotlib.colors.ListedColormap

【meshgrid( )】

[X,Y] = meshgrid(x,y) 将向量x和y定义的区域转换成矩阵X和Y,其中矩阵X的行向量是向量x的简单复制,而矩阵Y的列向量是向量y的简单复制。

【ravel( ) 和 flatten( )】

将数组平铺展开,ravel()返回view,对原始数组进行了改变;flatten()返回copy数组,不影响原始数组

参考 http://blog.csdn.net/liuweiyuxiang/article/details/78220080

 

【plt.contourf( )】

 

参考 http://blog.csdn.net/quincuntial/article/details/71104405

      https://www.cnblogs.com/huanggen/p/7533088.html

contour(X,Y,Z) 需要三维数据,X,Y代表二维坐标,在二维面上生成对应的网格,z代表高度,高度Z相等的颜色相同

 

 

 

 

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
本书用Python语言来讲解算法的分析和设计 分别介绍了树、图、计数问题、归纳递归、遍历、分解合并、贪心算法、复杂依赖、Dijkstra算法、匹配切割问题以及困难问题及其稀释等内容 Python Algorithms explains the Python approach to algorithm analysis and design. Written by Magnus Lie Hetland, author of Beginning Python, this book is sharply focused on classical algorithms, but it also gives a solid understanding of fundamental algorithmic problem-solving techniques. * The book deals with some of the most important and challenging areas of programming and computer science, but in a highly pedagogic and readable manner. * The book covers both algorithmic theory and programming practice, demonstrating how theory is reflected in real Python programs. * Well-known algorithms and data structures that are built into the Python language are explained, and the user is shown how to implement and evaluate others himself. What you'll learn * Transform new problems to well-known algorithmic problems with efficient solutions, or show that the problems belong to classes of problems thought not to be efficiently solvable. * Analyze algorithms and Python programs both using mathematical tools and basic experiments and benchmarks. * Prove correctness, optimality, or bounds on approximation error for Python programs and their underlying algorithms. * Understand several classical algorithms and data structures in depth, and be able to implement these efficiently in Python. * Design and implement new algorithms for new problems, using time-tested design principles and techniques. * Speed up implementations, using a plethora of tools for high-performance computing in Python. Who this book is for The book is intended for Python programmers who need to learn about algorithmic problem-solving, or who need a refresher. Students of computer science, or similar programming-related topics, such as bioinformatics, may also find the book to be quite useful. Table of Contents * Introduction * The Basics * Counting 101 * Induction and Recursion ...and Reduction * Traversal: The Skeleton Key of Algorithmics * Divide, Combine, and Conquer * Greed Is Good? Prove It! * Tangled Dependencies and Memoization * From A to B with Edsger and Friends * Matchings, Cuts, and Flows * Hard Problems and (Limited) Sloppiness

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值