- 博客(41)
- 资源 (1)
- 收藏
- 关注
原创 特征工程简介
特征工程是一个非常重要的课题,是机器学习中不可缺少的一部分,但是它几乎很少出现于机器学习书本里面的某一章。在机器学习方面的成功很大程度上在于如果使用特征工程。
2016-01-23 13:25:52
768
原创 交叉验证(Cross Validation)
交叉验证(Cross Validation),有的时候也称作循环估计(Rotation Estimation),是一种统计学上将数据样本切割成较小子集的实用方法,该理论是由Seymour Geisser提出的。假设XX是集合全体,A⊊XA\subsetneq X是全集XX的非空真子集,那么非空集合X∖A≠∅X\setminus A \neq \emptyset则是集合AA在全集XX中的补集。于是可以
2015-11-03 09:59:25
4936
原创 机器学习的基本模型
机器学习的各种算法在于如何使用特定函数与已知的数据集相匹配,从而达到训练和测试的目的。本篇文章对一些近似的模型做一些相应的介绍。线性模型一维输入变量假设学习对象ff函数的输入是一组实数,那么对该函数进行近似的时候,最简单的方案就是fθ(x)=θ⋅xf_{\theta}(x)=\theta\cdot x。在这里,θ\theta是这个函数的斜率,也就是这个函数fθ(x)f_{\th
2015-11-01 15:20:22
11235
原创 时间序列模型之灰度模型
灰度预测法是一种对含有不确定因素的系统的预测方法,灰色系统是位于白色系统和黑色系统之间的一种系统。白色系统指的是一个系统内部的特征是完全已知的,使用者不仅知道系统的输入-输出关系,还知道实现输入-输出的具体方式,譬如函数表达式,微分方程的变化公式,或者物理学的基本定律。比方说牛顿第二定律F=ma, 使用者只需要知道物体的质量和加速度,就可以通过牛顿第二定律求出所使用的力F的具体值。或者说当物体的质量
2015-11-01 01:12:15
13892
1
原创 拉格朗日中值定理
拉格朗日中值定理:如果函数f(x)f(x)在闭区间[a,b][a,b]上连续,在开区间(a,b)(a,b)上可导,那么则存在ξ\xi使得 f(b)−f(a)=f′(ξ)⋅(b−a)f(b)-f(a)=f^{'}(\xi)\cdot(b-a)
2015-10-30 22:34:10
1355
转载 Matrix Inversion (using partial pivoting)
//// main.cpp// 2015 New Start//// Created by zr9558 on 13/2/15.// Copyright (c) 2015 zr9558. All rights reserved.//#include using namespace std;#include// 5.3 Algorith
2015-03-23 13:11:00
656
转载 Evaluation of Determinant using partial pivoting
Let A=(a[i][j]) be an n*n matrix.Step 1. Read the matrix
2015-03-21 14:13:00
453
原创 UVA OJ World Rank list 400th, Aug 14 2013
很久没有做UVA了,最近经常都上不去。Mark一下,再接再厉。
2013-08-14 21:09:28
806
原创 Introduction to Algorithms Chapter 13: Red Black Tree
//// main.cpp// Data Structure TRY1//// Created by zr9558 on 6/7/13.// Copyright (c) 2013 zr9558. All rights reserved.//// Introduction to Algorithms: Chapt
2013-08-04 16:49:30
769
原创 Introduction to Algorithms Chapter 12: Binary Search Tree
//// main.cpp// Data Structure TRY1//// Created by zr9558 on 6/7/13.// Copyright (c) 2013 zr9558. All rights reserved.//// Introduction to Algorithms: Chapt
2013-08-04 14:15:12
764
原创 Data Structures (Weiss) Chapter 12: Deterministic Skip Lists (跳跃链表,Comparable)
//// main.cpp// Data Structure TRY1//// Created by zr9558 on 6/7/13.// Copyright (c) 2013 zr9558. All rights reserved.//// Data Structures C++ Weiss: P.535
2013-08-01 18:58:41
720
原创 Data Structures (Weiss) Chapter 12: Deterministic Skip Lists (跳跃链表)
//// main.cpp// Data Structure TRY1//// Created by zr9558 on 6/7/13.// Copyright (c) 2013 zr9558. All rights reserved.//// Data Structures C++ Weiss: P.53
2013-08-01 14:41:22
688
原创 Data Structures (Weiss) Chapter 12: Splay Tree 伸展树
//// main.cpp// Data Structure TRY1//// Created by zr9558 on 6/7/13.// Copyright (c) 2013 zr9558. All rights reserved.//// Data Structures C++ Weiss: P.521
2013-07-18 11:53:12
830
原创 Data Structures (Weiss) Chapter 12: Treaps
//// main.cpp// Data Structure TRY1//// Created by zr9558 on 6/7/13.// Copyright (c) 2013 zr9558. All rights reserved.//// Data Structures C++ Weiss: P.548
2013-07-15 18:33:53
657
转载 [转载]Treap
http://www.nocow.cn/index.php/TreapTreapTreap,就是有另一个随机数满足堆的性质的二叉搜索树,其结构相当于以随机顺序插入的二叉搜索树。其基本操作的期望复杂度为O(log n)。其特点是实现简单,效率高于伸展树并且支持大部分基本功能,性价比很高。目录 [隐藏] 1 前言2
2013-07-15 16:32:38
730
原创 算法导论 第七章:快速排序
//// main.cpp// Data Structure TRY1//// Created by zr9558 on 6/7/13.// Copyright (c) 2013 zr9558. All rights reserved.//// 算法导论中文版第七章:快速排序#include
2013-07-15 15:59:54
641
原创 Data Structures (Weiss) Chapter 7: QuickSort 快速排序
//// main.cpp// Data Structure TRY1//// Created by zr9558 on 6/7/13.// Copyright (c) 2013 zr9558. All rights reserved.//// Data Structure C++, Weiss, P.285
2013-07-15 15:24:02
641
原创 Data Structures (Weiss) Chapter 7: MergeSort
//// main.cpp// Data Structure TRY1//// Created by zr9558 on 6/7/13.// Copyright (c) 2013 zr9558. All rights reserved.//// Data Structure C++, Weiss, P.276
2013-07-15 12:31:59
558
原创 Data Structures (Weiss) Chapter 7: HeapSort
//// main.cpp// Data Structure TRY1//// Created by zr9558 on 6/7/13.// Copyright (c) 2013 zr9558. All rights reserved.//// Data Structure C++, Weiss, P.273
2013-07-15 12:31:10
569
原创 Data Structures (Weiss) Chapter 7: Insertion Sort
//// main.cpp// Data Structure TRY1//// Created by zr9558 on 6/7/13.// Copyright (c) 2013 zr9558. All rights reserved.//// Data Structure C++, Weiss, P.263
2013-07-15 12:29:39
758
原创 Data Structures (Weiss) Chapter 6: Binomial Queue
//// main.cpp// Data Structure TRY1//// Created by zr9558 on 6/7/13.// Copyright (c) 2013 zr9558. All rights reserved.//// Data Structure C++, Weiss, P.246
2013-07-12 10:43:24
706
转载 转载:优先队列:BinomialQueue 二项队列
转载:http://blog.sina.com.cn/s/blog_ac9fdc0b0101l1md.html优先队列:BinomialQueue二项队列 (2013-04-04 22:12:31)转载▼标签: 杂谈分类: 数据结构 二项队列同样支持合并,插入,删除,每次操作的
2013-07-12 08:48:39
1599
原创 Data Structures (Weiss) Chapter 6: Leftist Heap
Definition of null path length, npl(X), of any node X to be the length of the shortest path from X to a node without two children. Thus, the npl of a node with zero or one child is 0, while npl(NULL)=
2013-07-11 13:52:31
689
转载 (转载)左倾堆 (leftist heap):方法参见 Data Structures (Weiss)
纸上谈兵: 左倾堆 (leftist heap)作者:Vamei 出处:http://www.cnblogs.com/vamei 欢迎转载,也请保留这段声明。谢谢! 我们之前讲解了堆(heap)的概念。堆是一个优先队列。每次从堆中取出的元素都是堆中优先级最高的元素。在之前的文章中,我们基于完全二叉树(complete binary tree)实现了堆,这
2013-07-11 12:52:31
860
原创 Data Structures (Weiss) Chapter 3: The Queue ADT, Array
//// main.cpp// Data Structure TRY1//// Created by zr9558 on 6/7/13.// Copyright (c) 2013 zr9558. All rights reserved.//// Data Structure C++, Weiss, P.104
2013-07-10 20:27:05
601
原创 Data Structures (Weiss) Chapter 3: The Queue ADT, Pointer
//// main.cpp// Data Structure TRY1//// Created by zr9558 on 6/7/13.// Copyright (c) 2013 zr9558. All rights reserved.//// Data Structure C++, Weiss, P.104
2013-07-10 17:50:46
563
原创 Data Structures (Weiss) Chapter 6: Binary Heap, Priority Queue
//// main.cpp// Data Structure TRY1//// Created by zr9558 on 6/7/13.// Copyright (c) 2013 zr9558. All rights reserved.//// Data Structure C++, Weiss, P.216
2013-07-10 14:47:42
704
原创 Data Structures (Weiss) Chapter 5: Hash Tables without Linked Lists (quadratic probing)
//// main.cpp// Data Structure TRY1//// Created by zr9558 on 6/7/13.// Copyright (c) 2013 zr9558. All rights reserved.//// Data Structure C++, Weiss, P.197
2013-07-10 13:53:47
886
原创 Data Structures (Weiss) Chapter 5: Separate Chain
//// main.cpp// Data Structure TRY1//// Created by zr9558 on 6/7/13.// Copyright (c) 2013 zr9558. All rights reserved.//// Data Structure C++, Weiss, P.189
2013-07-10 10:36:45
698
原创 Data Structures (Weiss) Chapter 8: Union and Find, Disjoint Sets, union by sizes, C++
//// main.cpp// Data Structure TRY1//// Created by zr9558 on 6/7/13.// Copyright (c) 2013 zr9558. All rights reserved.//// Data Structure C++, Weiss, P.319
2013-07-09 16:54:37
1038
原创 Data Structures (Weiss) Chapter 3: List C++
//// main.cpp// Data Structure TRY1//// Created by zr9558 on 6/7/13.// Copyright (c) 2013 zr9558. All rights reserved.//// Data Structure C++, Weiss, List P
2013-07-09 16:34:56
614
原创 Data Structures (Weiss) Chapter 3: Vector C++
//// main.cpp// Data Structure TRY1//// Created by zr9558 on 6/7/13.// Copyright (c) 2013 zr9558. All rights reserved.//// Data Structure C++, Weiss, Vector
2013-07-09 16:33:25
584
原创 Data Structures (Weiss) Chapter 4: AVL Trees 平衡树
//// main.cpp// Data Structure TRY1//// Created by zr9558 on 6/7/13.// Copyright (c) 2013 zr9558. All rights reserved.//// Data Structure C++, Weiss,
2013-07-09 16:30:21
605
原创 Data Structures (Weiss) Chapter 4: Binary Search Tree C++
//// main.cpp// Data Structure TRY1//// Created by zr9558 on 6/7/13.// Copyright (c) 2013 zr9558. All rights reserved.//// Data Structure C++, Weiss, P.126
2013-07-09 16:27:52
506
Data Structures and Algorithm Analysis in C++ (Mark Allen Weiss)
2013-07-16
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人