. Références, Mining association rules between sets of items in large databases, Proceedings of ACM SIGMOD, pp.207-216, 1993.

, Automatic subspace clustering of high dimensional data for data mining applications, Proceedings of ACM SIGMOD, pp.94-105, 1998.

[. Choong, Computing appropriate representation for multidimensional data, Data and Knowledge Engineering International Journal, vol.45, pp.181-203, 2003.

. Codd, Providing olap to user-analysts : An it mandate, 1993.

[. Ester, Incremental clustering for mining in a data warehousing environment, Proc. 24th Int. Conf. on Very Large Data Bases, pp.323-333, 1998.

[. Ganti, Cactus : Clustering categorical data using summaries, Proceedings of ACM SIGKDD, International Conference on Knowledge Discovery and Data Mining, 1999.

A. Gyenesei and J. Teuholsa-;-lakshmanan, Multidimensional partitioning of attribute ranges for mining frequent fuzzy patterns, Proceedings of VLDB'2002, pp.778-789, 1992.

;. A. Laurent, ;. Laurent, and . Philipp-foliguet, A new approach for the generation of fuzzy summaries based on fuzzy multidimensional databases, Actes des Rencontres francophones sur la logique floue et ses applications, vol.7, pp.189-196, 1999.

[. Yu, Efficiently detecting arbitrary shaped clusters in very large datasets with high dimensions, 1998.

Y. Zhang, ;. D. Yu, and A. Zhang, Clustertree : Integration of cluster representation and nearest neighbor search for large datasets with high dimensionality, IEEE Transactions on Knowledge and Data Engineering (TKDE), vol.14, issue.3, 2003.

L. Zadeh, Summary In the context of multidimensional data, OLAP tools are appropriate for the navigation in the data, aiming at discovering pertinent and abstract knowledge. However, due to the size of the dataset, a systematic and exhaustive exploration is not feasible. Therefore, the problem is to design automatic tools to ease the navigation in the data and their visualization. In this paper, we present a novel approach allowing to build automatically blocks of similar values in a given data cube and to associate these blocks with rules. Our method is based on a level-wise algorithm (a la Apriori) and on the theory of fuzzy sets, Fuzzy sets. Information and Control, pp.338-353, 1965.