etection) is an algorithm for detecting dense blocks in web-scale tensors.
has the following properties:
- Scalable: D-Cube handles large data not fitting in memory or even on a disk.
- Fast: Even when data fit in memory, D-Cube outperforms its competitors in terms of speed.
- Accurate: D-Cube gives high accuracy in real-world data as well as theoretical accuracy guarantees.
is described in the following paper:
D-Cube: Dense-Block Detection in Terabyte-Scale Tensors
Kijung Shin, Bryan Hooi, Jisu Kim, and Christos Faloutsos.
The 10th ACM International Conference on Web Search and Data Mining (WSDM), Cambridge, UK
[PDF] [Supplementary Document] [BIBTEX]
The source codes used in the paper are available. [Github Repository]