M. Gaber, A. Zaslavsky, and S. Krishnaswamy, Mining data streams, ACM SIGMOD Record, vol.34, issue.2, 2005.
DOI : 10.1145/1083784.1083789

A. Lelu, P. Cuxac, and J. Johansson, Classification dynamique d'un flux documentaire : une évaluation statique préalable de l'algorithme GERMEN -JADT'06, pp.19-21, 2006.

A. Lelu, Clustering dynamique d'un flot de données : un algorithme incrémental et optimal de détection des maxima de densité ? 8e, pp.17-20, 2006.

P. Cuxac, M. Cadot, and C. François, Analyse comparative de classifications : apport des règles d'association floues, EGC, pp.519-530, 2005.

H. Binztock and P. Gallinari, Un algorithme en ligne pour la détection de nouveauté dans un flux de documents, 2002.

C. C. Chen, Y. T. Chen, Y. S. Sun, and M. C. Chen, Life Cycle Modeling of News Events Using Aging Theory, pp.47-59, 2003.
DOI : 10.1007/978-3-540-39857-8_7

W. L. Buntine, Variational Extensions to EM and Multinomial PCA, pp.23-34, 2002.
DOI : 10.1007/3-540-36755-1_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.5167

R. C. Trémolières, The percolation method for an efficient grouping of data, Pattern Recognition, vol.11, issue.4, 1979.
DOI : 10.1016/0031-3203(79)90035-9

R. C. Trémolières, Percolation and multimodal data structuring -New Approaches in Classification and Data Analysis, pp.263-268, 1994.

M. Ester, H. P. Kriegel, J. Sander, and X. Xu, A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise, Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining (KDD'96 )

J. Moody, Peer influence groups: identifying dense clusters in large networks, Social Networks, vol.23, issue.4, pp.261-283, 2001.
DOI : 10.1016/S0378-8733(01)00042-9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.226.970

A. Guénoche, Clustering by vertex density in a Graph Meeting of the International Federation of the Classification Societies. Chicago, Classification, Clustering and Data Mining, pp.15-23, 2004.

S. Hader and F. A. Hamprecht, Efficient density clustering using basin spanning trees. Between Data Science and Applied Data Analysis, pp.39-48, 2003.
DOI : 10.1007/978-3-642-18991-3_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.7620

V. Batagelj and M. Zaversnik, An o(m) algorithm for cores decomposition of networks, p.799, 2002.

L. Ertöz, M. Steinbach, and V. Kumar, Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data, SIAM International Conference on Data Mining (SDM '03), 2003.
DOI : 10.1137/1.9781611972733.5

N. Mitton, A. Busson, and E. Fleury, Self-organization in large scale ad hoc networks. The Third Annual Mediterranean Ad Hoc Networking Workshop, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00383714

D. Hand, H. Mannila, and P. Smyth, Principles of Data Mining, Drug Safety, vol.15, issue.2, 2001.
DOI : 10.2165/00002018-200730070-00010

J. Han and M. Kamber, Data Mining, 2001.
DOI : 10.1007/978-1-4899-7993-3_104-2

M. Cadot, J. B. Maj, and T. Ziadé, Association Rules and Statistics, dans Encyclopedia of Data Warehousing and Mining, pp.74-77, 2005.

R. Agrawal, H. Mannila, R. Srikant, and H. , Toivonen and A.I. Verkamo,A.I, Fast discovery of association rules, 1996.

R. Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal, un algorithme d'extraction des motifs fréquents, Technique et science informatiques, pp.65-75, 2002.

F. Guillet, Mesure de qualité des connaissances en ECD, 2004.

M. Cadot and A. Napoli, RA et codage flou des données. SFC'04. (Bordeaux), 2004.

M. Cadot, P. Cuxac, and C. François, Règles d'association avec une prémisse composée : mesure du gain d'information, EGC, pp.599-600, 2006.

G. Piatetsky-shapiro, P. Smyth, and R. Uthurusamy, Advances in Knowledge Discovery and Data Mining, pp.307-328