- 博客(128)
- 收藏
- 关注
原创 Spark在shuffle数据的时候遇到的问题
问题描述:今天对比较大的数据集a做,a.leftOuterJoin(b)的操作的时候,出现错误,查看log,错误如下:WARN org.apache.spark.network.server.TransportChannelHandler: Exception in connection from /10.114.2.44:61221java.io.IOException: Con
2016-03-10 17:33:47 20739 2
原创 贝叶斯方法
引文 http://mindhacks.cn/2008/09/21/the-magical-bayesian-method/有空要看一下,做笔记。
2015-04-02 00:29:33 514
原创 Logistic Regression的几个特性
出处 http://hi.baidu.com/hehehehello/item/40025c33d7d9b7b9633aff87#send上面我们的sell是一个具体的实数值,然而很多情况下,我们需要回归产生一个类似概率值的0~1之间的数值(比如某一双鞋子今天能否卖出去?或者某一个广告能否被用户点击? 我们希望得到这个数值来帮助决策鞋子上不上架,以及广告展不展示)。这个数值必须是0~1之间,但
2015-04-02 00:21:59 1890
原创 Hadoop 2.6.0 伪分布式模式环境搭建
教程花了大半天时间,终于把Hadoop伪分布式环境搭建出来了。网上的很多教程在我的服务器中并不能正确搭建,上面的教程是能在我的服务跑的通的。
2015-01-08 22:57:02 387
原创 A Three-Phase Approach to Document Clustering Based on Topic Significance Degree
•1,Inthe first phase, we determine the best topic model and present a formal conceptabout significance degree of topics and some topic selection criteria, throughwhich we can find the best number of t
2014-08-25 18:29:58 488
原创 A Novel Method for Geographical Social Event Detection in Social Media
keyword:Social Event Detection, Geographical Temporal Pattern, Adaptive K-means ClusteringINTRODUCTION:In this paper, we proposed a novel geographical social event detection method by geogra
2014-08-25 18:22:59 621
原创 HDU 2094 STL
#include#include#include#include#includeusing namespace std;int main(){int n;setbase;setbase1;char a[101],b[101];while(scanf("%d",&n),n){while(n--){scanf("%s %s",a,b);base.insert(a);
2014-08-20 20:48:51 430
原创 sscanf的使用 HDU 2093
#include#include#include struct c{ char name[20]; int x;//名次 int y;//时间}d[1000];int comp(const void *a,const void *b){ struct c *p1=(struct c *)a; struct c *p2=(struct c *)b
2014-08-20 20:41:07 358
原创 HDU 3709 数位dp dfs版
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include
2014-08-20 18:08:36 359
原创 HDU 3943 数位DP
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include
2014-08-19 18:07:50 381
原创 HDU 3652 数位DP
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include
2014-08-19 14:38:02 319
原创 HDU 3555 数位DP
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include
2014-08-19 11:02:52 327
原创 HDU 2089 数位DP
状态转移方程dp[i][0]=dp[i-1][0]*9-dp[i-1][1]; //不含62和4 dp[i][1]=dp[i-1][0]; //不含62和4,但2结尾 dp[i][2]=dp[i-1][2]*10+dp[i-1][1]
2014-08-19 09:44:21 327
原创 POJ 3233 矩阵链乘
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include
2014-08-18 20:51:42 330
原创 HDU 4602 快速求幂
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include
2014-08-18 18:20:36 378
原创 HDU 4686 矩阵链乘
#include#include#includeusing namespace std;const int mod=1000000007;struct Matrix{ long long arr[5][5];};Matrix init,unit;long long n,a0,ax,ay,b0,bx,by; //注意用long long,否则会溢出Matrix
2014-08-18 16:22:25 542
原创 HDU 4958 DP
//// main.cpp// HDU 4958 DP//// Created by 郑喆君 on 8/18/14.// Copyright (c) 2014 itcast. All rights reserved.//#include #include #include #include #include #include #include #include
2014-08-18 10:55:34 444
原创 欧拉函数 素数筛选法模板
void init(){ __int64 i, j; p[0] = 1; //记录素数个数 p[1] = 2; for (i=3; i<N; i+=2) { if (hash[i]) continue; p[++p[0]] = i; for (j=i*i; j<N; j+=i
2014-08-13 15:14:05 628
原创 HDU 2824 欧拉函数 求小于等于n且与n互质数的个数
#include"stdio.h"#include"string.h"#include"stdlib.h"#define N 3000011int phi[N];void getphi(){ int i,j; phi[1]=1; for(i=2;i<=3000000;i++) phi[i]=i; for(i=2;i<=3000000;i++) { if(i==phi[i]
2014-08-13 15:02:59 622
原创 HDU 2822 BFS+优先队列
//// main.cpp// HDU 2822 BFS+优先队列//// Created by 郑喆君 on 8/13/14.// Copyright (c) 2014 itcast. All rights reserved.//#include#include#include#include#include#include#include#include
2014-08-13 11:55:13 388
原创 HDU 2821 DFS
//// main.cpp// HDU 2821 DFS//// Created by 郑喆君 on 8/12/14.// Copyright (c) 2014 itcast. All rights reserved.//#include#include#include#include#include#include#include#include#incl
2014-08-13 09:40:04 676
原创 HDU 2819 二分匹配
//// main.cpp// HDU 2819 二分匹配//// Created by 郑喆君 on 8/12/14.// Copyright (c) 2014 itcast. All rights reserved.//#include#include#include#include#include#include#include#include#inc
2014-08-12 23:15:48 333
原创 POJ 1661 DP 注意边界条件。。。WA了好几次
//// main.cpp// POJ 1661 DP//// Created by 郑喆君 on 8/12/14.// Copyright (c) 2014 itcast. All rights reserved.//#include#include#include#include#include#include#include#include#inclu
2014-08-12 14:35:58 747
原创 POJ 1015 DP
动态规划。 为叙述问题方便,现将任一选择方案中,辩方总分和控方总分之差简称为“辩控差”,辩方总分和控方总分之和称为“辩控和”。第i 个候选人的辩方总分和控方总分之差记为V(i),辩方总分和控方总分之和记为S(i)。现用dp(j, k)表示,取j 个候选人,使其辩控差为k 的所有方案中,辩控和最大的那个方案(该方案称为“方案dp(j, k)”)的辩控和。并且,我们还
2014-08-12 10:59:55 372
原创 HDU 1503 LCS 最长公共子串
//// main.cpp// HDU 1503 LCS 最长公共子串//// Created by 郑喆君 on 8/11/14.// Copyright (c) 2014 itcast. All rights reserved.//#include#include#include#include#include#include#include#includ
2014-08-11 18:11:42 395
原创 HDU 3664 DP
//// main.cpp// HDU 3664 DP//// Created by 郑喆君 on 8/11/14.// Copyright (c) 2014 itcast. All rights reserved.//#include#include#include#include#include#include#include#include#inclu
2014-08-11 15:34:17 382
原创 HDU 4859 最大流最小割经典题目
//// main.cpp// HDU 4859 最大流最小割//// Created by 郑喆君 on 8/10/14.// Copyright (c) 2014 itcast. All rights reserved.//#include#include#include#include#include#include#include#include#i
2014-08-10 16:10:24 663
原创 BestCoder #1-1 HDU 4857 逆拓扑排序
//// main.cpp// HDU 4857 拓扑排序//// Created by 郑喆君 on 8/9/14.// Copyright (c) 2014 itcast. All rights reserved.//#include#include#include#include#include#include#include#include#incl
2014-08-09 15:57:50 364
原创 KMP模板
#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;char cs[110][110];int f[110];void fail (char p[]){ memset(f, 0, sizeof(f))
2014-08-09 00:22:00 360
原创 AC自动机模板
#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int n,sz;int ch[1100][4],f[1100],val[1100],last[1100];void insert (char* c){
2014-08-09 00:20:20 368
原创 HDU 3666 差分约束+判断有没有负环
//// main.cpp// HDU 3666 差分约束//// Created by 郑喆君 on 8/8/14.// Copyright (c) 2014 itcast. All rights reserved.//#include#include#include#include#include#include#include#include#incl
2014-08-08 22:25:03 438
原创 POJ 1201 差分约束
//// main.cpp// POJ 1201 差分约束//// Created by 郑喆君 on 8/8/14.// Copyright (c) 2014 itcast. All rights reserved.//#include#include#include#include#include#include#include#include#incl
2014-08-08 21:19:48 294
原创 POJ 3159 差分约束+迪杰斯特拉+优先队列 图的数据结构用数组表示
#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long LL;const int int_max = 0x07777777;const int int_min = 0x8000
2014-08-08 17:30:55 347
原创 POJ 1364 差分约束
一直不知道差分约束是什么类型题目,最近在写最短路问题就顺带看了下,原来就是给出一些形如x-y好神奇的是这类问题竟然可以转换成图论里的最短路径问题,下面开始详细介绍下比如给出三个不等式,b-a由题我们可以得知,这个有向图中,由题b-a根据以上的解法,我们可能会猜到求解过程实际就是求从a到c的最短路径,没错的....简单的说就是从a到c沿着某条路径后把所有权值和
2014-08-08 15:53:50 318
原创 HDU 3018 欧拉回路 笔画数问题
Ant TripTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1567 Accepted Submission(s): 609Problem DescriptionAnt Country consis
2014-08-08 10:33:54 463
原创 欧拉回路和欧拉路径求法 dfs递归模板
#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long LL;const int int_max = 0x07777777;const int int_min = 0x8000
2014-08-07 22:54:29 1864
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人