Mining borders of the difference of two datacubes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3181, Issue , 2004, Pages 391-400

  Casali, Alain ^a  

^a AIX MARSEILLE UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DATA WAREHOUSES; OPTIMIZATION;

BINARY ATTRIBUTES; BOUNDARY SET; CATEGORICAL DATABASE; HYPERGRAPH TRANSVERSALS; LEVEL-WISE ALGORITHMS; MERGING ALGORITHMS; NOVEL CONCEPT; ORDER EMBEDDING;

GEOMETRY;

EID: 35048879774     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30076-2_39     Document Type: Article

References (14)

1. R. J. Bayardo, Jr. Efficiently Mining Long Patterns from Databases. In Proceedings of the International Conference on Management of Data, SIGMOD, pages 85-93, 1998.
2. K. Beyer and R. Ramakrishnan. Bottom-Up Computation of Sparse and Iceberg CUBEs. In Proceedings of the International Conference on Management of Data, SIGMOD, pages 359-370, 1999.
3. T. Calders, R. Ng, and J. Wijsen. Searching for Dependencies at Multiple Abstraction Levels. In ACM Transactions on Database Systems, ACM TODS, volume 27(3), pages 229-260, 2002.
4. A. Casali, R. Cicchetti, and L. Lakhal. Cube Lattices: a Framework for Multidimensional Data Mining. In Proceedings of the 3rd SIAM International Conference on Data Mining, SDM, pages 304-308, 2003.
5. A. Casali, R. Cicchetti, and L. Lakhal. Extracting semantics from data cubes using cube transversals and closures. In Proceedings of the 9th International Conference on Knowledge Discovery and Data Mining, KDD, pages 69-78, 2003.
6. A. Casali, R. Cicchetti, and L. Lakhal. Mining Concise Représentations of Frequent Multidimensional Patterns. In Proceedings of the 11th International Conference on Conceptual Structures, ICCS, 2003.
7. G. Dong and J. Li. Efficient Mining of Emerging Patterns: Discovering Trends and Differences. In Proceedings of the 5th International Conference on Knowledge Discovery and Data Mining, KDD, pages 43-52, 1999.
8. T. Eiter and G. Gottlob. Identifying The Minimal Transversals of a Hypergraph and Related Problems. In SIAM Journal on Computing, volume 24(6), pages 1278-1304, 1995.
9. J. Gray, S. Chaudhuri, A. Bosworth, A. Layman, D. Reichart, M. Venkatrao, F. Pellow, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. In Data Mining and Knowledge Discovery, volume 1(1), pages 29-53, 1997.
10. D. Gunopulos, H. Mannila, R. Khardon, and H. Toivonen. Data mining, hypergraph transversals, and machine learning. In Proceedings of the 16th Symposium on Principles of Database Systems, PODS, pages 209-216, 1997.
11. J. Han, J. Pei, G. Dong, and K. Wang. Efficient Computation of Iceberg Cubes with Complex Measures. In Proceedings of the International Conference on Management of Data, SIGMOD, pages 441-448, 2001.
12. L. Lakshmanan, J. Pei, and J. Han. Quotient Cube: How to Summarize the Semantics of a Data Cube. In Proceedings of the 28th International Conference on Very Large Databases, VLDB, 2002.
13. S. Lopes, J. Petit, and L. Lakhal. Efficient Discovery of Functional Dependencies and Armstrong Relations. In Proceedings of the 7th International Conference on Extending Database Technology, EDBT, pages 350-364, 2000.
14. H. Mannila and H. Toivonen. Levelwise Search and Borders of Theories in Knowledge Discovery. In Data Mining and Knowledge Discovery, volume 1(3), pages 241-258, 1997.