Growing hierarchical self-organizing map method using category utility

نویسندگان

  • Kazushi Murakoshi
  • Satoshi Fujikawa
چکیده

In order to automatically obtain hierarchical knowledge representation from a certain data, an unsupervised learning method has been developed that overcomes two problems of the growing hierarchical self-organizing map (GHSOM) method, which uses the quantization error, the deviation of the input data, as evaluation measure of the growing maps: proper control of the growth process of each map is difficult due to the use of the quantization error and the clusters in the hierarchical structure may be excessively subdivided. This improved GHSOM method uses the category utility (CU), a measure used in conceptual clustering for predicting the preferred level of categorization, instead of the quantization error. The CU is useful for organizing the clustering so that people can effortlessly understand it. The basic principle of this method is that the growth and unification processes are appropriately and autonomously controlled by the CU. Evaluation using computer experiments showed that the proposed method can automatically construct an appropriate hierarchical and topological knowledge representation for high-dimensional input data through unsupervised learning. It also showed that it is easier to use and more effective than the original conventional GHSOM method using the quantization error as an evaluation measure.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Intrusion Detection Method Based on Improved Growing Hierarchical Self-Organizing Map

Growing hierarchical self-organizing map (GHSOM), as a kind of topology map, is an effective method to process large scale data. It not only enjoys the advantages of self-organizing map (SOM), but also owns its special multi-layer hierarchical structure which is easy to reveal the hierarchical structure behind the input data by using GHSOM. Though GHSOM has made great progress on the improvemen...

متن کامل

Using Growing hierarchical self-organizing maps for document classification

The self-organizing map has shown to be a stable neural network model for high-dimensional data analysis. However, its applicability is limited by the fact that some knowledge about the data is required to de ne the size of the network. In this paper we present the Growing Hierarchical SOM. This dynamically growing architecture evolves into a hierarchical structure of self-organizing maps accor...

متن کامل

Text Mining with Adaptive Neural Networks

Analysing high-dimensional data is a task where software tools can reasonably assist the data analyst, by visualising, and thereby uncovering, the inherent structure and topology of the data collection. Especially the kinds of tools that can produce results autonomously, i.e. unsupervised tools, are a goal; here, neural network models may be one solution. In the category of unsupervised neural ...

متن کامل

The Growing Hierarchical Self-Organizing Map

In this paper we present the growing hierarchical self-organizing map . This dynamically growing neural network model evolves into a hierarchical structure according to the requirements of the input data during an unsupervised training process. We demonstrate the benefits of this novel neural network model by organizing a real-world document collection according to their similarities.

متن کامل

Cooperative Growing Hierarchical Recurrent Self Organizing Model for Phoneme Recognition

Among the large number of research publications discussing the SOM (Self-Organizing Map) [1, 2, 18, 19] different variants and extensions have been introduced. One of the SOM based models is the Growing Hierarchical Self-Organizing Map (GHSOM) [3-6]. The GHSOM is a neural architecture combining the advantages of two principal extensions of the self-organizing map, dynamic growth and hierarchica...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016