Discovery of frequent patterns in transactional data streams

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6380 LNCS, Issue , 2010, Pages 1-30

  Ng, Willie ^a   Dash, Manoranjan ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE COUNTING; BENCHMARK DATASETS; DATA STREAM; DYNAMIC ENVIRONMENTS; EMPIRICAL COMPARISON; FREQUENT PATTERNS; ITEM SETS; NOVEL TECHNIQUES; SAMPLING ALGORITHM; SUPPORT THRESHOLD; SYSTEM RESOURCES; TRANSACTIONAL DATA STREAMS;

ALGORITHMS; DATA COMMUNICATION SYSTEMS; HYDRAULICS; LIFE CYCLE;

DATA WAREHOUSES;

EID: 78149381013     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16175-9_1     Document Type: Conference Paper

References (53)

1. Aggarwal, C.C.: On biased reservoir sampling in the presence of stream evolution. In: Proceedings of the 32nd International Conference on Very Large Data Bases, pp. 607-618 (2006)
2. Aggarwal, C.C.: Data Streams: Models and Algorithms. Springer, Heidelberg (2007)
3. Acharya, S., Gibbons, P.B., Poosala, V.: Congressional samples for approximate answering of group-by queries. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, pp. 487-498 (2000)
4. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of 20th International Conference on Very Large Data Bases, pp. 487-499 (1994)
5. Aggarwal, C.C., Yu, P.: A survey of synopsis construction in data streams. Data Streams: Models and Algorithms, 169-208 (2006)
6. Bronnimann, H., Chen, B., Dash, M., Haas, P., Scheuermann, P.: Efficient data reduction with ease. In: Proceedings of the Ninth ACM SIGKDD International Conference in Knowledge Discovery and Data Mining, pp. 59-68 (2003)
7. Barbar'a, D., Dumouchel, W., Faloutsos, C., Haas, P.J., Hellerstein, J.M., Ioannidis, Y., Jagadish, H.V., Johnson, T., Ng, R., Poosala, V., Ross, K.A., Sevcik, K.C.: The new jersey data reduction report. IEEE Data Engineering Bulletin 20, 3-45 (1997)
8. Babcock, B., Datar, M., Motwani, R.: Sampling from a moving window over streaming data. In: Proceedings of 13th Annual ACM-SIAM Symposium on Discrete Algorithms (2002)
9. Bodon, F.: A fast apriori implementation. In: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, FIMI'03 (2003)
10. Calders, T., Dexters, N., Goethals, B.: Mining frequent itemsets in a stream. In: IEEE International Conference on Data Mining (ICDM'07), pp. 83-92 (2007)
11. Chen, Y., Dong, G., Han, J., Wah, B.W., Wang, J.: Multi-dimensional regression analysis of time-series data streams. In: Proceedings of 28th International Conference on Very Large Data Bases, pp. 323-334 (2002)
12. Chen, B., Haas, P.J., Scheuermann, P.: A new two-phase sampling based algorithm for discovering association rules. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 462-468 (2002)
13. Cheng, J., Ke, Y., Ng, W.: Maintaining frequent itemsets over high-speed data streams. In: Proceedings of the 10th Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 462-467 (2006)
14. Cheng, J., Ke, Y., Ng, W.: A survey on algorithms for mining frequent itemsets over data streams. An International Journal of Knowledge and Information Systems (2008)
15. Chang, J.H., Lee, W.S.: estWin: adaptively monitoring the recent change of frequent itemsets over online data streams. In: CIKM, pp. 536-539 (2003)
16. Chang, J.H., Lee, W.S.: Finding recent frequent itemsets adaptively over online data streams. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 487-492 (2003)
17. Chang, J.H., Lee, W.S.: A sliding window method for finding recently frequent itemsets over online data streams. Journal of Information Science and Engineeering 20(4), 753-762 (2004)
18. Cohen, E., Strauss, M.: Maintaining time-decaying stream aggregates. In: Proceedings of the Twenty-Second ACMSIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 223-233 (2003)
19. Chi, Y., Wang, H., Yu, P.S., Muntz, R.R.: Moment: Maintaining closed frequent itemsets over a stream sliding window. In: Proceedings of the 4th IEEE International Conference on Data Mining (ICDM 2004), pp. 59-66 (2004)
20. Domingos, P., Hulten, G.: Mining high-speed data streams. In: Proceedings of ACM SIGKDD International Conference in Knowledge Discovery and Data Mining, pp. 71-80 (2000)
21. Dash, M., Ng, W.: Efficient reservoir sampling for transactional data streams. In: IEEE ICDM workshop on Mining Evolving and Streaming Data, pp. 662-666 (2006)
22. Fan, C.T., Muller, M.E., Rezucha, I.: Development of sampling plans by using sequential (item by item) selection techniques and digital computers. Journal of the American Statistical Association (1962)
23. Giannella, C., Han, J., Pei, J., Yan, X., Yu, P.S.: Mining frequent patterns in data streams at multiple time granularities. In: Next Generation Data Mining. AAAI/MIT (2003)
24. Han, J., Cheng, H., Xin, D., Yan, X.: Frequent pattern mining: current status and future directions. Data Min. Knowl. Discov. 15(1), 55-86 (2007)
25. Han, J., Kamber, M.: Data Mining: Concepts and Techniques, 2nd edn. Morgan Kaufmann Publishers, San Francisco (2006)
26. Hwang, W., Kim, D.: Improved association rule mining by modified trimming. In: Proceedings of Sixth IEEE International Conference on Computer and Information Technology, CIT (2006)
27. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: 2000 ACM SIGMOD Intl. Conference on Management of Data, pp. 1-12 (2000)
28. Hagerup, T., Rub, C.: A guided tour of chernoff bounds. Information Processing Letters, 305-308 (1990)
29. Jiang, N., Gruenwald, L.: Research issues in data stream association rule mining. SIGMOD Record 35, 14-19 (2006) (Pubitemid 43383843)
30. Johnson, T., Muthukrishnan, S., Rozenbaum, I.: Sampling algorithms in a stream operator. In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, pp. 1-12 (2005)
31. Kotsiantis, S., Kanellopoulos, D.: Association rules mining: A recent overview. GESTS International Transactions on Computer Science and Engineering 32(1), 71-82 (2006)
32. Kubica, J.M., Moore, A.: Probabilistic noise identification and data cleaning. In: Proceedings of International Conference on Data Mining (ICDM), pp. 131-138 (2003)
33. Karp, R.M., Shenker, S., Papadimitriou, C.H.: A simple algorithm for finding frequent elements in streams and bags. ACM Transactions on Database Systems 28(1), 51-55 (2003)
34. Lee, S.D., Cheung, D.W.-L., Kao, B.: Is sampling useful in data mining? a case in the maintenance of discovered association rules. Data Mining and Knowledge Discovery 2(3), 233-262 (1998)
35. Li, K.-H.: Reservoir sampling algorithms of time complexity o(n(1 + log(n/n))). ACM Transactions on Mathematical Software 20(4), 481-493 (1994)
36. Li, H.F., Lee, S.Y., Shan, M.K.: An efficient algorithm for mining frequent itemsets over the entire history of data streams. In: Proc. of First International Workshop on Knowledge Discovery in Data Streams (2004)
37. Li, H.F., Lee, S.Y., Shan, M.K.: Online mining (recently) maximal frequent itemsets over data streams. In: RIDE, pp. 11-18 (2005)
38. Misra, J., Gries, D.: Finding repeated elements. Scientific Computing Programming 2(2), 143-152 (1982) (Pubitemid 14566072)
39. Manku, G.S., Motwani, R.: Approximate frequency counts over data streams. In: Proceedings of 28th International Conference on Very Large Data Bases, pp. 346-357 (2002)
40. Mannila, H., Toivonen, H., Inkeri Verkamo, A.: Efficient algorithms for discovering association rules. In: Fayyad, U.M., Uthurusamy, R. (eds.) AAAI Workshop on Knowledge Discovery in Databases (KDD-94), pp. 181-192 (1994)
41. Ng, W., Dash, M.: An evaluation of progressive sampling for imbalanced data sets. In: IEEE ICDM Workshop on Mining Evolving and Streaming Data, pp. 657-661 (2006)
42. Ng, W., Dash, M.: Efficient approximate mining of frequent patterns over transactional data streams. In: Song, I.-Y., Eder, J., Nguyen, T.M. (eds.) DaWaK 2008. LNCS, vol. 5182, pp. 241-250. Springer, Heidelberg (2008)
43. Olken, F., Rotem, D.: Random sampling from databases - a survey. Statistics and Computing 5, 25-42 (1995)
44. Parthasarathy, S.: Efficient progressive sampling for association rules. In: IEEE International Conference on Data Mining (ICDM'02), pp. 354-361 (2002)
45. Provost, F.J., Jensen, D., Oates, T.: Efficient progressive sampling. In: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 23-32 (1999)
46. Park, B.-H., Ostrouchov, G., Samatova, N.F., Geist, A.: Reservoir-based random sampling with replacement from data stream. In: Proceedings of the SIAM International Conference on Data Mining (SDM'04), pp. 492-501 (2004)
47. Shasha, Y.Z.D.: Statstream: Statistical monitoring of thousands of data streams in real time. In: Proceedings of 28th International Conference on Very Large Data Bases, pp. 358-369 (2002)
48. Toivonen, H.: Sampling large databases for association rules. In: VLDB '96: Proceedings of the 22th International Conference on Very Large Data Bases, pp. 134-145 (1996)
49. Vitter, J.S.: Random sampling with a reservoir. ACM Transactions on Mathematical Software 11, 37-57 (1985)
50. Yu, J.X., Chong, Z., Lu, H., Zhou, A.: False positive or false negative: Mining frequent itemsets from high speed transactional data streams. In: Proceedings of the Thirtieth International Conference on Very Large Data Bases (2004)
51. Yi, B.-K., Sidiropoulos, N., Johnson, T., Jagadish, H.V., Faloutsos, C., Biliris, A.: Online mining for co-evolving time sequences. In: Proceedings of the 16th International Conference on Data Engineering, pp. 13-22 (2000)
52. Zaki, M.J., Parthasarathy, S., Li, W., Ogihara, M.: Evaluation of sampling for data mining of association rules. In: Seventh International Workshop on Research Issues in Data Engineering, RIDE'97 (1996)
53. Zhu, X., Wu, X., Khoshgoftaar, T., Shi, Y.: Empirical study of the noise impact on cost-sensitive learning. In: Proceedings of International Conference on Joint Conference on Artificial Intelligence, IJCAI (2007)