Copying or distributing in print or electronic forms without written permission of
Idea Group Inc. is prohibited.
Shanmugasundaram, J., Fayyad, U., & Bradley, P. S. (1999). Compressed data cubes
for olap aggregate query approximation on continuous dimensions. In Proceedings
of the Fifth ACM SIGKDD International Conference on Knowledge
Discovery and Data Mining (pp. 223-232). ACM Press.
Valtchev, P., Missaoui, R., Godin, R., & Meridji, M. (2002). Generating frequent
itemsets incrementally: Two novel approaches based on Galois lattice theory.
Journal of Experimental and Theoretical Artificial Intelligence, 14(2-3), 115-
142.
Valtchev, P., Missaoui, R., & Lebrun, P. (2002). A partition-based approach towards
constructing Galois (concept) lattices. Discrete Mathematics, 256(3),
801-829.
Wang, J., & Karypis, G. (2004). Bamboo: Accelerating closed itemset mining by
deeply pushing the length-decreasing support constraint. In SDM.
Xin, D., Han, J., Li, X., & Wah, B. W. (2003). Star-cubing: Computing iceberg
cubes by top-down and bottom-up integration. In VLDB.
Zaki, M. J., & Hsiao, C.-J. (2002). CHARM: An efficient algorithm for closed
itemset mining. In R. Grossman, J. Han, V. Kumar, H. Mannila, & R. Motwani
(Eds.), Proceedings of the 2nd SIAM International Conference on Data
Mining (ICDM??™02).
Endnote
1 We use a separator-free form for sets.
Pages:
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511