AI 2009: AI 2009: Advances in Artificial Intelligence pp 199-209 | Cite as
On Using Adaptive Binary Search Trees to Enhance Self Organizing Maps
Abstract
We present a strategy by which a Self-Organizing Map (SOM) with an underlying Binary Search Tree (BST) structure can be adaptively re-structured using conditional rotations. These rotations on the nodes of the tree are local and are performed in constant time, guaranteeing a decrease in the Weighted Path Length (WPL) of the entire tree. As a result, the algorithm, referred to as the Tree-based Topology-Oriented SOM with Conditional Rotations (TTO-CONROT), converges in such a manner that the neurons are ultimately placed in the input space so as to represent its stochastic distribution, and additionally, the neighborhood properties of the neurons suit the best BST that represents the data.
Keywords
Binary Search Tree Access Probability Best Match Unit Codebook Vector Weighted Path LengthPreview
Unable to display preview. Download preview PDF.
References
- 1.Rauber, A., Merkl, D., Dittenbach, M.: The Growing Hierarchical Self-Organizing Map: exploratory analysis of high-dimensional data. IEEE Transactions on Neural Networks 13(6), 1331–1341 (2002)CrossRefGoogle Scholar
- 2.Guan, L.: Self-organizing trees and forests: A powerful tool in pattern clustering and recognition. In: Campilho, A., Kamel, M.S. (eds.) ICIAR 2006, Part I. LNCS, vol. 4141, pp. 1–14. Springer, Heidelberg (2006)CrossRefGoogle Scholar
- 3.Pakkanen, J., Iivarinen, J., Oja, E.: The Evolving Tree — a novel self-organizing network for data analysis. Neural Processing Letters 20(3), 199–211 (2004)CrossRefGoogle Scholar
- 4.Astudillo, C.A., Oommen, B.J.: A novel self organizing map which utilizes imposed tree-based topologies. In: 6th International Conference on Computer Recognition Systems, vol. 57, pp. 169–178 (2009)Google Scholar
- 5.Knuth, D.E.: The art of computer programming, 2nd edn. Sorting and searching, vol. 3. Addison Wesley Longman Publishing Co., Inc., Redwood City (1998)Google Scholar
- 6.Cheetham, R.P., Oommen, B.J., Ng, D.T.H.: Adaptive structuring of binary search trees using conditional rotations. IEEE Trans. on Knowl. and Data Eng. 5(4), 695–704 (1993)CrossRefGoogle Scholar
- 7.Kohonen, T.: Self-Organizing Maps. Springer-Verlag New York, Inc., Secaucus (2001)MATHGoogle Scholar
- 8.Adelson-Velskii, M., Landis, M.E.: An algorithm for the organization of information. Sov. Math. DokL 3, 1259–1262 (1962)Google Scholar
- 9.Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. McGraw-Hill Science/Engineering/Math., New York (2001)MATHGoogle Scholar
- 10.Lai, T.W.H.: Efficient maintenance of binary search trees. PhD thesis, University of Waterloo, Waterloo, Ont., Canada (1990)Google Scholar
- 11.Astudillo, C.A., Oommen, B.J.: Self organizing maps whose topologies can be learnt with adaptive binary search trees using conditional rotations. Journal version of this paper (2009) (submitted for publication)Google Scholar
- 12.Allen, B., Munro, I.: Self-organizing binary search trees. J. ACM 25(4), 526–535 (1978)MATHCrossRefMathSciNetGoogle Scholar
- 13.Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM 32(3), 652–686 (1985)MATHCrossRefMathSciNetGoogle Scholar
- 14.Bitner, J.R.: Heuristics that dynamically organize data structures. SIAM J. Comput. 8, 82–110 (1979)MATHCrossRefMathSciNetGoogle Scholar
- 15.Mehlhorn, K.: Dynamic binary search. SIAM Journal on Computing 8(2), 175–198 (1979)MATHCrossRefMathSciNetGoogle Scholar