Abstract
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 ≪ 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.
Work supported by the ITRI of the Chung-Ang University.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Montes-y-Gomez, M., Lopez-Lopez, A., Gelbukh, A.: Information Retrieval with Conceptual Graph Matching. In: Ibrahim, M., Küng, J., Revell, N. (eds.) DEXA 2000. LNCS, vol. 1873, pp. 312–321. Springer, Heidelberg (2000)
Aslam, J., Pelekhov, K., Rus, D.: A Practical Clustering Algorithm for Static and Dyamic Information Organization. In: Proceedings of the 1999 Symposium on Discrete Algorithms, Baltimore, MD (1999)
Carpenter, G.A., Grossberg, S., Rosen, D.B.: Fuzzy ART: An Adaptive Resonance Algorithm for Rapid, Stable Classification of Analog Patterns. In: Proceedings of 1991 International Conference Neural Networks, vol. II (1991)
Dhillon, I.S., Modha, D.S.: Concept Decomposition for Large Sparse Text Data using Clustering. Technical Report RJ 10147(9502), IBM Almaden Research Center (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shin, K., Han, S. (2004). A New Efficient Clustering Algorithm for Organizing Dynamic Data Collection. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2004. Lecture Notes in Computer Science, vol 2945. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24630-5_75
Download citation
DOI: https://doi.org/10.1007/978-3-540-24630-5_75
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21006-1
Online ISBN: 978-3-540-24630-5
eBook Packages: Springer Book Archive