Mining approximate frequency itemsets over data streams based on D-Hash table

10th ACIS Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2009, In conjunction with IWEA 2009 and WEACR 2009

Volumn , Issue , 2009, Pages 249-254

  Chunhua, Ju ^a   Gang, You ^a  

^a ZHEJIANG GONGSHANG UNIVERSITY   (China)

Author keywords

D HT; Data stream; Frequent itemset; MFS HT

Indexed keywords

DATA STREAM; DATA STREAM MINING; FREQUENCY COUNTS; FREQUENT ITEMSET; FREQUENT ITEMSETS; FREQUENT PATTERNS; HASH TABLE; ITEM SETS; MATRIX; MEMORY FOOTPRINT; MINING ALGORITHMS; SPACE EFFICIENCIES; TIME AND SPACE; TIME EFFICIENCIES;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTER SOFTWARE; DATA COMMUNICATION SYSTEMS; DATA STRUCTURES; HYDRAULICS; MINING;

DATA MINING;

EID: 71249120113     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SNPD.2009.29     Document Type: Conference Paper

References (16)

1. Abdulla G, Critchow T, and Arrighi W, "Simulation Data as Data Streams", ACM SIGMOD Record, 2004, 33(1), pp.89-94
2. Gaber M M, Zaslavsky A, and Krishnaswamy S, "Mining data streams: A Revise". ACM SIGMOD Record, 2005, 34(2), pp.18-26
3. NanJiang, and Le Gruenwald, "Research Issues in Data Stream Association Rule Mining", ACM SIGMOD Record, 2006, 35(1), pp.14-19
4. C. Giannella, Jiawei Han, Jian Pei, Xifeng Yan, and P.S. Yu, "Mining Frequent Patterns in Data Streams at Multiple Time Granularities", The NSF Workshop on Next Generation Data Mining, November 2002.
5. Charikar M, K Chen, and Farach-Colton M, "Finding frequent items in data streams", Widmayer P, Ruiz FT, Bueno RM, Hennessy M, Eidenbenz S, Conejo R, eds. Proc. of the Int'l Colloquium on Automata, Languages and Programming, Springger-Verlag, 2002, pp.693-703.
6. Cormode G, and Muthukrishnan S, "What's hot and what's not: Tracking most frequent items dynamically", Halevy AY, Ives ZG, Doan AH, eds. Proc. of the 22nd ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems. ACM Press, 2003, pp.296-306
7. G.S. Manku and R. Motwani, "Approximate frequency, counts over data streams", Bernstein P, loannidis Y, Ramakrishnan R,eds. Proc. of the 28th Int'l Conf. on Very Large Data Bases. Hong Kong: Morgan Kaufmann Publishers, 2002, pp.346-357
8. Guojie Song, Tengjiao Wang, Shiwei Tang, et al, "Estimation and maintenance of frequent pattern in data streams", NDBC' 03, Changsha, 2003
9. Weiguang Teng, Mingsyan Chen, and Philip S. Yu, "A regressionbased temporal pattern mining scheme for data streams", The Int'l Conf. on Very large data bases, Berlin, Germany, 2003
10. Lei Wang, Zhiqu Huang, Xiaodong Zhu, et al, "Mining frequent itemsets over data stream by matrix", Journal of Frontiers of Computer Science and Technology, 2008, (23), pp.330-336
11. Xiaoyun Wang, Hongbo Yu, "How to Break MD5 and Other Hash Functions", EUROCRYPT, 2005
12. Marc Stevens, Arjen Lenstra and Benne de Weger, "Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities", Lecture Notes in Computer Science, Springer Berlin / Heidelberg, 2007(4515), pp.1-22
13. http://www.win.tue.nl/hashclash/rogue-ca/
14. Jiawei Han, Micheline Kamber "Data Mining-Concepts and Techniques", Morgan Kaufmann, 2007
15. Robert J. Jenkins Jr. "Hash Functions for Hash Table Lookup", http://burtleburtle.net/bob/hash/evahash.html
16. http://burtleburtle.net/bob/hash/funnels.html