1. (2009). Alignement des références géodésiques et synchronisation des références de temps par rapport aux références internationales. Alignement des références géodésiques et synchronisation des références de temps par rapport aux références internationales
2. (2006). Unknown Title. Information Sciences, 176(14), 1986-2015.
3. David Cheung,S Lee,Benjamin Kao (1997). A General Incremental Technique for Maintaining Discovered Association Rules. Database Systems for Advanced Applications '97, 185-194.
4. (2003). A Generic Local Algorithm for Mining Data Streams in Large Distributed Systems 4. A regression-based temporal pattern mining scheme for data streams. Proceedings of the 29th VLDB Conference, 93-104.
5. (2011). A Sketch-Based Architecture for Mining Frequent Items and Item sets from Distributed Data Streams. Proc. of the 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, 245-253.
6. (2003). Alternative Interest Measures for Mining Associations. IEEE TKDE, 15, 57-69.
7. Jong Park,Ming-Syan Chen,Philip Yu (1995). An effective hash-based algorithm for mining association rules. ACM SIGMOD Record, 24(2), 175-186.
8. Xie Zhi-Jun,Chen Hong,Cuiping Li (2006). An Efficient Algorithm for Frequent Itemset Mining on Data Streams. Lecture Notes in Computer Science, 474-491.
9. Fujiang Ao,Jing Du,Yuejin Yan,Baohong Liu,Kedi Huang (2008). An Efficient Algorithm for Mining Closed Frequent Itemsets in Data Streams. 2008 IEEE 8th International Conference on Computer and Information Technology Workshops, 37-42.
10. Jun Tan,Yingyong Bu,Haiming Zhao (2004). Efficient single-pass frequent itemsets mining over data streams. 2010 Seventh International Conference on Fuzzy Systems and Knowledge Discovery, 1438-1441.
11. (1997). An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases. Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD-97)
12. (2002). Approximate frequency counts over data streams. Proceedings of the 28th VLDB Conference
13. Sergey Brin,Rajeev Motwani,Craig Silverstein (1997). Beyond market baskets. ACM SIGMOD Record, 26(2), 265-276.
14. Cantree (2005). A tree structure for efficient incremental mining of frequent patterns. ICDM, 274-281.
15. Yun Chi,Haixun Wang,Philip Yu,Richard Muntz (2006). Catch the moment: maintaining closed frequent itemsets over a data stream sliding window. Knowledge and Information Systems, 10(3), 265-294.
16. Nan Jiang,Le Gruenwald (2006). CFI-Stream. Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, 592-597.
17. Mohammed Zaki,Ching-Jui Hsiao (2002). CHARM: An Efficient Algorithm for Closed Itemset Mining. Proceedings of the 2002 SIAM International Conference on Data Mining, 457-473.
18. Closet (2000). An efficient algorithm for mining frequent closed itemsets. SIGMOD, 21-30.
19. Haixun Wang,Wei Wang,Jiong Yang,Philip Yu (2002). Clustering by pattern similarity in large data sets. Proceedings of the 2002 ACM SIGMOD international conference on Management of data - SIGMOD '02
20. Cmar (2001). Accurate and efficient classification based on multiple class-association rules. ICDM, 369-376.
21. Hillol Kargupta,Philip Chan,Vipin Kumar,Zoran Obradovic (2000). Distributed and parallel knowledge discovery (workshop session) (title only). Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, 5, 534.
22. (2001). Data Streams and Histograms. ACM Symposium on Theory of Computing
23. Anna Ciampi,Annalisa Appice,Donato Malerba (2010). Online and Offline Trend Cluster Discovery in Spatially Distributed Data Streams. Lecture Notes in Computer Science, 142-161.
24. (1997). Discovery of Frequent Episodes in Event Sequences. DMKD, 1, 259-289.
25. Carson Leung,Quamrul Khan (2006). DSTree: A Tree Structure for the Mining of Frequent Sets from Data Streams. Sixth International Conference on Data Mining (ICDM'06), 928-932.
26. Sergey Brin,Rajeev Motwani,Jeffrey Ullman,Shalom Tsur (1997). Dynamic itemset counting and implication rules for market basket data. ACM SIGMOD Record, 26(2), 255-264.
27. Eclatds (2011). An Efficient Sliding Window Based Frequent Pattern Mining Method for Data Streams. Intelligent Data Analysis, 15(4), 571-587.
28. Nicolas Pasquier,Yves Bastide,Rafik Taouil,Lotfi Lakhal (1999). Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1), 25-46.
29. K Gouda,M Zaki (2001). Efficiently mining maximal frequent itemsets. Proceedings 2001 IEEE International Conference on Data Mining, 163-170.
30. Shichao Zhang,Chengqi Zhang (2002). Encoding probability propagation in belief networks. IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 32(4), 526-531.
31. Max Est (2009). Tracing Maximal Frequent Itemsets Instantly over Online Transactional Data Streams. IEEE Transactions on Knowledge and Data Engineering, 21(10), 1418-1431.
32. (2005). estWin: Online data stream mining of recent frequent itemsets by sliding window method. Journal of Information Science, 31, 76-90.
33. Cheng-Fa Tsai,Yi-Chau Lin,Chi-Pin Chen (null). A new fast algorithms for mining association rules in large databases. IEEE International Conference on Systems, Man and Cybernetics, vol.7, 6.
34. Cheng-Fa Tsai,Yi-Chau Lin,Chi-Pin Chen (1994). A new fast algorithms for mining association rules in large databases. IEEE International Conference on Systems, Man and Cybernetics, vol.7, 6.
35. (2002). Finding Frequent Items in Data Streams. Proceedings of the 2002 International Collo-quium on Automata, Languages and Programming
36. Joong Chang,Won Lee (2003). Finding recent frequent itemsets adaptively over online data streams. Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, 487-492.
37. Daesu Lee,Wonsuk Lee (2003). Finding Maximal Frequent Itemsets over Online Data Streams Adaptively. Fifth IEEE International Conference on Data Mining (ICDM'05), 266-273.
38. Jiawei Han,Hong Cheng,Dong Xin,Xifeng Yan (2007). Frequent pattern mining: current status and future directions. Data Mining and Knowledge Discovery, 15(1), 55-86.
39. Shih-Yang Yang,Ching-Ming Chao,Po-Zung Chen,Chu-Hao Sun (2011). Incremental Mining of Across-streams Sequential Patterns in Multiple Data Streams. Journal of Computers, 6(3), 449-457.
40. W Cheung,O Zaiane (2003). Incremental mining of frequent patterns without candidate generation or support constraint. Seventh International Database Engineering and Applications Symposium, 2003. Proceedings., 111-116.
41. Chin-Chuan Ho,Hua-Fu Li,Fang-Fei Kuo,Suh-Yin Lee (2006). Incremental Mining of Sequential Patterns over a Stream Sliding Window. Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06), 677-681.
42. Hua-Fu Li,Chin-Chuan Ho,Suh-Yin Lee (2009). Incremental updates of closed frequent itemsets over continuous data streams. Expert Systems with Applications, 36(2), 2451-2458.
43. Jaideep Vaidya,Chris Clifton (1998). Privacy preserving association rule mining in vertically partitioned data. Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '02
44. D Cheung,Jiawei Han,V Ng,C Wong (1996). Maintenance of discovered association rules in large databases: an incremental updating technique. Proceedings of the Twelfth International Conference on Data Engineering, 106-114.
45. Rakesh Agrawal,Tomasz Imieliński,Arun Swami (1993). Mining association rules between sets of items in large databases. ACM SIGMOD Record, 22(2), 207-216.
46. Gianluigi Folino,Clara Pizzuti,Giandomenico Spezzano (2007). Mining Distributed Evolving Data Streams Using Fractal GP Ensembles. Lecture Notes in Computer Science, 160-169.
47. Chih-Hsiang Lin,Ding-Ying Chiu,Yi-Hung Wu,Arbee Chen (2005). Mining Frequent Itemsets from Data Streams with a Time-Sensitive Sliding Window. Proceedings of the 2005 SIAM International Conference on Data Mining, 68-79.
48. A Veloso,W Meira,M Carvalho,B Pôssas,S Parthasarathy,M Zaki (2002). Mining Frequent Itemsets in Evolving Databases. Proceedings of the 2002 SIAM International Conference on Data Mining, 494-510.
49. (2003). Mining frequent itemsets over arbitrary time intervals in data streams. Mining frequent itemsets over arbitrary time intervals in data streams
50. Hua-Fu Li,Suh-Yin Lee (2009). Mining frequent itemsets over data streams using efficient window sliding techniques. Expert Systems with Applications, 36(2), 1466-1477.
51. (2011). Mining Frequent Itemsets over Distributed Data Streams by Continuously Maintaining a Global Synopsis. Data Mining and Knowledge Discovery, 23, 252-299.
52. (2000). Mining Frequent Patterns in Data Streams at Multiple Time Granularities, 55. Mining frequent patterns without candidate generation. SIGMOD' 00, 1-12.
53. Jiawei Han,Jian Pei,Yiwen Yin,Runying Mao (2004). Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach. Data Mining and Knowledge Discovery, 8(1), 53-87.
54. Guojun Mao,Xindong Wu,Xingquan Zhu,Gong Chen,Chunnian Liu (2007). Mining maximal frequent itemsets from data streams. Journal of Information Science, 33(3), 251-262.
55. (2009). Mining non-derivable frequent itemsets over data stream. Data & Knowledge Engineering, 68, 481-498.
56. Mining Sequential Patterns on Data Streams: a Near-Optimal Statistical Approach. Mining Sequential Patterns on Data Streams: a Near-Optimal Statistical Approach
57. (1995). Mining Sequential Patterns from Spatio-Temporal Databases. Proc. of IDCE
58. Yun Chi,Haixun Wang,P Yu,R Muntz (2004). Moment: Maintaining Closed Frequent Itemsets over a Stream Sliding Window. Fourth IEEE International Conference on Data Mining (ICDM'04), 59-66.
59. Bing Liu,Minqing Hu,Wynne Hsu (2000). Multi-level organization and summarization of the discovered rules. Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, 208-217.
60. T Asai,H Arimura,K Abe,S Kawasoe,S Arikawa (null). Online algorithms for mining semi-structured data stream. 2002 IEEE International Conference on Data Mining, 2002. Proceedings., 27-34.
61. (2007). Ontology-driven rule generalization and categorization for market data. IEEE 23rd International Conference on, 917-923.
62. M Otey,S Parthasarathy,C Wang,A Veloso,W Meira (2004). Parallel and Distributed Methods for Incremental Frequent Itemset Mining. IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), 34(6), 2439-2450.
63. Minos Garofalakis,Johannes Gehrke,Rajeev Rastogi (2002). Querying and mining data streams. Proceedings of the 2002 ACM SIGMOD international conference on Management of data - SIGMOD '02
64. Chedy Raissi,Pascal Poncelet (2007). Sampling for Sequential Pattern Mining: From Static Databases to Data Streams. Seventh IEEE International Conference on Data Mining (ICDM 2007), 631-636.
65. Nan Jiang,Le Gruenwald (2006). Research issues in data stream association rule mining. ACM SIGMOD Record, 35(1), 14-19.
66. Pang-Ning Tan,Vipin Kumar,Jaideep Srivastava (2002). Selecting the right interestingness measure for association patterns. Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, 32-41.
67. (2005). Sequential Pattern Mining in Multiple Streams. Proc. of the 5th IEEE International Conference on Data Mining
68. Chang-Hung Lee,Cheng-Ru Lin,Ming-Syan Chen (2005). Sliding window filtering: an efficient method for incremental mining on a time-variant database. Information Systems, 30(3), 227-244.
69. Syed Tanbeer,Chowdhury Ahmed,Byeong-Soo Jeong,Young-Koo Lee (2009). Sliding window-based frequent pattern mining over data streams. Information Sciences, 179(22), 3843-3865.
70. Luiz Mendes,Bolin Ding,Jiawei Han (2008). Stream Sequential Pattern Mining with Precise Error Bounds. 2008 Eighth IEEE International Conference on Data Mining, 941-946.
71. (1999). The space complexity of approximating the frequency moments. Compute. Syst. Sci, 58(1), 137-147.
72. (2008). Verifying and mining frequent patterns from large windows over data streams. Proceedings of International Conference on Data Engineering, 179-188.
