- 博客(57)
- 资源 (23)
- 收藏
- 关注
原创 LSTM模型分析及对时序数据预测的具体实现(python实现)
具体代码看代码云:传送门,有问题欢迎随时私信~引言这篇博客衔接上一篇博客: Holt-Winters模型原理分析及代码实现(python),我们在三次指数平滑的基础上,来进一步讨论下对时序数据的预测。LSTM原理分析(参考博文:Understanding LSTM Networks)Long Short Term 网络–LSTM,是神经网络的一种简单延伸,也是一种特殊的RNN模型。可以用来学习长期
2017-09-30 10:28:08 22404 2
原创 程序员的修炼之道
Don’t repeat yourself 不要重复你自己Make it easy to reuse 让复用变得容易Eliminate effects between unrelated things 消除无关事物之间的影响There are no final decisions 不存在最终决策 Use tracer bullets to find the target 用曳光弹找到目标P
2017-09-28 09:25:32 480 1
原创 superset之安装与部署(Ubuntu16.10)
引言Superset 是Airbnb的数据科学部门开源的一套工具,它是一个自助式数据分析工具,它的主要目标是简化我们的数据探索分析操作,它的强大之处在于整个过程一气呵成,几乎不用片刻的等待。Superset通过让用户创建并且分享仪表盘的方式为数据分析人员提供一个快速的数据可视化功能。现在,我们就来安装部署下这个工具,看看到底好不好玩。安装下载地址superset的源码可以在github上找到。pip
2017-09-27 10:10:59 3932 5
原创 78. Subsets
题目Given a set of distinct integers, nums, return all possible subsets.Note: The solution set must not contain duplicate subsets.For example, If nums = [1,2,3], a solution is:[ [3], [1], [2],
2017-09-27 08:43:19 445
原创 K近邻算法讲解与python实现(附源码demo下载链接)
k近邻算法概述K近邻(k-Nearest Neighbor,简称kNN)算法,是一种应用很广泛的监督学习算法。它非常有效且易于掌握,其工作机制也很简单:给定测试样本,基于某种距离度量找出训练集中与其最靠近的k个训练样本,然后基于这k个"邻居"的信息来进行预测。K近邻既可以用于分类又可以用于回归,在分类问题中:我们使用"投票法",即选择这k个样本中出现最多的类别标记作为预测结果;在回归问题中:我
2017-09-25 18:56:02 2467 2
原创 77. Combinations
题目Given two integers n and k, return all possible combinations of k numbers out of 1 … n.For example, If n = 4 and k = 2, a solution is:[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4], ]
2017-09-25 11:51:56 277
原创 75. Sort Colors
题目Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers 0,
2017-09-25 10:14:49 255
原创 74. Search a 2D Matrix
题目Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right. The first integer of each row
2017-09-25 09:28:09 285
原创 73. Set Matrix Zeroes
题目Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.思路本题因为要in place,那么可以利用这样的思路来分析: 用每行的第一个位置存储该行的状态(如果存在0,该位置置0) 用每列的第一位位置存储该列的状态(如果存在0,则该位置置0) 维护一个变
2017-09-23 15:45:58 262
原创 71. Simplify Path
题目Given an absolute path for a file (Unix-style), simplify it.For example, path = “/home/”, => “/home” path = “/a/./b/../../c/”, => “/c”思路本题如果会用getline这个C++库函数,那么问题就简单了代码class Solution {public:
2017-09-23 11:32:07 232
原创 64. Minimum Path Sum
题目Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at an
2017-09-22 11:17:22 264
原创 63. Unique Paths II
题目Follow up for “Unique Paths”:Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively in the grid.For
2017-09-22 10:08:08 280
原创 62. Unique Paths
题目A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the bot
2017-09-22 08:56:09 273
原创 Holt-Winters模型原理分析及代码实现(python)
引言最近实验室老师让我去预测景区内代步车辆的投放量,于是乎,本着“一心一意地输出年富力强的劳动力”这份初心,我就屁颠屁颠地去找资料,然后发现了Holt-Winters模型 , 感觉这个模型可以有,于是就去研究一番,并总结成这篇博客了。原理分析移动平均(The simple moving average (SMA))直观上,最简单的平滑时间序列的方法是实现一个无权重的移动平均,目前已知的方法是用窗口函
2017-09-21 13:54:15 63473 32
原创 61. Rotate List
题目Given a list, rotate the list to the right by k places, where k is non-negative.For example: Given 1->2->3->4->5->NULL and k = 2, return 4->5->1->2->3->NULL.思路本题,右旋,比较简单,考察了指针的操作代码/** * Definition
2017-09-21 12:10:25 375
原创 60. Permutation Sequence
重点内容##题目 The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order, We get the following sequence (ie, for n = 3):“123” “132” “213” “2
2017-09-21 11:23:24 628
原创 59. Spiral Matrix II
题目Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.For example, Given n = 3,You should return the following matrix: [ [ 1, 2, 3 ], [ 8, 9, 4 ], [ 7
2017-09-20 11:43:59 308
原创 56. Merge Intervals
题目Given a collection of intervals, merge all overlapping intervals.For example, Given [1,3],[2,6],[8,10],[15,18], return [1,6],[8,10],[15,18].思路本题,说难不难,说简单也不简单,就是稍稍有些绕,特此总结一个清晰的思路,如下: step1:首先对vect
2017-09-20 11:27:41 387
原创 55. Jump Game
题目Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determine if you a
2017-09-20 09:57:39 331
原创 54. Spiral Matrix
题目Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example, Given the following matrix:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ] ] You
2017-09-19 22:39:28 331
原创 50. Pow(x, n)
题目Implement pow(x, n).思路本题是真的简单,求幂运算,只要循环相乘就行,唯一需要注意的是一些特殊情况: n==0 x ==1 or -1 代码class Solution {public: double myPow(double x, int n) { double res=1; if(x==1) {
2017-09-19 16:45:13 501
原创 49. Group Anagrams
题目Given an array of strings, group anagrams together.For example, given: [“eat”, “tea”, “tan”, “ate”, “nat”, “bat”], Return:[ [“ate”, “eat”,”tea”], [“nat”,”tan”], [“bat”] ] Note: All input
2017-09-19 14:31:31 350
原创 48. Rotate Image
题目You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Note: You have to rotate the image in-place, which means you have to modify the input 2D matrix dire
2017-09-18 14:08:39 628
原创 47. Permutations II
题目Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example, [1,1,2] have the following unique permutations: [ [1,1,2], [1,2,1], [2,1,1
2017-09-18 10:29:35 634
原创 46. Permutations
题目Given a collection of distinct numbers, return all possible permutations.For example, [1,2,3] have the following permutations: [ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,
2017-09-18 10:21:25 564
原创 43. Multiply Strings
题目Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2.Note:The length of both num1 and num2 is < 110. Both num1 and num2 contains only digits 0-9.
2017-09-17 16:11:15 202
原创 40. Combination Sum II
题目Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each number in C may only be used once in the combination.
2017-09-17 15:05:45 293
原创 39. Combination Sum
题目Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chosen from
2017-09-17 14:31:31 210
原创 机器学习相关概念及简单介绍
本次分享会的主要内容如下:什么是机器学习日常生活中如何用到机器学习以及机器学习如何改进我们的工作和生活使用机器学习解决问题的一般方法什么是机器学习接下来,正式分享,首先问下大家,什么叫机器学习?官方定义:[Mitchell,1997]给出了一个更形式化的定义:假设用P来评估计算机程序在某任务类T上的性能,若一个程序通过利用经验E在T中任务上获得了性能改善,则我们就说关于T和
2017-09-17 13:11:55 615
原创 36. Valid Sudoku
题目Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character ‘.’.A partially filled sudoku whic
2017-09-15 14:04:24 238
原创 34. Search for a Range
题目Given an array of integers sorted in ascending order, find the starting and ending position of a given target value.Your algorithm’s runtime complexity must be in the order of O(log n).If the target
2017-09-15 09:35:13 194
原创 33. Search 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).You are given a target value to search. If found in the
2017-09-15 09:17:35 178
原创 31. Next Permutation
题目Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowest possible or
2017-09-13 10:42:09 191
原创 29. Divide Two Integers
题目Divide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INT.思路本题不能用除法、乘法、取模算子,但是学过计算机基础的人都知道,乘除法的本质就是加减法。故,本题用减法来计算,但是为了减少“减法”操作次数,故每次将除数乘2来迅速逼近被除数,此
2017-09-13 09:55:23 195
原创 4. Median of Two Sorted Arrays
题目There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Example 1: nums1 = [1, 3] n
2017-09-13 08:50:42 345
原创 AI,机器学习(模式识别),深度学习的区别与联系
引言"互联网+"已经发展的差不多了,应有尽有,空间不大,下个浪潮会不会是"AI+"?那么作为一个普通程序员,在已有C++/ java / python这样的语言技能栈的前提下,我们该如何拥抱变化,如何向人工智能(AI)靠拢?AI,机器学习,深度学习?近两年科技领域有些火热名词常常会被我们津津乐道,诸如"人工智能"、"模式识别"、"机器学习"、"深度学习"等。还记得2016年Goog
2017-09-12 15:07:43 19842
原创 19. Remove Nth Node From End of List
题目Given a linked list, remove the nth node from the end of list and return its head.For example,Given linked list: 1->2->3->4->5, and n = 2.After removing the second node from the end, the linked list
2017-09-12 11:19:16 231
原创 24. Swap Nodes in Pairs
题目Given a linked list, swap every two adjacent nodes and return its head.For example, Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space. You may
2017-09-12 11:02:31 175
原创 22. Generate Parentheses
题目Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:[ “((()))”, “(()())”, “(())()”, “()(())”
2017-09-12 09:30:40 330
ChatGPT探索系列文章合集,涉及理解ChatGPT的来龙去脉,原理背景等方面内容
2023-05-15
三万字保姆级教程+AI绘画+设计、装修、教育+手把手带你玩转Midjourney AI绘画
2023-04-28
AI专题报告之一:AIGC与ChatGPT正掀起新一轮的产业浪潮-从“上网”到“上算”,由“网络世界”至“虚拟现实”
2023-03-14
47页深度研报:揭秘ChatGPT身后的AIGC技术和它的中国同行们.pdf
2023-03-14
2023AIGC市场研究报告及ChatGPT推动的变革趋势与投资机会.pdf
2023-03-14
A Preprocessing Scheme for High-Cardinality Categorical Attributes
2017-11-12
在分类及预测任务中对高维类别变量的预处理方法
2017-11-12
K近邻算法讲解、python实现、k值的确定(python实现,具体代码讲解请看博主博客)
2017-09-25
Python_TreeMap_可视化方案数据源(实现代码,请看我博客专栏《机器学习》)
2017-09-05
Python Matplotlib TreeMap可视化方案数据源(实现代码,请看我博客专栏《机器学习》)
2017-09-04
Python TreeMap可视化方案数据源(实现代码,请看我博客专栏《机器学习》)
2017-09-04
斯坦福大学机器学习课程原始讲义
2017-08-31
The+Practical+Importance+of+Feature+Selection
2017-07-31
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人