Notice of Retraction: Mining top-k fault tolerant association rules by redundant pattern disambiguation in data streams

Proceedings - 2010 International Conference on Intelligent Computing and Cognitive Informatics, ICICCI 2010

Volumn , Issue , 2010, Pages 470-473

  You, Yuyang ^a   Jianpei, Zhang ^a   Yang, Zhihong ^b   Liu, Guocai ^c  

^a HARBIN ENGINEERING UNIVERSITY   (China)

^b INSTITUTE OF MEDICINAL PLANT DEVELOPMENT   (China)

^c CENTER FOR SPACE SCIENCE AND APPLIED RESEARCH   (China)

Author keywords

Data stream; Fault tolerant association rule; Negative itemset; Redundant pattern; Top k

Indexed keywords

ASSOCIATION RULES; FAULT TOLERANCE; INTELLIGENT COMPUTING;

FAULT-TOLERANT; FAULT-TOLERANT FREQUENT PATTERNS; ITEM SETS; ITEMSET; MINIMUM CONFIDENCE THRESHOLDS; MINIMUM SUPPORT THRESHOLDS; REAL-WORLD; REDUNDANT PATTERNS;

DATA STREAMS;

EID: 77958511702     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICICCI.2010.91     Document Type: TB

References (8)

1. A. K. Poernomo and V. Gopalkrishnan, "Mining statistical information of frequent fault-tolerant patterns in transactional databases," Data Mining (DM 07), Oct. 2007, pp. 272-281, Doi: 10.1109/ICDM.2007.48.
2. X. Wu, C. Zhang, and S. Zhang, "Efficient mining of both positive and negative association rules," ACM Transactions on Information Systems, Vol. 22, July 2004, pp. 381-405, Doi: 10.1145/1010614.1010616.
3. O. Daly and D. Taniar, "Exception Rules Mining Based On Negative Association Rules," Lecture Notes in Computer Science, Vol. 3046, Apr. 2004, pp 543-552, doi:10.1007/b98054. (Pubitemid 38761476)
4. Y. Y. Zhao and H. Jiang, "Research of Mining Positive and Negative Weighted Association Rules Based on Chi-Squared Analysis," International Conference on Distributed Computing and Applications for Business (ICIC 09), May 2005, pp. 344-347, Doi: 10.1109/ICIC.2009.94.
5. H. Li and X. G. Hu, "Efficient mining of strong negative association rules in multi-database," Computational Intelligence and Software Engineering (CISE 09), Dec. 2009, pp.1-4, Doi: 10.1109/CISE.2009.5364801.
6. M. Charikara, K. Chenb, and M. F. Coltone, "Finding frequent items in data streams," Theoretieal Computer Science, Vol. 312, Jan. 2004, pp. 3-15, Doi:10.1016/S0304-3975(03)00400-6.
7. C. C. Aggarwal and P. S. Yu, "A New Approach to Online Generation of Association Rules," IEEE Transactions on Knowledge and Data Engineering (ITKDE 01), Aug. 2001, pp. 527-540, Doi: 10.1109/69.940730. (Pubitemid 32828740)
8. G. H. Li and H. Chen, "Mining the frequent patterns in an arbitrary sliding window over online data streams," Journal of Software, Vol.19, No.10, Oct. 2008, pp. 2585-2596, Doi: 10.3724/SP.J.1001.2008.02585.