期刊文献+

概率数据中的频繁项挖掘

Mining Frequent Items in Probabilistic Data
下载PDF
导出
摘要 概率数据是从很多隐含模糊数据或不确定的数据的数据资源中生存的数据,而在概率数据上计算统计信息也已经引起了广泛的关注。频繁项挖掘是概率数据上的一个重要的统计查询内容,它也是很多研究工作的基础。使用项的期望频繁度来判断频繁项会丢失概率数据内部结构的重要信息,本文介绍一种被许多概率数据中查询管理采用的定义来发现所有的频繁项。 Computing statistical information on probabilistic data has attracted a lot of attention, as the data generated from a wide range of data sources are inherently fuzzy of uncertain. Finding the frequent items is an important statistical query on probabilistic data. And it is the basic work of many researches. However, deciding whether an item is a fre- quent item by expected frequency of an item misses important information about the internal structure of the probabilistic data. In this paper, we study a definition that has been widely adopted for many query management on probabilistie da- ta, trying to find all the frequent items.
作者 陈凤娟
出处 《贵阳学院学报(自然科学版)》 2015年第4期15-17,共3页 Journal of Guiyang University:Natural Sciences
关键词 概率数据 期望频繁度 频繁项 Prohabilistic Data Expected Frequency Frequent Items
  • 相关文献

参考文献8

  • 1R.Agrawal,R.Srikant,"Fast algorithms for mining as- sociation rules," in VLDB,1994.
  • 2L.K.Lee and H.F.Ting." A simpler and more efficient deterministic scheme for finding frequent items over sliding windows",In PODS,2006.
  • 3O.Benjelloun,A.D.Sarma." ULDBs:databases with uncertainty and lineage,"In VLDB,2006.
  • 4P.Agrawal,0.Benjelloun."Trio:A system for data,uncertainty,and lineage," InVLDB,2006.
  • 5C.Re,N.Dalvi,and D.Suciu." Efficient top-k query evaluation on probalistic databases," In ICDE,2007.
  • 6T.S.Jayram,A.McGregor."Estimating statistical ag- gregates onprobabilistic data streams," In PODS,2007.
  • 7N.Dalvi and D.Suciu."Efficient query evaluation on prob- abilistic databases,VLDB Journal,16(4):523-544,2007.
  • 8Q.Zhang,F.Li,K.Yi," Finding frequent items in probabilistic data," in SIGMOD,2008.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部