机器学习（Machine Learning and Data Mining）CS 5751——final复习记录(2)

最新推荐文章于 2023-03-16 09:13:55 发布
最新推荐文章于 2023-03-16 09:13:55 发布
阅读量263 收藏
点赞数
分类专栏： machine learning
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/yinxx325/article/details/84950984
版权

机器学习（Machine Learning and Data Mining）CS 5751——final复习记录 因为是整理来给自己看的，所以都是大纲……


因为是整理来给自己看的，所以都是大纲……

关联规则挖掘

Association Rule Mining
给定一组transactions, 寻找rules，根据其他items来预测item的出现。
support和confidence
在这里插入图片描述
关联挖掘在于找出所有满足条件的关联规则：
（1）support大于minsup threshold
（2）confidence大于minconf threshold
具体步骤：
（1）frequent itemset generation
[找出频率大于minsup的itemsets]
（2）rule generation
[从binary partitioning里找出高confidence的规则]

关联性挖掘的问题

复杂度：O（NMw）
N:number of transactions[可以用DHP和vertical-based挖掘算法]
N:number of candidates【2^d】[修剪pruning]
reduce NM:使用高效的存储方法

处理问题：Apriori principle

Apriori principle：如果一个Itemset是频繁的的，那么他的子集也是频繁的。
也被

最低0.47元/天 解锁文章
yinxx325
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
机器学习（Machine Learning and Data Mining）CS 5751——final复习记录(1)
留学狗的学习记录
03-14 433
xxx
机器学习（Machine Learning and Data Mining）CS 5751——final复习记录(3)
留学狗的学习记录
03-14 214
机器学习（Machine Learning and Data Mining）CS 5751——final复习记录 因为是整理来给自己看的，所以都是大纲……强化学习Reinforcement Learning1.11.31.42.1 因为是整理来给自己看的，所以都是大纲…… 强化学习Reinforcement Learning 是一种交互中学习的计算方法，探索理想化的学习情境并评估各种学习方法的有效...
数据挖掘(data mining)，机器学习(machine learning)，和人工智能(AI)的区别是什么？ 数据科学(data science)和商业分析(business analytics...
weixin_33932129的博客
08-06 1549
本来我以为不需要解释这个问题的，到底数据挖掘(data mining)，机器学习(machine learning)，和人工智能(AI)有什么区别，但是前几天因为有个学弟问我，我想了想发现我竟然也回答不出来，我在知乎和博客上查了查这个问题，发现还没有人写过比较详细和有说服力的对比和解释。那我根据以前读的书和论文，还有和与导师之间的交流，尝试着说一说这几者的区别吧，毕竟一个好的定义在未来的学习和...
Machine Learning and Data Mining（机器学习与数据挖掘）
weixin_30512785的博客
01-22 2145
Problems[show] Classification Clustering Regression Anomaly detection Association rules Reinforcement learning Structured prediction Feature engineering Feature learning Online lea...
Machine learning and data mining
weixin_33827731的博客
04-24 156
Problems:Classification, Clustering, Regression, Anomaly detection, Association rules,Reinforcement learning, Structurd prediction, Feature learning, Online learning,Semi-supervised learnin...
Machine Learning and Data Mining for Computer Security
09-05
Intrusion detection and analysis has received a lot of criticism and publicity over the last several years. The Gartner report took a shot saying Intrusion Detection Systems are dead, while others believe Intrusion Detection is just reaching its maturity. The problem that few want to admit is that the current public methods of intrusion detection, while they might be mature, based solely on the fact they have been around for a while, are not extremely sophisticated and do not work very well. While there is no such thing as 100% security, people always expect a technology to accomplish more than it currently does, and this is clearly the case with intrusion detection. It needs to be taken to the next level with more advanced analysis being done by the computer and less by the human. The current area of Intrusion Detection is begging for Machine Learning to be applied to it. Convergence of these two key areas is critical for it to be taken to the next level. The problem is that I have seen little research focusing on this, until now. After reading Machine Learning and Data Mining for Computer Security, I feel Dr Maloof has hit the target dead centre. While much research has been done across Computer Security independently and Machine Learning independently, for some reason no one wanted to cross-breed the two topics. Dr Maloof not only did a masterful job of focusing the book on a critical area that was in dire need of research, but he also strategically picked papers that complemented each other in a productive manner. Usually reading an edited volume like this, the chapters are very disjointed with no connection between them. While these chapters cover different areas of research, there is a hidden flow that complements the previous chapter with the next. While Dr Maloof points out in his Preface the intended audience, I feel that there are two additional critical groups. Firstly, I feel that any vendor or solution provider that is looking to provide a competitive a
Encyclopedia of Machine Learning and Data Mining 2nd.Edition.pdf
04-17
This authoritative, expanded and updated second edition of Encyclopedia of Machine Learning and Data Mining provides easy access to core information for those seeking entry into any aspect within the ...
Encyclopedia of Machine Learning and Data Mining(2nd) 中文 part7
01-26
此为：Encyclopedia of Machine Learning and Data Mining(2nd) 中文版 part7。 对照英文：https://download.csdn.net/download/u012547148/10938335
Data Analysis, Machine Learning and Applications
03-19
作者: Preisach, Christine (EDT)/ Burkhardt, Hans (EDT)/ Schmidt-thieme, Lars (EDT) 出版社: Springer Berlin Heidelberg 副标题: Proceedings of the 31st Annual Conference of the Gesellschaft für Klassifikation e.V., ... Data Analysis, and Knowledge Organization) 出版年: 2008-10-10 页数: 736 ISBN: 9783540782391
Principles And Theory For Data Mining And Machine Learning
08-29
Springer出版的2009的新书 作者: Bertrand Clarke · Ernest Fokou´ e · Hao Helen Zhang
Data Mining & Machine Learning学习笔记 机器学习入门笔记（一）
刘滨浩的博客
01-11 1249
Data Mining and Machine Learning L1.Information Retrieval(信息检索) （Focus on Text Retrieval）定义：大量文本集中找出和查询语句相关性最强的信息。 第一章 Moore’s Law:Technology performance doubles and prices halve every 18 months. Disk...
机器学习（Machine Learning and Data Mining）CS 5751——Lab1作业记录
留学狗的学习记录
10-21 193
机器学习（Machine Learning and Data Mining）CS 5751——Lab1作业记录Activity3Another method to do Activity3Activity4 Activity3 绘制散点图矩阵，显示属性之间的相关性： mpg，hp，disp，drat，wt，qsec。 使用散点图，评论哪些属性对具有最高的相关性。 plot(mtcars$wt, m...
机器学习（Machine Learning and Data Mining）CS 5751——mid1复习记录
留学狗的学习记录
03-14 276
机器学习（Machine Learning and Data Mining）CS 5751——mid1复习记录(1)基础定义什么是data?四种类型的属性Categorical (Qualitative)Numeric (Quantitative)属性类型的判断：四种操作分别的判断离散与连续离散属性连续属性数据质量(2)具体考点（PPT-2）距离二元向量之间的相似性数据预处理降低维度决策树 (1)...
数据挖掘之关联规则挖掘的一些定义
最新发布
Dove_1234的博客
03-16 859
有一个简单而粗鲁的方法可以找出所需要的规则，那就是穷举项集的所有组合，并测试每个组合是否满足条件，一个元素个数为n的项集的组合个数为2^n-1(除去空集)，所需要的时间复杂度明显为O(2^N)，对于普通的超市，其商品的项集数也在1万以上，用指数时间复杂度的算法不能在可接受的时间内解决问题。注意，如果一个频繁项集是{A,B}，那么可能的一个关联规则是A->B,说明某人买了A，大概率也会买B，但顺序反过来是不成立的。3、计算所有的关联规则的置信度，移除小于最小置信度的规则，得到强关联规则。
数据挖掘2.4——关联规则挖掘 知识点整理
定期分享我的发现和想法，感谢你的陪伴和支持
05-14 7602
1.基本概念1.1定义 2.频繁项挖掘算法2.1降低产生频繁顷集计算复杂度的算法2.2 Apriori2.3 FPGrowth2.4 产生关联规则 3.关联分析的评估
[翻译]机器学习之啤酒与纸尿裤-Association Rules and Apriori algorithm
weixin_42692506的博客
09-01 814
原文链接：https://towardsdatascience.com/association-rules-2-aa9a77241654 在营销界，一直流传有一个著名的“纸尿裤”案例：沃尔玛对旗下一家超市销售数量进行设定跟踪，发现一个奇怪现象，啤酒与尿不湿的销量在周末会出现成比例增长。超市对这个现象进行分析和讨论，并派出专员在卖场进行全天候观察。最后，谜底终于水落石出，发现啤酒和尿不湿多为男人在周末采购，而且购买这两种产品的顾客一般都是年龄在25至35周岁的青年男子，由于孩子尚在哺乳期，多数男...
实战机器学习：Machine Learning in Action解析
"Machine Learning in Action 是一本由Peter Harrington编著的关于机器学习的最佳实践书籍，由Manning出版社出版。本书深入浅出地探讨了机器学习的实际应用，并涵盖了人工智能的相关主题。" 《Machine Learning in ...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值