• DocumentCode
    917906
  • Title

    Recurrent-Neural-Network-Based Boolean Factor Analysis and Its Application to Word Clustering

  • Author

    Frolov, Alexander A. ; Husek, Dusan ; Polyakov, Pavel Yu

  • Author_Institution
    Inst. of Higher Nervous Activity & Neurophysiol., Russian Acad. of Sci., Moscow, Russia
  • Volume
    20
  • Issue
    7
  • fYear
    2009
  • fDate
    7/1/2009 12:00:00 AM
  • Firstpage
    1073
  • Lastpage
    1086
  • Abstract
    The objective of this paper is to introduce a neural-network-based algorithm for word clustering as an extension of the neural-network-based Boolean factor analysis algorithm (Frolov , 2007). It is shown that this extended algorithm supports even the more complex model of signals that are supposed to be related to textual documents. It is hypothesized that every topic in textual data is characterized by a set of words which coherently appear in documents dedicated to a given topic. The appearance of each word in a document is coded by the activity of a particular neuron. In accordance with the Hebbian learning rule implemented in the network, sets of coherently appearing words (treated as factors) create tightly connected groups of neurons, hence, revealing them as attractors of the network dynamics. The found factors are eliminated from the network memory by the Hebbian unlearning rule facilitating the search of other factors. Topics related to the found sets of words can be identified based on the words´ semantics. To make the method complete, a special technique based on a Bayesian procedure has been developed for the following purposes: first, to provide a complete description of factors in terms of component probability, and second, to enhance the accuracy of classification of signals to determine whether it contains the factor. Since it is assumed that every word may possibly contribute to several topics, the proposed method might be related to the method of fuzzy clustering. In this paper, we show that the results of Boolean factor analysis and fuzzy clustering are not contradictory, but complementary. To demonstrate the capabilities of this attempt, the method is applied to two types of textual data on neural networks in two different languages. The obtained topics and corresponding words are at a good level of agreement despite the fact that identical topics in Russian and English conferences contain different sets of keywords.
  • Keywords
    Bayes methods; Boolean functions; Hebbian learning; fuzzy set theory; pattern classification; pattern clustering; probability; recurrent neural nets; text analysis; Bayesian procedure; Boolean factor analysis algorithm; Hebbian learning rule; component probability; fuzzy clustering; recurrent neural network algorithm; signal classification; textual document; word clustering; word semantics; Associative memory; Boolean factor analysis; Hopfield-like neural network; concepts search; information retrieval; neural network application; neural network architecture; recurrent neural network; statistics; unsupervised learning; Algorithms; Artificial Intelligence; Computer Simulation; Fuzzy Logic; Language; Mathematical Computing; Models, Statistical; Neural Networks (Computer); Semantics;
  • fLanguage
    English
  • Journal_Title
    Neural Networks, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1045-9227
  • Type

    jour

  • DOI
    10.1109/TNN.2009.2016090
  • Filename
    4982625