3 caicaiatnbu

尚未进行身份认证

我要认证

暂无相关简介

等级
TA的排名 5k+

【温故而知新】PCA

给定数据集:,其中 ,样本均值和样本方差的矩阵表达样本均值: , 这里记样本方差: ...

2020-02-10 01:22:00

【温故而知新】高斯判别分析(Gaussian Discriminant Analysis)

给定数据集;概率判别模型是直接去求,如下: 高斯判别分析是一种概率生成模型,这里我们需要最大化后验概率估计,对于二分类,高斯判别分析并不是直接去求和的值,而是去比较与的大小关系,而是对联合概率进行建模;由贝叶斯公式可知, 此处,与无关,所以正比于,其中,是posterior,是likehood,是piror。GDA假...

2020-02-05 22:41:42

【温故而知新】线性判别分析(Linear Discriminant Analysis)

线性判别分析(Linear Discriminant Analysis, LDA)是一种经典的线性分类方法。LDA的基本思想:给定训练数据集,设法将样本投影到一条直线上,使得同类样本的投影点尽可能的接近,不同类样本的投影点尽可能远离;在对新来样本进行分类时,首先将其投影到直线上,再根据投影点的位置来判断样本所属的类别。即:类内小,类间大("高内聚,松耦合")给定数据集,在这里我们将记为...

2020-02-04 21:33:37

【温故而知新】线性回归(Linear Regression)

本文主要以下几个角度来讲解线性回归:最小二乘法LSE(矩阵表达,几何意义) 概率角度:最小二乘法LSE——noise为Gaussian MLE 正则化: L1——Lasso L2——Ridge 正则化的几何解释最小二乘法定义为:通过给定样本数据集, , ,试图学习到这样的一个模型,使得对于任意的输入特征向量,模型的预测输出能够表示为输入特征向量的线性函数,即满足: ...

2020-02-04 00:13:41

[LeetCode 解题报告]155. Min Stack

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack. pop() -- Removes the element on top of the stack. top() -- Ge...

2020-02-01 17:00:24

[LeetCode 解题报告]154. Find Minimum in Rotated Sorted Array II

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., [0,1,2,4,5,6,7]might become [4,5,6,7,0,1,2]).Find the minimum element.The array may contai...

2020-02-01 16:53:29

[LeetCode 解题报告]153. Find Minimum in Rotated Sorted Array

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., [0,1,2,4,5,6,7]might become [4,5,6,7,0,1,2]).Find the minimum element.You may assume no du...

2020-02-01 16:28:34

[LeetCode 解题报告]152. Maximum Product Subarray

Given an integer arraynums, find the contiguous subarray within an array (containing at least one number) which has the largest product.Example 1:Input: [2,3,-2,4]Output: 6Explanation:[2,3] ...

2020-02-01 16:09:35

[LeetCode 解题报告]151. Reverse Words in a String

Given an input string, reverse the string word by word.Example 1:Input: "the sky is blue"Output:"blue is sky the"Example 2:Input: " hello world! "Output:"world! hello"Explanation: ...

2020-02-01 14:28:56

[LeetCode 解题报告]150. Evaluate Reverse Polish Notation

Evaluate the value of an arithmetic expression inReverse Polish Notation.Valid operators are+,-,*,/. Each operand may be an integer or another expression.Note:Division between two integers ...

2020-01-30 22:59:11

[LeetCode 解题报告]149. Max Points on a Line

Givennpoints on a 2D plane, find the maximum number of points that lie on the same straight line.Example 1:Input: [[1,1],[2,2],[3,3]]Output: 3Explanation:^|| o| o| o +-----...

2020-01-30 22:48:14

[LeetCode 解题报告]148. Sort List

Sort a linked list inO(nlogn) time using constant space complexity.Example 1:Input: 4->2->1->3Output: 1->2->3->4Example 2:Input: -1->5->3->4->0Output: -1-...

2020-01-30 15:00:38

[LeetCode 解题报告]147. Insertion Sort List

Sort a linked list using insertion sort.A graphical example of insertion sort. The partial sorted list (black) initially contains only the first element in the list.With each iteration one element...

2020-01-30 14:40:22

[LeetCode 解题报告]146. LRU Cache

Design and implement a data structure forLeast Recently Used (LRU) cache. It should support the following operations:getandput.get(key)- Get the value (will always be positive) of the key if th...

2020-01-30 14:37:51

[LeetCode 解题报告]145. Binary Tree Postorder Traversal

Given a binary tree, return thepostordertraversal of its nodes' values.Example:Input:[1,null,2,3] 1 \ 2 / 3Output:[3,2,1]Follow up:Recursive solution is trivial, coul...

2020-01-27 17:30:04

【darknet源码解析-29】图像RGB2HSV与HSV2RGB格式互转

本系列为darknet源码解析,由于在image.c中涉及到图像的RGB,YUV,HSV格式,在本文我们将image.c中涉及到的rgb_to_hsv()函数以及hsv_to_rgb()函数进行解析. RGB格式转为HSV格式 如果max=0 如果max!=0 对应源码如...

2020-01-22 16:27:33

【darknet源码解析-28】图像RGB2YUV与YUV2RGB格式互转

本系列为darknet源码解析,由于在image.c中涉及到图像的RGB,YUV,HSV格式,在本文我们将image.c中涉及到的rgb_to_yuv()函数以及yuv_to_rgb()函数进行解析.RGB格式转为YUV格式对应函数如下:void rgb_to_yuv(image im){ assert(im.c == 3); int i, j; ...

2020-01-21 20:57:41

[LeetCode 解题报告]144. Binary Tree Preorder Traversal

Given a binary tree, return thepreordertraversal of its nodes' values.Example:Input:[1,null,2,3] 1 \ 2 / 3Output:[1,2,3]Follow up:Recursive solution is trivial, could...

2020-01-21 15:11:37

[OpenVINO 学习笔记-02] Darknet模型转IR数据格式

本文旨在记录如何将YOLO系列模型转换IR数据格式,所有的YOLO模型最初实现框架是Darkent,而Darknet包含有两个文件:.cfg 模型配置文件 .weights 模型权重文件Intel OpenVINO中并没有直接封装从darknet转换IR的脚本,需要先将Darknet转换Tensorflow,然后再有TensorFlow转换至IR。1. 转换YOLOv3模型到Tenso...

2020-01-20 15:11:42

[LeetCode 解题报告]143. Reorder List

Given a singly linked listL:L0→L1→…→Ln-1→Ln,reorder it to:L0→Ln→L1→Ln-1→L2→Ln-2→…You maynotmodify the values in the list's nodes, only nodes itself may be changed.Example 1:Given 1->2-...

2020-01-05 22:44:46

查看更多

勋章 我的勋章
  • 签到新秀
    签到新秀
    累计签到获取,不积跬步,无以至千里,继续坚持!
  • 技术圈认证
    技术圈认证
    用户完成年度认证,即可获得
  • 持之以恒
    持之以恒
    授予每个自然月内发布4篇或4篇以上原创或翻译IT博文的用户。不积跬步无以至千里,不积小流无以成江海,程序人生的精彩需要坚持不懈地积累!
  • 1024勋章
    1024勋章
    #1024程序员节#活动勋章,当日发布原创博客即可获得
  • 勤写标兵Lv4
    勤写标兵Lv4
    授予每个自然周发布9篇以上(包括9篇)原创IT博文的用户。本勋章将于次周周三上午根据用户上周的博文发布情况由系统自动颁发。