Algorithms of Frequent Item Sets Mining for Uncertain Data
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Uncertain data exists in many situations, such as sensor networks, mobile computing, military, telecommunications and other applications, which makes it difficult to apply traditional algorithms to mining frequent item sets. To deal with these situations, we propose an efficient algorithm based on possible world model with single scan of database. The algorithm works well without any tree construction. Experimental results show that the efficiency of our algorithm is better than UF_Growth.

    Reference
    Related
    Cited by
Get Citation

张常品,刘广钟.不确定性数据频繁项集挖掘算法.计算机系统应用,2014,23(11):160-164

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:March 13,2014
  • Revised:April 14,2014
  • Adopted:
  • Online: November 20,2014
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063