Feature Competitive Algorithm for Dimension Reduction of the Self-Organizing Map Input Space

The self-organizing map (SOM) can classify documents by learning about their interrelationships from its input data. The dimensionality of the SOM input data space based on a document collection is generally high. As the computational complexity of the SOM increases in proportion to the dimension of its input space, high dimensionality not only lowers the efficiency of the initial learning process but also lowers the efficiencies of the subsequent retrieval and the relearning process whenever the input data is updated. A new method called feature competitive algorithm(FCA) is proposed to overcome this problem. The FCA can capture the most significant features that characterize the underlying interrelationships of the entities in the input space to form a dimensionally reduced input space without excessively losing of essential information about the interrelationships. The proposed method was applied to a document collection, consisting of 97 UNIX command manual pages, to test its feasibility and effectiveness. The test results are encouraging. Further discussions on several crucial issues about the FCA are also presented.