Informatics, Balkan Conference in (2009)
Sept. 17, 2009 to Sept. 19, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/BCI.2009.6
Fractal dimension is widely adopted in spatial databases and data mining, among others as a measure of dataset skewness. State-of-the-art algorithms for estimating the fractal dimension exhibit linear runtime complexity whether based on box-counting or approximation schemes. In this paper, we revisit a correlation fractal dimension estimation algorithm that redundantly rescans the dataset and, extending that work, we propose another linear, yet faster and as accurate method, which completes in a single pass.
Fractal dimension, Box-counting, Databases
M. Doumpos and C. Attikos, "Faster Estimation of the Correlation Fractal Dimension Using Box-counting," Informatics, Balkan Conference in(BCI), Thessaloniki, Greece, 2009, pp. 93-95.