2001 · 229 citations · 19 references
ComputingComputer ScienceAlgorithmsData MiningData StructuresComputational ComplexityData Structure AlgorithmsDimension ReductionDimensionality ReductionScalable Data MiningCube AggregationData CubesHigh-dimensional Data MiningKd-treesMulti-dimensional AggregationSearch Space PruningSpace-partitioning TreesThresholds
It is often too expensive to compute and materialize a complete high-dimensional data cube. Computing an iceberg cube, which contains only aggregates above certain thresholds, is an effective way to derive nontrivial multi-dimensional aggregations for OLAP and data mining.
19
Fast algorithms for mining association rules
Rakesh Agrawal, Ramakrishnan Srikant · 1998 · 10.8K citations
Mining frequent patterns without candidate generation
Jiawei Han, Jian Pei, Yiwen Yin · ACM SIGMOD Record · 2000 · 6.4K citations
Mining frequent patterns without candidate generation
Jiawei Han, Jian Pei, Yiwen Yin · 2000 · 3.2K citations · Full text