Experimental study on time complexity of GOSCL algorithm for sparse data tables.

Peter Butka Jana Pócsova Jozef Pócs

Published in: SACI (2012)

Keyphrases

experimental study
sparse data
synthetic datasets
computational complexity
worst case
experimental evaluation
space complexity
preprocessing
computer vision
optimal solution
np hard
databases
pattern recognition
k means
data warehouse
high dimensional
multiscale
machine learning
database