Computer Science – Databases
Scientific paper
2009-05-26
Computer Science
Databases
4 pages, to appear in BCI 2009 - 4th Balkan Conference in Informatics
Scientific paper
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.
Attikos Christos
Doumpos Michael
No associations
LandOfFree
Faster estimation of the correlation fractal dimension using box-counting does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Faster estimation of the correlation fractal dimension using box-counting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Faster estimation of the correlation fractal dimension using box-counting will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-646646