A new efficient clustering algorithm for organizing dynamic data collection

We deal with dynamic information organization for more efficient Internet browsing. As the appropriate algorithm for this purpose, we propose modified ART (artificial resonance theory) algorithm, which functions similarly with the dynamic Star-clustering algorithm but performs a more efficient time complexity of O(nk), (k much less than n) instead of O(n(2)log(2)n) found in the dynamic Star-clustering algorithm. In order to see how fast the proposed algorithm is in producing clusters for organizing information, the algorithm is tested on CLASSIC3 in comparison with the dynamic Star-clustering algorithm.