newolivar0.docx
《newolivar0.docx》由会员分享,可在线阅读,更多相关《newolivar0.docx(64页珍藏版)》请在冰豆网上搜索。
newolivar0
setwd("E:
/TBrelated/Service/2016/318newolivar")
library(arules)#读取arules软件包
a_df3=read.csv("ppp1.csv")
head(a_df3)
##Xabcdefg
##1date13112111
##2date21221221
##3date31122212
##4date42122212
##5date52111121
##6date61123211
#将数据转化成交易数据
a_df3=a_df3[,-1]
#设置时间间隔
interval=2
rawdata=a_df3
#筛选时间跨度数据
for(nin1:
floor(nrow(rawdata)/interval)){
a_df3=rawdata[((n-1)*interval+1):
(n*interval),]
##setdimnames
a_df3=unlist(a_df3)
a_df3=matrix(a_df3,ncol=7)
a_df3=t(a_df3)
dimnames(a_df3)<-list(c("a","b","c","d","e","f","g"),
paste("Tr",c(1:
ncol(a_df3)),sep=""))
a_df3=t(a_df3)
a_df3=a_df3-1
##coerce
trans2<-as(a_df3,"transactions")
trans2
#inspect(trans2)
#查看数据结构
dat1=trans2
#查看部分交易数据
#inspect(dat1[1:
5])
#查看每个商品的出现频率
par(mfrow=c(1,1))
itemFrequencyPlot(dat1,support=0.02,cex.names=0.8)
#可以看到每个物品出现的频率,从而判断哪些物品的支持度较高
frequentsets=eclat(dat1,parameter=list(support=0.02,maxlen=10))
#得到频繁规则挖掘
#inspect(frequentsets[1:
5])
#察看求得的频繁项集
#
#inspect(sort(frequentsets,by="support")[1:
5])
#根据支持度对求得的频繁项集排序并察看(等价于inspect(sort(frequentsets)[1:
10])
####关联规则挖掘
#建立模型
rules=apriori(dat1,parameter=list(support=0.01,confidence=0.3))#求关联规则
#设置支持度为0.01,置信度为0.3
summary(rules)#查看规则
#查看部分规则
inspect(head(rules))
#查看置信度支持度和提升度
quality(head(rules))
#安装arules可视化包
#install.packages("arulesViz")
library(arulesViz)
#绘制不同规则图形来表示支持度,置信度和提升度
par(mfrow=c(1,1))
plot(rules,method="grouped")
#同过改图可以看到规则前项和规则后项分别有哪些物品以及每个物品
#的支持度大小,支持度越大则圆圈越大。
plot(rules,method="graph")
plot(rules,method=NULL,
measure="support",shading="lift",interactive=FALSE)
#从该图可以看到支持度和置信度的关系,置信度越高提升度也越高
plot(rules)
plot(rules,measure=c("support","lift"),shading="confidence")
#从该图可以看到支持度和置信度的关系,提升度越高置信度也越高
plot(rules,method="matrix3D",measure="lift")
plot(rules,method="graph")
#从上图可以看到不同物品之间的关联关系图中的点越大说明该物品的支持度越高
#颜色越深说明该物品的提升度越高。
#plot(rules,method="doubledecker")
#查看最高的支持度样本规则
rules<-sort(rules,by="support")
inspect(head(rules,n=10))
#查看最高置信度样本规则
rules<-sort(rules,by="confidence")
inspect(head(rules,n=10))
rules<-sort(rules,by="lift")
#查看最高提升度样本规则
inspect(head(rules,n=10))
x=subset(rules,subset=confidence>0.3&support>0.01&lift>=1)#得到有价值规则子集
#查看规则数
x
summary(x)
inspect(sort(x,by="support"))#按照支持度排序
inspect(sort(x,by="confidence"))#按照置信度排序
###对有价值的x集合进行数据可视化
par(mfrow=c(1,2))
plot(x,method="grouped")
plot(x,method="graph")
}
##Settingallentries!
=0to1.
##Eclat
##
##parameterspecification:
##tidListssupportminlenmaxlentargetext
##FALSE0.02110frequentitemsetsFALSE
##
##algorithmiccontrol:
##sparsesortverbose
##7-2TRUE
##
##Absoluteminimumsupportcount:
0
##Warningineclat(dat1,parameter=list(support=0.02,maxlen=10)):
Youchoseaverylowabsolutesupportcountof0.Youmightrunoutofmemory!
Increaseminimumsupport.
##createitemset...
##settransactions...[6item(s),2transaction(s)]done[0.00s].
##sortingandrecodingitems...[6item(s)]done[0.00s].
##creatingbitmatrix...[6row(s),2column(s)]done[0.00s].
##writing...[18set(s)]done[0.00s].
##CreatingS4object...done[0.00s].
##Apriori
##
##Parameterspecification:
##confidenceminvalsmaxaremavaloriginalSupportsupportminlenmaxlen
##0.30.11noneFALSETRUE0.01110
##targetext
##rulesFALSE
##
##Algorithmiccontrol:
##filtertreeheapmemoptloadsortverbose
##0.1TRUETRUEFALSETRUE2TRUE
##
##Absoluteminimumsupportcount:
0
##Warninginapriori(dat1,parameter=list(support=0.01,confidence=0.3)):
Youchoseaverylowabsolutesupportcountof0.Youmightrunoutofmemory!
Increaseminimumsupport.
##setitemappearances...[0item(s)]done[0.00s].
##settransactions...[6item(s),2transaction(s)]done[0.00s].
##sortingandrecodingitems...[6item(s)]done[0.00s].
##creatingtransactiontree...done[0.00s].
##checkingsubsetsofsize1234done[0.00s].
##writing...[36rule(s)]done[0.00s].
##creatingS4object...done[0.00s].
##lhsrhssupportconfidencelift
##1{}=>{a}0.50.51
##2{}=>{d}0.50.51
##3{}=>{b}0.50.51
##4{}=>{c}0.50.51
##5{}=>{e}0.50.51
##6{}=>{f}0.50.51
##Warning:
package'arulesViz'wasbuiltunderRversion3.2.4
##Loadingrequiredpackage:
grid
##Warning:
replacingpreviousimportby'utils:
:
head'whenloading
##'arulesViz'
##ItemsetsinAntecedent(LHS)
##[1]"{}""{a}""{d}""{b}""{c}""{e}""{f}"
##[8]"{b,c}""{b,e}""{c,e}""{b,f}""{c,f}""{e,f}""{b,c,e}"
##[15]"{b,c,f}""{b,e,f}""{c,e,f}"
##ItemsetsinConsequent(RHS)
##[1]"{a}""{d}""{b}""{c}""{e}""{f}"
##lhsrhssupportconfidencelift
##1{}=>{a}0.50.51
##2{}=>{d}0.50.51
##3{}=>{b}0.50.51
##4{}=>{c}0.50.51
##5{}=>{e}0.50.51
##6{}=>{f}0.50.51
##7{a}=>{d}0.51.02
##8{d}=>{a}0.51.02
##9{b}=>{c}0.51.02
##10{c}=>{b}0.51.02
##lhsrhssupportconfidencelift
##7{a}=>{d}0.512
##8{d}=>{a}0.512
##9{b}=>{c}0.512
##10{c}=>{b}0.512
##11{b}=>{e}0.512
##12{e}=>{b}0.512
##13{b}=>{f}0.512
##14{f}=>{b}0.512
##15{c}=>{e}0.512
##16{e}=>{c}0.512
##lhsrhssupportconfidencelift
##7{a}=>{d}0.512
##8{d}=>{a}0.512
##9{b}=>{c}0.512
##10{c}=>{b}0.512
##11{b}=>{e}0.512
##12{e}=>{b}0.512
##13{b}=>{f}0.512
##14{f}=>{b}0.512
##15{c}=>{e}0.512
##16{e}=>{c}0.512
##lhsrhssupportconfidencelift
##7{a}=>{d}0.51.02
##8{d}=>{a}0.51.02
##9{b}=>{c}0.51.02
##10{c}=>{b}0.51.02
##11{b}=>{e}0.51.02
##12{e}=>{b}0.51.02
##13{b}=>{f}0.51.02
##14{f}=>{b}0.51.02
##15{c}=>{e}0.51.02
##16{e}=>{c}0.51.02
##17{c}=>{f}0.51.02
##18{f}=>{c}0.51.02
##19{e}=>{f}0.51.02
##20{f}=>{e}0.51.02
##21{b,c}=>{e}0.51.02
##22{b,e}=>{c}0.51.02
##23{c,e}=>{b}0.51.02
##24{b,c}=>{f}0.51.02
##25{b,f}=>{c}0.51.02
##26{c,f}=>{b}0.51.02
##27{b,e}=>{f}0.51.02
##28{b,f}=>{e}0.51.02
##29{e,f}=>{b}0.51.02
##30{c,e}=>{f}0.51.02
##31{c,f}=>{e}0.51.02
##32{e,f}=>{c}0.51.02
##33{b,c,e}=>{f}0.51.02
##34{b,c,f}=>{e}0.51.02
##35{b,e,f}=>{c}0.51.02
##36{c,e,f}=>{b}0.51.02
##1{}=>{a}0.50.51
##2{}=>{d}0.50.51
##3{}=>{b}0.50.51
##4{}=>{c}0.50.51
##5{}=>{e}0.50.51
##6{}=>{f}0.50.51
##lhsrhssupportconfidencelift
##7{a}=>{d}0.51.02
##8{d}=>{a}0.51.02
##9{b}=>{c}0.51.02
##10{c}=>{b}0.51.02
##11{b}=>{e}0.51.02
##12{e}=>{b}0.51.02
##13{b}=>{f}0.51.02
##14{f}=>{b}0.51.02
##15{c}=>{e}0.51.02
##16{e}=>{c}0.51.02
##17{c}=>{f}0.51.02
##18{f}=>{c}0.51.02
##19{e}=>{f}0.51.02
##20{f}=>{e}0.51.02
##21{b,c}=>{e}0.51.02
##22{b,e}=>{c}0.51.02
##23{c,e}=>{b}0.51.02
##24{b,c}=>{f}0.51.02
##25{b,f}=>{c}0.51.02
##26{c,f}=>{b}0.51.02
##27{b,e}=>{f}0.51.02
##28{b,f}=>{e}0.51.02
##29{e,f}=>{b}0.51.02
##30{c,e}=>{f}0.51.02
##31{c,f}=>{e}0.51.02
##32{e,f}=>{c}0.51.02
##33{b,c,e}=>{f}0.51.02
##34{b,c,f}=>{e}0.51.02
##35{b,e,f}=>{c}0.51.02
##36{c,e,f}=>{b}0.51.02
##1{}=>{a}0.50.51
##2{}=>{d}0.50.51
##3{}=>{b}0.50.51
##4{}=>{c}0.50.51
##5{}=>{e}0.50.51
##6{}=>{f}0.50.51
##Eclat
##
##parameterspecification:
##tidListssupportminlenmaxlentargetext
##FALSE0.02110frequentitemsetsFALSE
##
##algorithmiccontrol:
##sparsesortverbose
##7-2TRUE
##
##Absoluteminimumsupportcount:
0
##Warningineclat(dat1,parameter=list(support=0.02,maxlen=10)):
Youchoseaverylowabsolutesupportcountof0.Youmightrunoutofmemory!
Increaseminimumsupport.
##createitemset...
##settransactions...[5item(s),2transaction(s)]done[0.00s].
##sortingandrecodingitems...[5item(s)]done[0.00s].
##creatingbitmatrix...[5row(s),2column(s)]done[0.00s].
##writing...[31set(s)]done[0.00s].
##CreatingS4object...done[0.00s].
##Apriori
##
##Parameterspecification:
##confidenceminvalsmaxaremavaloriginalSupportsupportminlenmaxlen
##0.30.11noneFALSETRUE0.01110
##targetext
##rulesFALSE
##
##Algorithmiccontrol:
##filtertreeheapmemoptloadsortverbose
##0.1TRUETRUEFALSETRUE2TRUE
##
##Absoluteminimumsupportcount:
0
##Warninginapriori(dat1,parameter=list(support=0.01,confidence=0.3)):
Youchoseaverylowabsolutesupportcountof0.Youmightrunoutofmemory!
Increaseminimumsupport.
##setitemappearances...[0item(s)]done[0.00s].
##settransactions...[5item(s),2transaction(s)]done[0.00s].
##sortingandrecodingitems...[5item(s)]done[0.00s].
##creatingtransactiontree...done[0.00s].
##checkingsubsetsofsize12345done[0.00s].
##writing...[80rule(s)]done[0.00s].
##creatingS4object...done[0.00s].
##lhsrhssupportconfidencelift
##1{}=>{a}0.50.51
##2{}=>{d}1.01.01
##3{}=>{e}1.01.01
##4{}=>{g}1.01.01
##5{}=>{c}1.01.01
##6{a}=>{d}0.51.01
##ItemsetsinAntecedent(LHS)
##[1]"{}""{a}""{d}""{e}""{g}"
##[6]"{c}""{a,d}""{a,e}""{d,e}""{a,g}"
##[11]"{d,g}""{a,c}""{c,d}""{e,g}""{c,