1 用通俗的语言介绍下线性回归->逻辑回归->SVM之间的区别和联系。

2 聚类算法的应用场景,以及k-means中的k值怎么确定。

 def center(data):

     center = []
for num in data:
sumX = 0; sumY = 0
for j in num:
sumX += j[0]
sumY += j[1]
x = float(sumX) / len(data)
y = float(sumY) / len(data)
center.append([x, y]) return center def distance(one, two): sumT = 0
for i in range(len(one)):
sumT += pow((one[i] - two[i]), 2) return pow(sumT, 0.5) def update(data, kcenter): length = len(kcenter)
ret = [0] * length
for i in range(length):
ret[i] = [] for num in data:
tmp = []
for point in kcenter:
tmp.append(distance(num, point))
ret[tmp.index(min(tmp))].append(num) return ret if __name__ == '__main__': data = [(1, 2), (2, 3), (1, 6), (8, 9)]
kcenter = [[0.2, 1.2], [2, 3]]
error = 0.0000001 while True:
rt = update(data, kcenter)
tmp = center(rt)
sume = 0
for sa in range(len(kcenter)):
sume += distance(tmp[sa], kcenter[sa])
if sume < error:
print rt
break
else:
kcenter = tmp

Kmeans

3 协同过滤中评分矩阵中的元素怎么确定。大矩阵怎么分解。

4 文本挖掘怎么处理。

data and dream的更多相关文章

  1. Django——Ajax相关

    Ajax简介 AJAX(Asynchronous Javascript And XML)翻译成中文就是“异步Javascript和XML”.即使用Javascript语言与服务器进行异步交互,传输的数 ...

  2. 【Repost】A Practical Intro to Data Science

    Are you a interested in taking a course with us? Learn about our programs or contact us at hello@zip ...

  3. UVA - 10057 A mid-summer night&#39;s dream.

    偶数时,中位数之间的数都是能够的(包含中位数) 奇数时,一定是中位数 推导请找初中老师 #include<iostream> #include<cstdio> #include ...

  4. Dream team: Stacking for combining classifiers梦之队:组合分类器

     sklearn实战-乳腺癌细胞数据挖掘(博主亲自录制视频) https://study.163.com/course/introduction.htm?courseId=1005269003& ...

  5. 每日英语:The Risks of Big Data for Companies

    Big data. It's the latest IT buzzword, and it isn't hard to see why. The ability to parse more infor ...

  6. [Poj2411]Mondriaan's Dream(状压dp)(插头dp)

    Mondriaan's Dream Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 18096   Accepted: 103 ...

  7. How Google Backs Up The Internet Along With Exabytes Of Other Data

    出处:http://highscalability.com/blog/2014/2/3/how-google-backs-up-the-internet-along-with-exabytes-of- ...

  8. POJ1185 炮兵阵地 和 POJ2411 Mondriaan's Dream

    炮兵阵地 Language:Default 炮兵阵地 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 34008 Accepted ...

  9. Dream权限追踪系统<=2.0.1 重安装漏洞

    在./install/install.php中 if(file_exists('lock.txt')){ echo '系统已安装,请不要重复安装!如需安装,请删除install文件夹下的lock.tx ...

随机推荐

  1. 【BZOJ-1103】大都市meg 树状数组 + DFS序

    1103: [POI2007]大都市meg Time Limit: 10 Sec  Memory Limit: 162 MBSubmit: 2009  Solved: 1056[Submit][Sta ...

  2. 数据结构算法C语言实现(二)---2.3线性表的链式表示和实现之单链表

    一.简述 [暂无] 二.头文件 #ifndef _2_3_part1_H_ #define _2_3_part1_H_ //2_3_part1.h /** author:zhaoyu email:zh ...

  3. C++ 参考网站

    Reference Web cites for the C++ standard library cppreference cplusplus sgi IBM MSDN isocpp More res ...

  4. 爬虫例子及知识点(scrapy知识点)

    新知识: 新建一个scrapy项目:scrapy startproject xxx(项目名称) 运行一个scrapy项目:scrapy crawl xxx(项目名称) 项目文件说明: 文件说明: • ...

  5. Mysql学习笔记(二)对表结构的增删改查

    有将近一个星期都没有更新mysql了.相反linux的东西倒是学习不少.可能我个人情感上对linux更感兴趣一点.但mysql我也不烦,只是一旦将精力投入到了一样事情上去,就很难将精力分散去搞其他的东 ...

  6. BZOJ4446: [Scoi2015]小凸玩密室

    用ui,j表示走完i的子树后走到i的深度为j的祖先的兄弟的最小代价: 用vi,j表示走完i的子树后走到i的深度为j的祖先的最小代价,用u算出v. 枚举起点,计算答案. #include<bits ...

  7. 生成N个二进制位的组合

    #include "stdafx.h" #include "stdlib.h" #include "stdio.h" #include &l ...

  8. C#验证子网掩码的正确性

    1.       IP合法关于IP地址的合法性验证很简单,方法也很多,比如字符串分解.正则表达式等. 2.       子网掩码是否合法简单来讲,子网掩码就类似这样一串数字,前面一段是连续的1, 类似 ...

  9. Which is the best opencv or matlab for image processing?

    http://www.researchgate.net/post/Which_is_the_best_opencv_or_matlab_for_image_processing Annette Mor ...

  10. Unity3D Animation Curve

    http://docs.unity3d.com/430/Documentation/Manual/UsingAnimCurves.html