- 博客(14)
- 收藏
- 关注
原创 MongoDB oplog
http://francs3.blog.163.com/blog/static/4057672720121133328120/
2014-05-28 07:46:13 397
原创 MongoDB connection
For mongo db adapter, you should enable the replication in MongoDB. 1. Start MongoDB server with replication enabled../mongod --dbpath= --replset "rs0"keep this MongoDb server runnin
2014-05-28 07:45:03 436
原创 Flatten a nested directory in Linux
You can do this with GNU find and GNU mv:find /dir1 -mindepth 2 -type f -exec mv -t /dir1 -i '{}' +Basically, the way that works if that find goes through the entire directory tree and for each f
2014-05-25 07:13:14 387
原创 Search Insert Position
Search Insert Position Total Accepted: 8665 Total Submissions: 25364My SubmissionsGiven a sorted array and a target value, return the index if the target is found. If not, return the ind
2014-02-21 09:50:04 347
原创 Remove Duplicates from Sorted List II
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.For example,Given 1->2->3->3->4->4->5, return 1->2->5.Given 1->1->1
2014-02-21 09:48:33 460
原创 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
2014-02-21 09:23:17 349
原创 Median of Two Sorted Arrays
public class Solution { public double findMedianSortedArrays(int A[], int B[]) { // IMPORTANT: Please reset any member data you declared, as // the same Solution instance will be r
2013-12-24 12:07:03 277
原创 Install Subversion client
Link: http://www.cnblogs.com/lidabo/archive/2011/08/12/2136063.htmlClient name: TortoiseSVN
2013-06-25 04:56:13 628
原创 Mahout-Kmeans MR
Mapper (ClusterClassificationMapper.java) protected void setup(Context context) throws IOException, InterruptedException { super.setup(context); Configuration conf = context.getConfig
2013-06-19 14:25:48 500
转载 Mahout-mean shift
3.Mean Shift 聚类 Mean Shift 聚类原理(1). 欧式空间 X 中,有一个有限点的集合 S 。 K 是一个 flat 核,即 简单说来, K 标记 x 是否在以原点为圆心,半径为 lamda 的球体内。 (2). 在 x 处的样本均值表示为 即在以 x 为圆心的球体内所有样本点的均值,而 m(x) –x 即是传说中的“均值飘移”,而
2013-06-19 07:30:50 567
转载 Mahout-Canopy
1.Canopy聚类 Canopy聚类是一种简单、快速、但不太准确的聚类方法。 该算法需一种快速的近似距离度量方法和两个距离阈值T1>T2。while(没有标记的数据点){ 选择一个没有强标记的数据点p 把p看作一个新Canopy c的中心 离p距离 离p距离}Canopy聚类常作为更强聚类方法的初始步骤。mahout
2013-06-19 07:30:09 361
转载 Mahout-Kmeans
2.Kmeans聚类 Kmeans算法思想也比较简单 :可见http://baike.baidu.com/view/3447609.htm首先从n个数据对象选择 k 个对象作为初始聚类中心;而对于所剩下其它对象,则根据它们与这些聚类中心的相似度(距离),分别将它们分配给与其最相似的(聚类中心所代表的)聚类;然后再计算每个所获新聚类的聚类中心(该聚类中所有对象的均值);不断重
2013-06-19 07:27:54 539
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人