.. Structure, 44 3.4.2.1 Score-and-search based methods, p.50

S. Learning-from, 57 4.2.1 Score-and-search based methods, p.69

I. Results and .. With-landmark-windows, 117 6.4.1 Parameters analysis, p.123

I. Results and .. With-damped-window, 126 6.6.1 Non-stationary domains, p.128

C. Charu and . Aggarwal, Data streams: models and algorithms, p.14, 2007.

C. Charu, J. Aggarwal, J. Han, P. S. Wang, and . Yu, A framework for clustering evolving data streams, VLDB '2003: Proceedings of the 29th international conference on very large data bases, pp.81-92, 2003.

C. Charu, J. Aggarwal, J. Han, P. S. Wang, and . Yu, On demand classification of data streams, Proceedings of the tenth ACM SIGKDD international conference on Knowledge Discovery and Data mining, pp.503-508, 2004.

H. Akaike, Statistical predictor identification, Annals of the Institute of Statistical Mathematics, vol.3, issue.1, pp.203-217, 1970.
DOI : 10.1007/BF02506337

S. Ammar, Probabilistic graphical models for density estimation in high dimensional spaces: application of the Perturb & Combine principle with tree mixtures, p.137, 2010.
URL : https://hal.archives-ouvertes.fr/tel-00568136

B. Anderson and A. Moore, AD-Trees for fast counting and for fast learning of association rules, Proceedings Fourth International Conference on Knowledge Discovery and Data Mining, pp.134-138, 1998.

E. Maskey, M. Ryvkina, R. Stonebraker, and . Tibbetts, Linear road: a stream data management benchmark, Proceedings of the Thirtieth 184 BIBLIOGRAPHY international conference on very large data bases, pp.480-491, 2004.

B. Babcock, M. Datar, R. Motwani, O. Liadan, and . Callaghan, Maintaining variance and k-medians over data stream windows, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '03, pp.234-243, 2003.
DOI : 10.1145/773153.773176

B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom, Models and issues in data stream systems, Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '02, pp.1-16, 2002.
DOI : 10.1145/543613.543615

B. Babcock, M. Datar, and R. Motwani, Load shedding techniques for data stream systems, Proceedings of the 2003 Workshop on Management and Processing of Data Streams (MPDS), p.20, 2003.

J. Bailey and E. Loekito, Efficient incremental mining of contrast patterns in changing data, Information Processing Letters, vol.110, issue.3, pp.88-92, 2010.
DOI : 10.1016/j.ipl.2009.10.012

Y. Bei and H. Houkuan, TOPSIL-miner: an efficient algorithm for mining top-k significant itemsets over data streams, Knowledge and Information Systems, vol.23, issue.2, pp.225-242, 2010.

Y. Ben-haim and E. Tom-tov, A streaming parallel decision tree algorithm, pp.849-872, 2010.

A. Bifet and R. Gavaldà, Adaptive Learning from Evolving Data Streams, IDA '09: Proceedings of the 8th International Symposium on Intelligent Data Analysis, pp.249-260, 2009.
DOI : 10.1007/11564126_50

W. Buntine, Theory Refinement on Bayesian Networks, Proceedings of the seventh conference, pp.52-60, 1991.
DOI : 10.1016/B978-1-55860-203-8.50010-3

G. Castillo and J. Gama, Adaptive Bayesian network classifiers. Intelligent Data Analysis, pp.39-59, 0149.

M. Charikar, O. Liadan, R. Callaghan, and . Panigrahy, Better streaming algorithms for clustering problems, Proceedings of the thirty-fifth ACM symposium on Theory of computing , STOC '03, pp.30-39, 2003.
DOI : 10.1145/780542.780548

R. Chen, K. Sivakumar, and H. Kargupta, An approach to online Bayesian learning from multiple data streams, Proceedings of Workshop on Mobile and Distributed Data Mining, PKDD, pp.31-45, 2001.

Y. Chen and L. Tu, Density-based clustering for real-time stream data, Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '07, pp.133-142, 2007.
DOI : 10.1145/1281192.1281210

J. Cheng and M. J. Druzdzel, AIS-BN: An adaptive importance sampling algorithm for evidential reasoning in large Bayesian networks, Journal of Artificial Intelligence Research, vol.13, issue.1, pp.155-188, 2000.

Y. Chi, H. Wang, and P. S. Yu, Loadstar: load shedding in data stream mining, VLDB '05: Proceedings of the 31st international conference on very large data bases, pp.1302-1305, 2005.

M. David and . Chickering, Learning Bayesian networks is NP-complete, Proceedings of AI and Statistics, pp.121-130, 1995.

M. David and . Chickering, A transformational characterization of equivalent Bayesian network structures, Proceedings of the 11th Annual Conference on Uncertainty in Artificial Intelligence (UAI-95), pp.87-98, 1995.

M. David and . Chickering, Learning equivalence classes of Bayesian-network structures, Journal of Machine Learning Research, vol.2, pp.445-498, 2002.

M. David, C. Chickering, and . Boutilier, Optimal structure identification with greedy search, Journal of Machine Learning Research, vol.3, issue.45, pp.507-554, 2002.

M. David, D. Chickering, D. Geiger, and . Heckerman, Learning Bayesian networks: Search methods and experimental results, Proceedings of Fifth Conference on Artificial Intelligence and Statistics, pp.112-128, 1995.

M. David, D. Chickering, and . Heckerman, Efficient approximations for the marginal likelihood of incomplete data given a Bayesian network, Proceedings of the twelfth international conference on uncertainty in artificial intelligence, pp.158-168, 1996.

H. Cheol-cho, K. S. Lee, and . Fadali, Online learning algorithm of dynamic Bayesian networks for nonstationary signal processing, International Journal of Innovative Computing, Information and Control, vol.5, issue.4, pp.1027-1042, 2009.

C. K. Chow and C. N. Liu, Approximating discrete probability distributions with dependence trees, IEEE Transactions on Information Theory, vol.14, issue.3, pp.462-467, 1968.
DOI : 10.1109/TIT.1968.1054142

A. S. Cof?ño, R. Cano, C. Sordo, and J. M. Gutierrez, Bayesian networks for probabilistic weather prediction, 15th Eureopean Conference on Artificial Intelligence, ECAI, pp.695-700, 2002.

F. Gregory and . Cooper, The computational complexity of probabilistic inference using Bayesian belief networks, Artificial intelligence, vol.42, issue.41, pp.393-405, 1990.

F. Gregory, E. Cooper, and . Herskovits, A Bayesian method for the induction of probabilistic networks from data, Machine learning, vol.9, issue.58, pp.309-347, 1992.

G. Cormode and S. Muthukrishnan, What's hot and what's not, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '03, pp.249-278, 2005.
DOI : 10.1145/773153.773182

C. Cortes, K. Fisher, D. Pregibon, and A. Rogers, Hancock, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '00, pp.9-17, 2000.
DOI : 10.1145/347090.347094

R. Daly, Q. Shen, and S. Aitken, Learning Bayesian networks: approaches and issues, The Knowledge Engineering Review, vol.10, issue.02, pp.99-157, 2011.
DOI : 10.1007/BFb0053999

A. Darwiche, Bayesian networks, Communications of the ACM, vol.53, issue.12, pp.80-90, 2004.
DOI : 10.1145/1859204.1859227

M. Luis and . De-campos, A scoring function for learning Bayesian networks based on mutual information and conditional independence tests, J. Mach. Learn. Res, vol.7, pp.2149-2187, 2006.

S. Rodrigues, D. Morais, and A. Aussem, An efficient and scalable algorithm for local Bayesian network structure discovery, Machine Learning and Knowledge Discovery in Databases, pp.164-179, 2010.

J. Ding, Probabilistic inferences in Bayesian networks. arXiv preprint, p.41, 2010.

A. Dobra, M. Garofalakis, J. Gehrke, and R. Rastogi, Processing complex aggregate queries over data streams, Proceedings of the 2002 ACM SIGMOD international conference on Management of data , SIGMOD '02, pp.61-72, 2002.
DOI : 10.1145/564691.564699

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.8648

P. Domingos and G. Hulten, Mining high-speed data streams, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '00, pp.71-80, 2000.
DOI : 10.1145/347090.347107

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.3124

P. Domingos and G. Hulten, A general method for scaling up machine learning algorithms and its application to clustering, Proceedings of the Eighteenth International Conference on Machine Learning, pp.106-113

J. Kazuo, T. Ezawa, and . Schuermann, Fraud/uncollectible debt detection using a Bayesian network based learning system: A rare binary outcome with mixed data structures, Proceedings of the Eleventh conference on Uncertainty in artificial intelligence, pp.157-166, 1995.

M. T. Fennell and R. P. Wishner, Battlefield awareness via synergistic sar and mti exploitation. Aerospace and Electronic Systems Magazine, IEEE, vol.13, issue.2 5, pp.39-43, 1998.
DOI : 10.1109/62.656334

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.6800

F. Ferrer-troyano, J. S. Aguilar-ruiz, and J. C. Riquelme, Discovering decision rules from numerical data streams, Proceedings of the 2004 ACM symposium on Applied computing , SAC '04, pp.649-653, 2004.
DOI : 10.1145/967900.968036

N. Friedman, L. Getoor, D. Koller, and A. Pfeffer, Learning probabilistic relational models, IJCAI, pp.1300-1309, 1999.

N. Friedman and M. Goldszmidt, Sequential update of Bayesian network structure, Proceedings of the 13th Conference on Uncertainty in Artificial Intelligence (UAI 97), pp.165-174, 1997.

N. Friedman, I. Nachman, and D. Peér, Learning Bayesian network structure from massive datasets: The "sparse candidate" algorithm, Proceedings of the 15th Conference on Uncertainty in Artificail Intelligence(UAI-99), pp.206-215, 1999.

M. Robert, K. Fung, and . Chang, Weighing and Integrating Evidence for Stochastic Simulation in Bayesian Networks, Proceedings of the Fifth Annual Conference on Uncertainty in Artificial Intelligence, UAI '89, pp.209-220, 1990.

M. Medhat-gaber, S. Krishnaswamy, and A. Zaslavsky, On-board mining of data streams in sensor networks, Advanced Methods for Knowledge Discovery from Complex Data, Advanced Information and Knowledge Processing, pp.307-335, 2005.

M. Medhat-gaber, S. Krishnaswamy, and A. B. Zaslavsky, Resource-aware mining of data streams. j-jucs, pp.1440-1453, 2005.

M. Medhat-gaber, A. Zaslavsky, and S. Krishnaswamy, Towards an Adaptive Approach for Mining Data Streams in Resource Constrained Environments, Data Warehousing and Knowledge Discovery, pp.189-198, 2004.
DOI : 10.1007/978-3-540-30076-2_19

M. Medhat-gaber, A. Zaslavsky, and S. Krishnaswamy, Mining data streams, ACM SIGMOD Record, vol.34, issue.2, pp.18-26, 2005.
DOI : 10.1145/1083784.1083789

J. Gama, Knowledge Discovery from Data Streams, 2010.

J. Gama and M. Gaber, Learning from Data Streams ? Processing techniques in Sensor Networks, p.160, 2007.

J. Gama, P. Medas, G. Castillo, and P. P. Rodrigues, Learning with Drift Detection, SBIA, pp.286-295, 2004.
DOI : 10.1007/978-3-540-28645-5_29

V. Ganti, J. Gehrke, and R. Ramakrishnan, Mining data streams under block evolution, ACM SIGKDD Explorations Newsletter, vol.3, issue.2, pp.1-10, 2002.
DOI : 10.1145/507515.507517

O. Georgieva and D. Filev, Gustafson-Kessel algorithm for evolving data stream clustering, Proceedings of the International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing, CompSysTech '09, pp.1-6, 2009.
DOI : 10.1145/1731740.1731807

L. Getoor and M. Sahami, Using Probabilistic Relational Models for Collaborative Filtering, Workshop on Web Usage Analysis and User Profiling (WEBKDD'99), pp.1-6, 1999.

C. Giannella, J. Han, J. Pei, X. Yan, and P. S. Yu, Mining frequent patterns in data streams at multiple time granularities, Data Mining: Next Generation Challenges and Future Directions

A. C. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan et al., Fast, small-space algorithms for approximate histogram maintenance, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing , STOC '02, pp.389-398, 2002.
DOI : 10.1145/509907.509966

S. Guha, A. Meyerson, N. Mishra, R. Motwani, O. Liadan et al., Clustering data streams: theory and practice, IEEE Transactions on Knowledge and Data Engineering, vol.15, issue.3, pp.515-528, 2003.
DOI : 10.1109/TKDE.2003.1198387

S. Guha, N. Mishra, R. Motwani, O. Liadan, and . Callaghan, Clustering data streams, Proceedings of the Annual Symposium on Foundations of Computer Science, pp.359-366, 2000.

H. Guo and W. Hsu, A survey of algorithms for real-time Bayesian network inference, AAAI/KDD/UAI02 Joint Workshop on Real-Time Deci- BIBLIOGRAPHY tional conference on Knowledge Discovery and Data mining, pp.97-106, 2001.

J. W. Kyu-baek-hwang, S. Lee, B. Chung, and . Zhang, Construction of large-scale Bayesian networks by local to global search, Proceedings of the 7th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence, PRICAI '02, pp.375-384, 2002.

E. Ikonomovska and S. D?eroski, Regression on evolving multirelational data streams, Proceedings of the 2011 Joint EDBT/ICDT Ph.D

E. Ikonomovska, S. Loskovska, and D. Gjorgjevik, A survey of stream data mining, Proceedings of 8th National Conference with International Participation, ETAI, pp.19-21, 2007.

J. Michael-irwin, Learning in Graphical Models, 1998.

M. Kholghi and M. Keyvanpour, An analytical framework for data stream mining techniques based on challenges and requirements, International Journal of Engineering Science and Technology (IJEST), vol.3

Y. Kim and U. Kim, WSFI-Mine: Mining Frequent Patterns in Data Streams, ISNN 2009: Proceedings of the 6th International Symposium on Neural Networks, pp.845-852, 2009.
DOI : 10.1007/978-3-642-01510-6_95

D. Koller and N. Friedman, Probabilistic Graphical Models: Principles and Techniques -Adaptive Computation and Machine Learning, p.41, 2009.

P. Komarek and A. W. Moore, A dynamic adaptation of AD-trees for efficient machine learning on large data sets, ICML '00: Proceedings of the Seventeenth International Conference on Machine Learning, pp.495-502, 2000.

X. Z. Kong, Y. X. Bi, and D. H. Glass, A Geometric Moving Average Martingale method for detecting changes in data streams, Research and Development in Intelligent Systems XXIX, pp.79-92, 2012.
DOI : 10.1007/978-1-4471-4739-8_6

M. Kubat and I. Krizakova, FORGETTING AND AGING OF KNOWLEDGE IN CONCEPT FORMATION, Applied Artificial Intelligence, vol.1, issue.2, pp.195-206, 1992.
DOI : 10.1016/0004-3702(91)90041-H

S. Kullback, Information theory and statistics, p.49, 1997.

A. Venu-madhav-kuthadi, P. Govardhan, and . Prem-chand, Incremental learning algorithm for dynamic data streams, In IJCSNS International Journal of Computer Science and Network Security, vol.8, pp.134-138, 2008.

Y. Kwon, M. Wing-yee-lee, G. Balazinska, and . Xu, Clustering Events on Streams Using Complex Context Information, 2008 IEEE International Conference on Data Mining Workshops, pp.238-247, 2008.
DOI : 10.1109/ICDMW.2008.138

G. Lacey and S. Macnamara, Context-Aware Shared Control of a Robot Mobility Aid for the Elderly Blind, The International Journal of Robotics Research, vol.19, issue.11, pp.1054-1065, 2000.
DOI : 10.1177/02783640022067968

W. Lam, Bayesian network refinement via machine learning approach, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.20, issue.3, pp.240-251, 1998.
DOI : 10.1109/34.667882

W. Lam and F. Bacchus, LEARNING BAYESIAN BELIEF NETWORKS: AN APPROACH BASED ON THE MDL PRINCIPLE, Computational Intelligence, vol.17, issue.3, pp.269-293, 1994.
DOI : 10.1016/0005-1098(78)90005-5

W. Lam and F. Bacchus, Using new data to refine a Bayesian network, Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence, pp.383-390, 1994.

M. Last, Online classification of nonstationary data streams, Intelligent Data Analysis, vol.6, issue.26, pp.129-147, 2002.

L. Steffen, D. J. Lauritzen, and . Spiegelhalter, Local computations with probabilities on graphical structures and their application to expert systems, Journal of the Royal Statistical Society. Series B (Methodological), pp.157-224, 1988.

Y. Law and C. Zaniolo, An Adaptive Nearest Neighbor Classification Algorithm for Data Streams, Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases, PKDD'05, pp.108-120, 2005.
DOI : 10.1007/11564126_15

M. Leeuwen and A. Siebes, StreamKrimp: Detecting Change in Data Streams, Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases -Part I, ECML PKDD '08, pp.672-687, 2008.
DOI : 10.1007/978-3-540-87479-9_62

P. Leray and O. François, Bayesian network structural learning and incomplete data, Proceedings of the International and Interdisciplinary Conference on Adaptive Knowledge Representation and Reasoning (AKRR 2005), pp.33-40, 2005.

H. Li, M. Suh-yin-lee, and . Shan, An efficient algorithm for mining frequent itemsets over the entire history of data streams, Proceedings BIBLIOGRAPHY 195

P. Li, X. Hu, and X. Wu, Mining Concept-Drifting Data Streams with Multiple Semi-Random Decision Trees, ADMA '08: Proceedings of the 4th international conference on Advanced Data Mining and Applications, pp.733-740, 2008.
DOI : 10.1007/978-3-540-88192-6_78

G. Singh, M. , and R. Motwani, Approximate frequency counts over data streams, VLDB '02: Proceedings of the 28th international conference on very large data bases, pp.346-357, 2002.

G. Singh-manku, B. G. Sridhar-rajagopalan, and . Lindsay, Random sampling techniques for space efficient online computation of order statistics of large datasets, SIGMOD '99: Proceedings of the 1999 ACM SIGMOD international conference on Management of data, pp.251-262, 1999.

A. Marascu and F. Masseglia, Mining sequential patterns from data??streams: a centroid approach, Journal of Intelligent Information Systems, vol.31, issue.5, pp.291-307, 2006.
DOI : 10.1007/s10844-006-9954-6

URL : https://hal.archives-ouvertes.fr/inria-00461296

A. Marascu and F. Masseglia, Atypicity detection in data streams: A self-adjusting approach. Intelligent Data Analysis, pp.89-105, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00789034

A. Moore and M. S. Lee, Cached suficient statistics for efficient machine learning with large datasets, Journal of Artificial Intelligence Research, vol.8, issue.106, pp.67-91, 1998.

S. Muthukrishnan, Data Streams: Algorithms and Applications, Foundations and Trends?? in Theoretical Computer Science, vol.1, issue.2, p.23, 2005.
DOI : 10.1561/0400000002

H. Nguyen, Réseaux Bayésiens et apprentissage ensembliste pour l'étude différentielle de réseaux de régulation génétique, p.53, 2012.

S. Holbech-nielsen and T. D. Nielsen, Adapting Bayes network structures to non-stationary domains, International Journal of Approximate Reasoning, vol.49, issue.2, pp.379-397, 2008.
DOI : 10.1016/j.ijar.2008.02.007

O. Liadan, N. Callaghan, A. Mishra, S. Meyerson, R. Guha et al., Streaming-data algorithms for high-quality clustering, Proceedings of the 18th International Conference on Data Engineering, ICDE '02, pp.685-694, 2002.

K. G. Olesen, S. L. Lauritzen, and F. V. Jensen, aHUGIN: A System Creating Adaptive Causal Probabilistic Networks, Proceedings of the Eighth international conference on Uncertainty in artificial intelligence, pp.223-229, 1992.
DOI : 10.1016/B978-1-4832-8287-9.50035-9

C. Ordonez, Clustering binary data streams with K-means, Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery , DMKD '03, pp.12-19, 2003.
DOI : 10.1145/882082.882087

S. Papadimitriou, A. Brockwell, and C. Faloutsos, Adaptive, Hands-Off Stream Mining, Proceedings of the 29th international conference on very large data bases, pp.560-571, 2003.
DOI : 10.1016/B978-012722442-8/50056-2

J. Pearl, Bayesian networks: A model of self-activated memory for evidential reasoning, Proceedings of the 7th Conference of the Cognitive Science Society, pp.329-334, 1985.

J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, p.39, 1988.

H. Peng, F. Long, and C. Ding, Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.27, issue.8, pp.1226-1238, 2005.
DOI : 10.1109/TPAMI.2005.159

. Vetterling, Numerical Recipes in C++: The Art of Scientific Computing, Second Edition, p.81, 2002.

J. Rissanen, Modeling by shortest data description, Automatica, vol.14, issue.5, pp.465-471, 1978.
DOI : 10.1016/0005-1098(78)90005-5

R. W. Robinson, Counting unlabeled acyclic digraphs, Combinatorial mathematics V, pp.28-43, 1977.
DOI : 10.1016/S0021-9800(70)80089-8

S. R. , D. Morais, and A. Aussem, A novel scalable and data efficient feature subset selection algorithm, Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II, ECML PKDD '08, pp.298-312, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00383839

A. Josep-roure, Incremental hill-climbing search applied to Bayesian network structure learning, First International Workshop on Knowledge Discovery in Data Streams. (KDDS-ECML), pp.1-10, 2004.

A. Josep-roure, Incremental Methods for Bayesian Network Structure Learning, p.47, 2004.

J. Roure, A. , and R. Sangüesa, Incremental methods for Bayesian network structure learning, p.148, 1999.

M. Sahami, S. Dumais, D. Heckerman, and E. Horvitz, A Bayesian approach to filtering junk e-mail, Learning for Text Categorization: Papers from the 1998 workshop, pp.98-105, 1998.

G. Schwarz, Estimating the dimension of a model. The annals of statistics, pp.461-464, 1978.

D. Ross, M. A. Shachter, and . Peot, Simulation Approaches to General Probabilistic Inference on Belief Networks, Proceedings of the Fifth Annual Conference on Uncertainty in Artificial Intelligence, UAI '89, pp.221-234, 1990.

D. Shi and S. Tan, Hybrid incremental learning algorithms for bayesian network structures, 9th IEEE International Conference on Cognitive Informatics (ICCI'10), pp.345-352, 2010.
DOI : 10.1109/COGINF.2010.5599716

D. Shi and S. Tan, Incremental learning Bayesian network structures efficiently, 2010 11th International Conference on Control Automation Robotics & Vision, pp.1719-1724, 2010.
DOI : 10.1109/ICARCV.2010.5707313

M. Singh and M. Valtorta, An Algorithm for the Construction of Bayesian Network Structures from Data, Proceedings of the 9th Annual Conference on Uncertainty in AI, pp.259-265, 1993.
DOI : 10.1016/B978-1-4832-1451-1.50036-6

J. David, S. L. Spiegelhalter, and . Lauritzen, Sequential updating of conditional probabilities on directed graphical structures, Networks, vol.20, issue.5, pp.579-605, 1990.

P. Spirtes, C. Glymour, and R. Scheines, Causation, Prediction, and Search. Adaptive Computation and Machine Learning Series, pp.78-158, 2000.

P. Spirtes and C. Meek, Learning Bayesian networks with discrete variables from data, Proceedings of the First International Conference on Knowledge Discovery and Data Mining, pp.294-299, 1995.

M. Teisseire, P. Poncelet, P. Scientifique, G. Besse, and F. Masseglia, Florent Masseglia, and Inria Sophia Antipolis. Sequential pattern mining: A survey on issues and approaches, Encyclopedia of Data Warehousing and Mining, nformation Science Publishing, pp.3-29, 2005.

I. Tsamardinos, C. F. Aliferis, and A. Statnikov, Time and sample efficient discovery of Markov blankets and direct causal relations, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, pp.673-678, 2003.
DOI : 10.1145/956750.956838

I. Tsamardinos, C. F. Aliferis, A. Statnikov, and L. E. Brown, Scaling-up Bayesian network learning to thousands of variables using local learning techniques, p.53, 2003.

I. Tsamardinos, L. E. Brown, and C. F. Aliferis, The maxmin hill-climbing Bayesian network structure learning algorithm, Machine Learning, pp.31-78, 1999.

R. Van-dam, I. Langkilde-geary, and D. Ventura, Adapting adtrees for high arity features, Proceedings of the 23rd national conference on Artificial intelligence, pp.708-713, 2008.

F. Van-harmelen, V. Lifschitz, and B. Porter, Handbook of knowledge representation, p.42, 2008.

S. Thomas, J. Verma, and . Pearl, Equivalence and synthesis of causal models, Proceedings of the Sixth Conference on Uncertainty in Artificial Intelligence, pp.220-227, 1991.

J. Vinagre and A. , Forgetting mechanisms for incremental collaborative filtering, WTI 2010: Proceedings of the III International Workshop on Web and Text Intelligence, pp.23-28, 1921.

H. Wang, W. Fan, P. S. Yu, and J. Han, Mining concept-drifting data streams using ensemble classifiers, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, pp.226-235, 2003.
DOI : 10.1145/956750.956778

K. Wang, J. Zhang, F. Shen, and L. Shi, Adaptive learning of dynamic Bayesian networks with changing structures by detecting geometric structures of time series. Knowledge and information systems, pp.121-133, 2008.

E. Wu, Y. Diao, and S. Rizvi, High-performance complex event processing over streams, Proceedings of the 2006 ACM SIGMOD international conference on Management of data , SIGMOD '06, pp.407-418, 2006.
DOI : 10.1145/1142473.1142520

C. Zhang, Y. Hao, M. Mazuran, C. Zaniolo, H. Mousavi et al., Mining frequent itemsets over tuple-evolving data streams, Proceedings of the 28th Annual ACM Symposium on Applied Computing, SAC '13, pp.267-274, 2013.
DOI : 10.1145/2480362.2480419

URL : https://hal.archives-ouvertes.fr/lirmm-00830923

C. Zhang, F. Masseglia, and Y. Lechevallier, ABS: The Anti Bouncing Model for Usage Data Streams, 2010 IEEE International Conference on Data Mining
DOI : 10.1109/ICDM.2010.91

URL : https://hal.archives-ouvertes.fr/lirmm-00653732