WO2004114145A1 - Neural networks with learning and expression capability - Google Patents

Neural networks with learning and expression capability Download PDF

Info

Publication number
WO2004114145A1
WO2004114145A1 PCT/IB2004/002119 IB2004002119W WO2004114145A1 WO 2004114145 A1 WO2004114145 A1 WO 2004114145A1 IB 2004002119 W IB2004002119 W IB 2004002119W WO 2004114145 A1 WO2004114145 A1 WO 2004114145A1
Authority
WO
WIPO (PCT)
Prior art keywords
neuron
neurons
neural network
elemental
initiating
Prior art date
Application number
PCT/IB2004/002119
Other languages
French (fr)
Inventor
Robert George Hercus
Original Assignee
Neuramatix Sdn. Bhd.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Neuramatix Sdn. Bhd. filed Critical Neuramatix Sdn. Bhd.
Priority to EP04737088.7A priority Critical patent/EP1639494B1/en
Priority to JP2006516581A priority patent/JP4943146B2/en
Priority to US10/560,666 priority patent/US7412426B2/en
Priority to AU2004250403A priority patent/AU2004250403C1/en
Publication of WO2004114145A1 publication Critical patent/WO2004114145A1/en
Priority to IL172201A priority patent/IL172201A/en
Priority to US12/170,335 priority patent/US7778946B2/en
Priority to IL195610A priority patent/IL195610A/en

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/02Neural networks
    • G06N3/10Interfaces, programming languages or software development kits, e.g. for simulating neural networks
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/02Neural networks
    • G06N3/08Learning methods
    • G06N3/082Learning methods modifying the architecture, e.g. adding, deleting or silencing nodes or connections

Definitions

  • each hidden layer neuron can receive inputs from multiple input neurons concurrently.
  • a fifth aspect provides a neural network comprising a plurality of neurons, each neuron being represented in its entirety by a single node in an array.
  • Figure 2 is a further illustration of an existing neural network structure
  • Figure 3 is an illustration of an existing relationship between two neurons and a synapse
  • the logic of the association is that for any two active neurons A and B that are activated or fire, one of them will be an initiating neuron.
  • the third neuron C will associate the initiating neuron with the second neuron preserving their order of activation or firing.
  • neuron C represents the combined events of the initiating neural event followed by the second neural event.
  • This new neuron C can subsequently participate in combining with other neurons (thus creating new associations), and so forth.
  • the basic rule for creating new neurons is that if neuron A is activated or fired, concurrent with or followed by neuron B being activated or fired, then a new neuron C can be constructed and possibly activated or fired, representing the association of neurons A and B (i.e. the association of events AB in time or space).
  • neuron C already exists due to a prior event or association then neuron C can likewise be reactivated and fired, allowing it to participate in subsequent existing or new activations, thereby allowing it to form new associations. This allows for the construction of neural networks with an unlimited numbers of associations and/or relationships.
  • the present invention provides for the capability for 'expression', whereby the sequence of events that leads to the construction of any neuron can be expressed.
  • the importance of expression is that it allows a complete sequence of events to be represented by a single neuron, and that sequence can be reproduced by activating that single neuron and, in turn, the neurons that represent the association that is the initiating neuron and the associated neuron in the same relative position or order in which they were created, and so forth. In this manner it is possible for a single neuron representing a complete experience or memory (sequence of events) to be expressed, recalling the experience.

Abstract

A neural network comprising a plurality of neurons in which any one of the plurality of neurons is able to associate with itself or another neuron in the plurality of neurons via active connections to a further neuron in the pluarlity of neurons.

Description

NEURAL NETWORKS WITH LEARNING AND EXPRESSION CAPABILITY Field of Invention
This invention relates to neural networks and particularly, though not exclusively, to neural networks based on one or more characteristics including temporal, spatial, intensity, magnitude, and relative position; and may be used for one or more of: learning, knowledge acquisition, discovery, data mining and expression.
Background to the Invention
Existing neural networks are typically based on a single interpretation of Hebbian learning. This basic, Hebbian concept is often stated as "Neurons that fire together wire together". The defacto interpretation is that "wiring together" is effected via the synapse that connects the two neurons together. The strength of the connecting synapse is modified or weighted to reflect the importance/probability of the presynaptic neuron firing concurrently with the postsynaptic neuron, or vice versa.
Using the concept, neural networks have been developed that associate a number of input neurons to a number of output neurons via synapses. The input neurons define the input states; and the output neurons define the desired output states.
Thus nearly all existing neural networks are based on the concept of three layers: an input neuron layer, a hidden neuron layer, and an output neuron layer. Figure 1 and Figure 2 are illustrations of existing neural networks.
Training of such neural networks is accomplished, in its most basic form, by applying a specific input state to all the input neurons, selecting a specific output neuron to represent that input state, and adjusting the synaptic strengths or weights in the hidden layer. That is, training is conducted assuming knowledge of the desired output. After training has been completed, the application of different input states will result in different output neurons being activated with different levels of confidence. Thus recognition of an input event depends on how close the original training states match the current input state.
Such neural networks typically require extensive, repetitive training with hundreds or thousands of different input states, depending on the number of desired output neurons and the accuracy of the desired result. This results in practical networks of the order of only 10,000 input and output neurons with as many as 10 million interconnecting synapses or weights representing synapses (current existing neural networks are very small in size as compared to the capacity of the human brain which has 1012 neurons, and 1016 synaptic connections).
Furthermore, existing networks are trained on the basis of generating predefined output neurons, and can subsequently recognise inputs that closely resemble the training sets used for input. Existing neural networks are not capable of independent learning as they are trained using prior assumptions - the desired goals are represented by the output neurons. Existing neural networks are not capable of expressing or recollecting an input state based on the stimulus of any output neuron in the output layer.
Existing neural networks are trained on the basis of applying independent input states, to the network, in which the order of training is typically insignificant. On completion of extensive, repetitive training, the output neurons are not significantly dependent on the order in which input states are applied to the network. Existing neural networks provide outputs that are based entirely on the current input state. The order in which input states are applied has no bearing on the network's ability to recognise them.
Existing neural networks may have some or all of the following shortcomings: 1. they require prior training, based on predetermined or desired output goals - they do not learn; 2. they can only recognise input states (objects) similar to the input states for which they have been trained;
3. they are highly computational, and therefore slow;
4. they are computationally restricted to represent only a relatively small number of neurons; 6. they need retraining if they are to recognise different objects;
7. they cannot express or recall an input object by applying a stimulus to the output neurons;
8. they are based on concurrent stimuli of all input neurons; 9. they are not creative and they cannot express or recollect events; they can only identify/recognise events for which they have been trained; 10. they assume neurons that fire concurrently or in quick succession, are linked synaptically but do not distinguish one from the other or the order of neuron firing; and 11. each hidden layer neuron can receive inputs from multiple input neurons concurrently.
Summary of the Invention
In accordance with one aspect, there is provided a neural network comprising a plurality of neurons in which any one of the plurality of neurons is able to associate or associate with itself or any other neuron in the plurality of neurons via active connections to a further neuron in the plurality of neurons. This process is referred to as learning.
In accordance with a second aspect there is provided a neural network comprising a plurality of elemental neurons, and a plurality of structural neurons for representing associations between any pair of neurons, the pair of neurons being selected from the group consisting of: both elemental neurons, both structural neurons, one structural and one elemental neuron, and one elemental neuron and one structural neuron.
Each structural neuron may represent the combined information or memory represented by a pair of neurons. The process of recalling the pair of neurons that were combined to form a structural neuron is referred to as expression. Each structural neuron may receive input from only two neurons.
The plurality of elemental neurons may be represented in the root level of the neural network structure; and each elemental neuron may represent at least one of: an elemental stimulus, a defined elemental pattern, and a defined elemental data element. Each elemental neuron may represent one or both of: basic input stimuli and output stimuli of information being processed. Each elemental neuron may be an equivalent of a neuron in a brain, the neuron in the brain being selected from the group consisting of: a sensor neuron, a motor neuron, an intracortical neuron and an intercortical neuron. The information represented by a neuron may be memory, and the processing may be learning or expression.
The plurality of neuron associations may be represented in a plurality of deeper neural levels. The number of levels in the plurality of deeper levels may be determined by the extent of the memory or pattern to be processed or expressed, where a memory represents a plurality of elemental neurons. The number of elemental neurons and structural neurons required to represent the memory may be determined by the nature of the memory to be processed.
In accordance with a third aspect there is provided a neural network comprising a plurality of neurons linked by associations, all associations of neurons in a level of the neural network that is the same or deeper being able to be expressed.
A fourth aspect provides a neural network comprising a plurality of neurons, each neuron being represented by a unique addressable node in an array.
A fifth aspect provides a neural network comprising a plurality of neurons, each neuron being represented in its entirety by a single node in an array.
A sixth aspect is a neural network comprising a plurality of nodes in an array, each node in the array comprising pointers. Each pointer is a data element of the node that represents a unique address of a specific node in the array, each address representing a neuron of a plurality of neurons. Each pointer represents a synaptic connection.
A seventh aspect there is provided a neural network comprising a plurality of neurons in an array, there being pointers in each node of the array for providing expression and for learning of memories. A penultimate aspect provides a neural network comprising a plurality of neurons, each neuron being represented by a node in an array, each node having a plurality of pointers, each pointer in each node having a specific and unique function. Except where a pointer may represent the value of an elemental stimulus in the elemental or root level neurons, each pointer contains an address of another neuron. The number of pointers required may depend on the functions being performed by the neural network. For a neural network performing learning and expression functions, the number of pointers needed will be at least four.
In this manner each neuron in the plurality of neurons may be represented by a node of the same size in the array representing the plurality of neurons, each node containing a fixed number of pointers.
Nodes in an array used to represent neurons may also maintain additional data elements other than pointers pertaining to the characteristics of each neuron. Data elements may be defined to represent the frequency of each neuron's activation, the strength of its associations, and so forth.
The present invention also extends to a computer usable medium comprising a computer program code configured to cause one or more processors to execute one or more functions to perform the methods described above.
In a final aspect there is provided a neural network wherein the neural network is bidirectional and is enabled to operate in a forward direction where nodes are derived or created from input, and in a reverse direction where input is derived from nodes. The forward direction is learning and the reverse direction is expression.
The neural network may be used for one or more of: monitoring and predicting stock price movements, Internet surveillance, Internet security, computer virus and spam detection, data compression, phrase recognition in speech and text, clauses in speech and text, plagiarism detection, bioinformatics, vision recognition, semantic analysis and representation of ontologies, and robotics. Brief Description of the Drawings
In order that the invention may be readily understood and put into practical effect there shall now be described by way of non-limitative example only preferred embodiments of the present invention, the description being with reference to the accompanying illustrative drawings in which:
Figure 1 is an illustration of an existing neural network structure;
Figure 2 is a further illustration of an existing neural network structure;
Figure 3 is an illustration of an existing relationship between two neurons and a synapse;
Figure 4 is an illustration of the relationship between three neurons according to the present invention;
Figure 5 is a flow chart of the process flow of the present invention;
Figure 6 is an illustration of the relationship between neurons and pointers/links; Figure 7 is an illustration of a sequence of events to illustrate association;
Figure 8 is a flow chart for the learning process;
Figure 9 is a flow chart for the matching process;
Figure 10 is a flow chart for creating neurons during the learning process; and
Figure 11 is a flow chart of the process for expressing of neurons.
Description of Preferred Embodiments
According to a preferred aspect the present invention provides neural networks, and a method for constructing such neural networks via neuron associations, that are based on characteristics that include at least one of temporal, spatial, intensity, magnitude, and relative position, for the formation of memories, that consist of one or both of either input stimuli (represented by elemental neurons) or output actions (represented by elemental neurons) in a natural manner.
It also provides for either or both of memory recollection and memory expression of one or more of the memories represented by structural neurons, which represent multiple elemental stimuli. The neural network allows for the potential expression of new actions or ideas other than what it has learnt and in such a manner may exhibit creativity. Input stimuli may include one or more of: audio, visual, tactile, and so forth. Output stimuli may include one or more of: movement, motion, speech, and so forth, each defined by appropriate elemental neurons.
Existing neural networks are based on the assumption that concurrently activating two neurons (neurons B and C) creates an active synaptic connection between them, or strengthens existing synaptic connections. This is illustrated in Figure 3 where there are two neurons and one synapse.
Accordingly to one aspect of the present invention, stimulating or activating two neurons creates an association between them via another third neuron, the associating neuron. This is illustrated in Figure 4 where there are three neurons 41 , 42 and 43 and two synapses 44 and 45. For convenience, this basic neural structure will be called a "neuronal assembly" throughout this specification. Neurons 41 , 42 and 43 may be associated together based on proximal characteristics, including at least one of temporal, spatial, intensity, magnitude and relative position. Neuron 43 will be at a deeper level within the neural structure than both of neurons 41 , 42. Neurons 41 ,42 may be in the same level, or may be in different levels of the neural structure. The depth or level of a neuron in a neural network structure is based on the number of steps required to express the elemental neurons that it represents.
The neural structure comprises neurons, where each neuron represents a memory of data, events, objects, concepts or actions. The type of information represented by each neuron can vary, and is dependent on the elemental neurons (representing sensor and/or motor neuron stimuli) from which the neural network is constructed. Elemental stimuli are only represented in the elemental neurons maintained at the root levels of every neural network structure. Deeper or subsequent level neurons (structural neurons) only represent the association of other neurons and do not in themselves store sensor, motor or elemental stimulus values.
Each neuron in the neural structure may represent the association of only two neurons, one an initiating neuron and the other an associated neuron, although each neuron may participate as an initiating neuron and/or as an associated neuron in an unlimited number of associations, via associating neurons. An initiating neuron 41 can have any number of successor neurons such as neuron 43, where a successor neuron to neuron 41 is a associating neuron (43) that has neuron 41 as its initiating neuron. Another neuron 42 can have any number of precessor neurons, where a precessor neuron to neuron 42 is a associating neuron (43) that has neuron 42 as its associated neuron. Thus, neuron 43 can be referred to as an associating neuron, or a successor neuron to neuron 41 , or as a precessor neuron to neuron 42.
The association is by one of the elemental neurons 41 , 42 being an initiating neuron and one is an associated neuron. Assuming neuron 41 is the initiating neuron and thus neuron 42 is the associated neuron, when neuron 41 is activated or fires associating neuron 43 is potentiated. At the same time as, or subsequent to neuron 41 firing neuron 42 is activated or fires and also potentiates associating neuron 43. Neuron 43 is then considered activated. If the associating neuron 43 was non existent ( that is there existed no neuron associating the initiating neuron 41 and the associated neuron 42 ) then it is created and may be then activated, otherwise it is only activated. The proximal activation or firing of neurons 41 and 42 causes the activation of associating neuron 43, and the creation of active connections, or the strengthening of
, existing synaptic connections, between neurons 41 and 43 and neurons 42 and 43.
The associating neuron 43 represents the sum of what is learnt from the other two neurons 41 , 42. This sum may include one or more of a memory trace, a combination of the experience of the two, a sequence of events, a proximity of events and so forth. Once a associating neuron is activated or created to represent a desired memory or events, the desired memory or events need not be recreated in another neuron.
The definition of proximity or proximal activation or firing will be set by the rules of operation for each neural network. Proximity ("ΔP") may vary across a level, and across levels, and may vary according to the type of elemental neuron being represented. Neurons at deeper levels within the neural network are less likely to be in close proximity, thus it is likely that ΔP will increase. If ΔP represents time or temporal events ΔP may be as short as zero, milliseconds or seconds, or as long as minutes, hours, days or weeks. Events that occur simultaneously in the real world may still be represented temporally based on differences in synaptic activation or firing times or the length of dendritic firing paths. It may also vary according to the processing requirements of the memories or events being represented by the neural structure. ΔP may also represent spatial relations between objects or events and can also represent the topological spatial relationships of neurons in the brain.
A neural network according to the present invention consists of two basic elements: 1. Elemental neurons, which can represent elemental stimuli, sensor or motor neurons or such elemental data as required or desired. These are the elemental or root neurons from which a neural network is constructed. Different types of elemental neurons may be defined depending on the type of experience or events or information being represented. For example if representing the auditory cortex the elemental neurons would be for representing distinct sounds. Elemental neurons may incorporate a number of different types of elemental neurons such as, for example, one set for representing sound energy or intensity of the sound (volume), and another set for representing the frequency of the sound.
If representing smell and taste there may be a set of elemental neurons for taste and another set for olfactory sensing.
In vision there may be sets of elemental neurons to represent the colour cones, rods, edges, contrast, movement, and so forth, as represented by the ganglion cells, or specifically to represent the photoreceptor neurons.
For skin receptors there may be elemental neurons corresponding to touch - mechanoreceptor neurons; temperature - thermo receptor neurons; pain - nociceptor neurons; and so forth. Motion can be represented by the various types of motor neurons that induce movement.
When a sensory neuron is activated or fires, it communicates to different areas of the brain via synapses or nerve cells that a certain form of energy from a specific cell or sensory organ at a specific location has been received. All sensory neurons have similar central processing mechanisms. When a motor neuron is activated or fired in the brain it induces muscle contraction at a specific location in the body thus producing movement. When a sensory neuron detects an event it passes the data to the brain where it is processed in the brain's neural structure.
Artificial elemental neurons may also be defined. For example, if using the neural structure to process English text, a set of elemental neurons may be defined to represent the alphabetic characters and punctuation characters. For the Chinese language, elemental neurons could be defined for each Chinese character, or a subset thereof. If using the neural structure to process protein sequences, the elemental neurons may be defined to represent the twenty amino acids, or subsets thereof. For speech, different motor neurons may be defined to produce different muscular contractions resulting in the production of sounds corresponding to phonemes, and so forth.
Elemental neurons can be initiating and associated neurons but cannot be a associating neuron.
2. Structural neurons representing the neural structure. The neural structure as illustrated in Figure 4 consists of neurons that represent the association of other neurons, whether they are sensor neurons, motor neurons, or other structural neurons. In this manner neural structures can grow, representing more and more information.
Structural neurons can also be used to form associations between structural neurons representing different sets of elemental neurons. For example, an association may be formed between the English word "ball" represented by an association of alphabetic elemental neurons, with the shape "ball" represented by an association of visual elemental neurons. In this manner it is possible to build neural networks which allow the association of information across different cortexes or across different neural networks. Another association between the shape "ball" may exist with the spoken word "ball" represented by an association of motor neurons to enable phoneme neurons to produce the sound "ball". Structural neurons are associated with each other on the basis of characteristics including temporal, spatial, intensity, magnitude and relative position. If representing speech with the neural structure, the associations would be of a temporal nature, representing the sequence of phonemes, words, phrases, clauses, and so forth, used in expressing speech. Likewise, if processing text or reading a book the processing of individual characters would be of a temporal nature building up the words, phrases, clauses, and so forth. Many neurons in the brain are also organised spatially or topographically, such as those for vision, hearing, touch, pain, and so forth. As such it is possible to construct neural structures that represent spatial characteristics. For example, in forming a neural structure representing a visual scene, neurons representing edges or lines or curves or objects or patterns may be associated into a neural structure that associates elemental neurons representing pixels into lines or curves based on proximity, near objects with far objects, or high objects with low objects, thus building a three dimensional map of the environment.
The same neural structure can be used to represent information in any of the four dimensions defined by space and time.
As above, the shape "ball" - represented by a spatial neural structure - may be associated with the spoken word "ball" represented by a temporal neural structure.
A structural neuron is a associating neuron. It can also be one or both of an initiating neuron and an associated neuron.
The combination of elemental neurons at the root levels of association within the neural structure allows for the creation of structural neurons that represent particular elemental features or characteristics within a cortex (neuronal assemblies). The neural structure allows for the representation of feature combinations by dynamic association within the neural structure. Neural activity in the neocortex that is evoked by sensory neurons is always distributed in the brain to different areas. In sensory systems, different areas of the brain can process different aspects (spatialΛemporal/intensity/magnitude/relative position) of the same input stimuli. The proposed neural structure allows for intra-areal neural associations in order to represent coherent concepts/percepts and behaviour. Deeper levels of association within the neural structure (intra cortico-cortical associations) allows for the representation of increasingly complex information or behaviour.
Neurons may be organised, classified or named according to their functions, characteristics, levels, nature, and so forth. Neurons may also be defined for a particular dimension. That dimension may be time, distance, space, length, height, pitch, amplitude, or any other definable characteristic.
Within its particular dimension, any two neurons may be differentiated according to their relative or related occurrence, position, scale or magnitude. This relative positioning is represented by ΔP.
The basic underlying parameter for constructing a neural network is that for any two active neurons A related to B by relative position there exists a third neuron C that has connections via synapses to both neurons A and B. If such a neuron doesn't exist then it is possible to create such a neuron and its connections. Therefore neuron C associates neurons A and B together maintaining their relative positions. A and B may be, but do not have to be, contiguous or consecutive within their relative positions. Therefore neuron C can associate any two neurons A and B which represent events whether the events are concurrent, contiguous, consecutive, non-contiguous, non- consecutive or overlapping.
The logic of the association is that for any two active neurons A and B that are activated or fire, one of them will be an initiating neuron. The third neuron C will associate the initiating neuron with the second neuron preserving their order of activation or firing. As such, neuron C represents the combined events of the initiating neural event followed by the second neural event. This new neuron C can subsequently participate in combining with other neurons (thus creating new associations), and so forth. The basic rule for creating new neurons is that if neuron A is activated or fired, concurrent with or followed by neuron B being activated or fired, then a new neuron C can be constructed and possibly activated or fired, representing the association of neurons A and B (i.e. the association of events AB in time or space). If neuron C already exists due to a prior event or association then neuron C can likewise be reactivated and fired, allowing it to participate in subsequent existing or new activations, thereby allowing it to form new associations. This allows for the construction of neural networks with an unlimited numbers of associations and/or relationships.
A flowchart representing the basic flow for creating a new neural network is shown in Figure 5. This preferred example shows the processing steps and application of the model for processing a simple sequence of elemental events.
In Figure 5, the neural network or array representing the neural network is initialized at 50. At 51 the type or category of each elemental neuron is defined and may be related to, for example, text, vision pitch, colour, edge, sound, volume, taste, olfactory sensing, colour cones, rods, pain, contrast, movement, muscular movement, ganglion cells, photoreceptors, touch, mechanoreceptors, temperature, thermo-receptor, nociceptor, motion, language, characters, letters, words, and so forth.
The elemental neurons are then defined/programmed/input at 52. The question is then asked: does the elemental neuron already exist? (53). For each unique value to be represented for each defined type of defined elemental neuron, all elemental neurons must be created, and are attached as a list of successor neurons to the root neuron, the root neuron being represented by node zero in the array representing the neural network. If the answer to the query is no, a new elemental neuron is created (54) and the process returns to (52). If yes, the process continues to 55. Here, the rules to associate neurons is defined. Alternatively, new elemental neurons may be defined as and when they occur during the learning process.
The first, or next initiating, neuron is then found (56). This is designated neuron A. The subsequent neuron (neuron B) is then found (57). If an association of neuron A and neuron B already exists (58), the process reverts back to 56. If not, a neuron C is created as representing the association or combination of neuron A and neuron B (59) and the process reverts back to 56. Neuron C can be referred to in this process as the associating neuron.
Figure 8 is a flow chart providing more detail of steps 56 to 59 of Figure 5. Here, neural processing or learning is of an experience represented by a pattern or sequence of elemental neuron events.
In step 81 , the event pointer is set to the first elemental event in the event pattern or sequence. A matching neuron is found in step 82. The matching neuron is a neuron (memory) in the neural network that matches the leading event or events in the pattern or sequence of events pointed to by the event pointer. This matching neuron is defined as the initiating neuron (neuron A). The event pointer is then updated according to the defined rules for the neural network to point to the next event.
Another matching neuron is then found in step 83. Again, this neuron (memory) is for the event or events in the pattern or sequence of events pointed to by the event pointer. This another matching neuron is defined as the associated neuron (neuron B). The event pointer is then updated according to the defined rules for the neural network to point to the next event. In this manner new associating neurons or associations are always created, subject to any rules to the contrary. Generally the neuron C could not have previously existed, otherwise it would have been matched at step 82.
Having completed the processing of a single pass, the same data or event sequence may be processed again if so desired, extending the neural network structure accordingly.
A further neuron that has not been used is then found in step 84. This is created as the associating neuron (neuron C) in step 85. The process of steps 82 to 85 are repeated in 86 until there are no more events in the pattern or sequence of events being processed.
Figure 9 provides more detail of the process steps 82 and 83 of Figure 8 - the finding of a matching neuron. In step 91 the matching neuron pointer is set to zero by pointing to the root neuron. For each successor neuron of the matching neuron (step 91), a check is conducted to determine if the complete expression of the successor neuron matches the subsequent event or events or sequence in the pattern or sequence of events being processed. If it does, the process moves to step 93 where the pointer for the matching neuron is set to point to the successor neuron that matches the event pattern or sequence. In addition, the event pointer may be adjusted to point to the remainder of the pattern or sequence of events that, as yet, have not been matched. The process then reverts to step 92 and continues. If the result of step 92 is that it doesn't match, in step 94 the matching neuron pointer is returned pointing to the last matching neuron, and the process ends in step 95.
Figure 10 illustrates in more detail the process of step 85 in Figure 8 -the creation of a associating neuron. In step 101 , the initiating pointer of the associating neuron is set to the point to the initiating neuron, and in step 102 the associated neuron pointer of the associating neuron is set to the associated neuron. As the associating neuron has no successor neurons (having been just activated or created), its successor neuron pointer is set to zero (step 103). The next neuron pointer of the associating neuron is then set to be equal to the successor neuron pointer of the initiating neuron. Finally, in step 105, the successor pointer of the initiating neuron is set to point to the associating neuron and thus the associating neuron becomes the first entry in the list of successor neurons to the initiating neuron.
A group of elemental neurons representing a common characteristic may be organised into a cortex. Thus, it is possible to have a visual cortex containing groups of neurons which relate to a first visual characteristic (for example, a group of neurons for colour); a second group for second visual characteristic (for example, shape); a third group for a third visual characteristic (for example, size), and so forth. Structural neurons from one neural network, representing distinct patterns or events, can be elemental neurons in another neural network. Multiple cortexes, possibly represented by multiple neural networks (and the neurons within them), may be interlinked and related to form an integrated 'brain' which can provide not only an integrated learning environment, but also the potential for intelligent behaviour. Traditional neural networks are typically unidirectional. This means that, given a certain input the output can be derived. However, they cannot work in the reverse direction. That is, given the output, it is not possible to derive the input.
The present invention provides for the capability for 'expression', whereby the sequence of events that leads to the construction of any neuron can be expressed. The importance of expression is that it allows a complete sequence of events to be represented by a single neuron, and that sequence can be reproduced by activating that single neuron and, in turn, the neurons that represent the association that is the initiating neuron and the associated neuron in the same relative position or order in which they were created, and so forth. In this manner it is possible for a single neuron representing a complete experience or memory (sequence of events) to be expressed, recalling the experience.
The expression ability is implemented by way of the initiating pointer and the associated pointer for each neuron in the neural structure.
Expression is illustrated in Figure 11. When expression is required, the first check in step 111 is to determine if the initiating pointer of the neuron to be expressed is equal to zero. If yes, it must be an elemental neuron and the process reverts to step 114 where expression is activation of the element event or value stored in the associated neuron to represent the elemental neuron. If the value is not zero, step 112 is started. In step 112 is expression of the neuron pointed to by the initiating neuron pointer of the neuron to be expressed. In step 113 is expression of the neuron pointed to by the associated neuron pointer of the neuron to be expressed. This continues until all elemental neurons representing the memory have been expressed.
Each neuron in the network has an address to identify its location within an addressable array of nodes where each node represents a single neuron. All neuron pointers refer to an address of a node representing a single neuron in the array of neurons. The bit size of the address or pointer will influence the maximum number of neurons possible to be represented in the array representing the neural network. For example: using a pointer address size of 32 bits will allow the construction of neural networks consisting of 2 or 4,294,967,296 neurons. Each neuron is represented by a single fixed length node in a conventional array or structure. The number of neurons that may be stored in an array will be dependent on the total memory storage available (internal and/or external), and on the pointer address architecture:
(a) a 16 bit pointer address architecture will allow for up to 216 neurons.
This is 6.4 x 103 neurons;
(b) a 32 bit pointer address architecture will allow for up to 2 neurons.
This is 4.1 x 109 neurons;
(c) a 48 bit pointer address architecture will allow for up to 2 ,4a neurons. This is 2.7 x 10 ,14 . neurons; and
(d) a 64 bit pointer address architecture will allow for up to 264 neurons. This is 1.8 x 1019 neurons.
As the human brain has approximately 1012 neurons, it may be possible match the capacity of a hundred human brains using a 48 bit pointer address architecture. Based on the latest computers that support 64 bit addressing, it may be possible to have the capacity to represent neural structures consisting of 1019 neurons, the equivalent size of 10 million human brains wired together.
To represent the neural network, a node will consist of a minimum of four pointers. Each pointer contains an address to another neuron. As explained above, using an address size of 32 bits will allow the construction of neural networks consisting of up to 232, or 4 billion, neurons.
As shown in Figure 6, each neuron may be represented by four pointers/links (Pi, P2, P3 and P4), in the most basic implementation. Each pointer is a link to the address or location of another neuron. Typically, a neuron will have four pointers, the minimum needed to create an intelligent neural network with expression capabilities. However, a neuron may have more than four pointers, to provide additional functionality. For example in creating neuron C to represent the association of an initiating neuron A and an associated neuron B, the following pointers are required for neuron C:
P1 - a pointer to the initiating neuron, i.e. neuron A;
P2 - a pointer to the other neuron that participates in forming the association, i.e. neuron B; P3 - a pointer to a list (LsC) of deeper level neurons that has neuron C as an initiating neuron (a successor pointer for neuron C); and P4 - a pointer to the next neuron, (LA) that has neuron A as its initiating neuron (a 'next successor* pointer for neuron A).
Additional pointers can also be defined for neuron C if necessary to provide information on the precessors to the associated neuron. For example:
P5 - a pointer to a list (LpC) of deeper level neurons that has neuron C as an associated neuron (a precessor pointer); and P6 - a pointer to the next neuron in a list (LB) that has neuron B as its associated neuron (a 'next precessor' pointer).
Deeper level neurons may represent complex sequences of events. Since each structural neuron has at least one initiating neuron, and one associated neuron, a single neuron at level 10 may represent a sequence of up to 210 or 1 ,024 elemental events. It is not a necessary condition that neurons can only associate with neurons of the same level.
Thus, in storing new sequences of events it is only necessary to identify those existing neurons which represent existing event sequences in the event stream and associate these together by constructing new neurons, e.g. if we have two event sequences of say 1,024 events and 512 events, respectively, it is possible to construct a single, new neuron to represent an event sequence of 1 ,536 events. Thus new sequence/event information can be economically represented in the neural network.
This is illustrated in Figure 7. Figure 7 is an illustration of a possible neural network derived from processing text and learning, for the sentence; "The cat sat on the mat." An arrowed line indicates the connection between an initiating neuron and a associating neuron, and a circled line indicates a connection between the associated neuron and the associating neuron.
In Figure 7(a), the first elemental neuron 701 and the second elemental neuron 702 in level zero recognise or represent the letters "T" and "H" and associate to form the letter combination TH" represented by the associating neuron 711 in level 1. Figure 7(b) shows the third elemental neuron 703 recognising the letter "E" and the fourth elemental neuron 704 recognising the space "Λ". These two associate together to form the combination "EΛ" represented by associating neuron 712 in level 1. The structural neurons 711 and 712 in level 1 associate to form the distinct word "THEΛ" represented by the associating neuron 721.
In Figure 7(c), (d) and (e), the next two elemental neurons in level zero - 705 and 706 - recognise the letters "C" and "A" respectively, and associate to form the letter combination "CA" represented by associating neuron 713 in level 1.
For the letters "T" and "Λ", neuron 701 associates with neuron 704 to create a associating neuron 714 in level 1 representing the combination "TΛ". Neurons 714 and 713 then associate to create a associating neuron 722 in level 2 thus forming the distinct word "CATΛ" (Figure 7(e)). Neurons 721 and 722 can then associate to give a result at the associating neuron 731 in level 3 to form the phrase "THEΛ CATΛ" (Figures 7(f) and 7(g)).
For the word "SATΛ", as is shown in Figures 7(h), neuron 707 recognises the letter "S" and associates with neuron 706 to give a result at associating neuron 715 in level 1 for the letter combination "SA". Neuron 715 associates with neuron 714 in level 1 ("TΛ") to give a result at associating neuron 723 in level 2 for the distinct word "SATΛ".
In Figures 7(i) and 7(j), neurons 708 and 709 recognise the letters "O" and "N" respectively and associate to form the letter combination (and word) "ON" represented by associating neuron 716 in level 1. Neuron 716 associates with neuron 704 to give a result at associating neuron 724 in level 2 for the distinct word "ONA". Neuron 723 in level 2 associates with neuron 724 to give a result at associating neuron 732 in level 3 for the clause "SA ON". Neurons 731 and 732 in level 3 may associate to give a result at neuron 741 in level 4 for the clause "THEΛCATΛSATΛONΛ".
Figures 7(k) and (I) illustrate neuron 7010 recognising the letter "M" and associating with neuron 706 to give a result at neuron 717 in level 1 for the letter combination "MA". Neuron 717 associates with neuron 712 ("TΛ") to give a result at neuron 725 for the distinct word "MATΛ". Neuron 721 associates with neuron 725 ("THEΛ") to give a result at neuron 733 for the phrase HEΛMATΛ".
Neurons 741 and 733 can associate to give a result at neuron 751 in level 5 for the sentence "THEΛCATΛSATΛONΛTHEΛMAT". It is clear that each associating neuron has at most one initiating neuron and one associated neuron. However, neurons can have multiple successor and precessor neurons. For example elemental neuron 701 T has successor neurons representing "TH" (711) and representing "TΛ"(714). Elemental neuron 706 "A" has three precessor neurons representing "CA"(713), "SA" (715) and "MA"(717).
To extend the sentence illustrated in Figure 7(m) where the neuron 7011 in level 0 recognises the letter "D". Neuron 7011 associates with neuron 704 to give a result at neuron 719 for the combination "DΛ". Neuron 706 associates with neuron 709 to give a result at neuron 720 for the combination "AN". Neuron 720 associates with neuron 719 to give a result at neuron 726 for the combination "ANDΛ". Neuron 733 associates with neuron 726 to give a result at neuron 742 for the combination "THEΛMATΛANDΛ". Neurons 741 and 742 may the associate to give a result at neuron 752 for the combination to represent the phrase "THEΛCATΛSATΛONΛTHEΛMATΛANDΛ"
In Figure 7(n) it shows that in level 0 each elemental neuron represents only 1 letter/character. Each neuron in level 1 represents an association of 2 letters/characters; in level 2 each neuron may represents an association of up to 4 letters/characters; in level 3 up to 8 letters characters; up to 16 letters/characters in level 4; up to 32 letters/characters in level 5; and so forth in multiples of 2 until each neuron in level 10 could represent the association of up to 1 ,024 letters/characters; and each neuron in level 20 could represent the association of up to 1 ,048,576 elemental events.
As can be seen, for text recognition the number of elemental neurons required is quite limited. One elemental neuron would be required for each of:
1. the 26 letters of the alphabet upper case;
2. the 26 letters of the alphabet lower case;
3. the 10 numbers; 4. the 32 punctuation and similar characters on the standard alphanumeric keyboard;
5. any other special characters (e.g. from the Greek alphabet) that may be required.
The number of structural neurons required and the number of levels of structured neurons required can grow in consequence of use of the neural network, during the learning process. Using the example of text recognition, the number of documents concerned, the size of the learning event(s) concerned, the use of language in the documents, and the maximum possible number of words, phrases, clauses, sentences, paragraphs, chapters, books, and so forth will impact the size of the resulting neural network structure. By way of example, if all the plays of William Shakespeare were recorded using the present invention in text recognition, after the first play was recorded there would be a certain number of structural neurons "N1". When the second play was recorded, within the same neural network, the total neurons required would not be the simple arithmetic sum of those required for the independent processing of each of the plays. Only the extra neurons required to process the second play above and beyond those created for the first play would be added to N1 to give the enlarged total N2. Neurons for any previously existing letters, words, phrases, clauses, sentences (and so forth) would not be added, but their new associations would be added. Upon the third play being recorded, the extra neurons required would be added in the same way to give N3.
By the time the final play was entered, the increase in the number of neurons required would not be great. The main increase would be at deeper levels in the neuron structure where new associations would be added. The deepest level could be a single neuron having all associations required to represent in their entirety all the plays.
As each neuron in each level can associate with any other neuron in any level to give a result at a third neuron, the number of potential permutations and combinations available is very large. From a consideration of Figure 7, there are different combinations that may be used to provide the result at neuron 751 "THEΛCATΛSATnONΛTHEΛMAT". For example, in level 1 as illustrated the following combinations are recorded:
"TH", "EΛ", "CA", TΛ", "SA", "ON", and "MA". Other combinations are possible. For example:
'TH", "HE", "EΛ", "CA", "AT", TΛ", "ON", "NΛ", and "MA".
This can be followed by a further range of possible combinations in level 2. By adopting rules pertinent to a desired objective for using the neural network, to reduce or eliminate combinations, efficiency may be enhanced.
If a level 10 neuron is considered, it is capable of representing a sequence of up to 1 ,024 elementary events. The first element can be expressed by following the pointers up to the elemental or root level. This allows a relatively speedy expression.
Elemental neurons may be frequently activated both for learning and during expression. In a pure binary implementation two elemental neurons or root level neurons can be expressed or associated by a single level 1 neuron. Two level 1 neurons may be expressed or associated by a level 2 neuron and so forth. If a sequence of 1 ,024 elemental events is activated and learnt/expressed by the network then the following number of neurons at each level may be processed:
1 ,024 level 0
512 level 1
256 level 2
128 level 3
64 level 4
32 level 5
16 level 6
8 level 7
4 level 8
2 level 9
1 level 10 representing the entire sequence of elementary events. If the basic time between neurons firing was 1 millisecond, at the root level, a level 10 neuron would only activated or fired once every 1024 milliseconds or once a second. Thus if the array representing the neural structure is represented as a combination of distinct memory blocks/areas, deeper level neurons could be stored in slower storage/memory area without impacting the performance of learning and expression.
In the preferred neural network structure, elemental neurons have as their initiating neuron the root neuron for the neural network structure. This allows an unlimited number of elemental neurons to be created on the fly, rather than having to predefine elemental neurons. Alternatively, elemental neurons can be allocated a predetermined neural storage/memory area in the structure, and each elemental neuron can then be directly addressed (e.g. for ASCII text characters 8 bits), 256 elemental neuron addresses can be pre-allocated (0 to 255) and the address of the first structural neuron will be at address 256.
In the preferred mode, new elemental neurons can be added at anytime, anywhere in the neural structure, providing for complete flexibility. When using a predefined area for the elemental neurons, processing may be faster as there is no need to search a list of successors attached to the root neuron.
Elemental neurons may be represented with their initiating neuron pointer set to zero - pointing to the root neuron (whether it exists or not), and their associated neuron pointer set to the value of the elemental event to be represented by that elemental neuron. A elemental neuron can always be determined or identified easily as its initiating neuron value is always zero. Therefore, when expressing neurons it is easy to determine when we have reached an elemental neuron because the initiating neuron value is zero, pointing to the root neuron. Alternative methods may be used to define elemental neurons, without impacting the essence of the neural network presented.
In the preferred mode, new successor neurons to an initiating neuron are simply added to the front of the list. Therefore, they are attached directly to the initiating neuron. In this way recent memory traces are readily expressed. However, various options are available to maintain lists of successor neurons. The neural structure allows this feature to be used in any manner the user chooses in order to provide added functionality to the neural network structure. For example, new associating neurons could be added to the end of the list, or the list could be maintained in numerical order, alphabetical order, and so forth. Likewise, neurons which are frequently accessed could be moved towards the front of the list, or at the front of the list, such that more recently activated memories are always more accessible. This also means that older memories are at the end of the list and less likely to experience expression.
In this manner the order of the list can be used to represent the relative synaptic strengths or activation levels of the successor neurons to an initiating neuron without having to use weights to represent the strength of synaptic connections, if so desired.
The memory represented by any neuron can be expressed by simply expressing the neurons represented by the initiating neuron pointer and then the expressing the neuron represented by the associated neuron pointer. If the initiating pointer is zero, it is possible to express the elemental value of the elemental neuron. Otherwise, the process can be repeated for the initiating pointer - express its initiating neuron pointer and its associated neuron pointer, and so forth. Thus, any neuron can be fully expressed by expressing its parts in order.
It is possible to create neural network structures representing knowledge learnt. For example, if the following sentences of text are inputs:-
LUCYΛISΛCRYINGΛUNDERΛTHEΛTABLEΛ.
JOHNΛISΛPLAYINGΛINΛTHEΛPARKΛ.
PETERΛISΛREADINGΛINΛTHEΛCHAIRΛ.
MARYΛISΛSLEEPINGΛUNDERΛTHEΛTREEΛ. JOHNΛISΛRUNNINGΛINΛTHEΛRACEΛ.
PETERΛISΛPLAYINGΛONΛTHEΛSWINGΛ.
MARYΛISΛTALKINGΛONΛTHEΛPHONEΛ,
it is possible to create neurons that represent the following phrases or memories: IS CRYING IS RUNNING IS READING IS SLEEPING IS PLAYING
IS TALKING
In this case "ISΛ" has six successor neurons.
Similarly it is possible to create the following phrases or memories:
UNDERTHETABLE
UNDERTHETREE
INTHE PARK
IN THE CHAIR INTHE RACE
ONTHE SWING
ONTHE PHONE
Thus LUCY is associated with IS CRYING, but IS is associated with six different actions. By changing the expression of alternative successor neurons for IS, it is possible to express up to six different phrases/clauses: LUCY IS CRYING LUCY IS RUNNING LUCY IS READING LUCY IS SLEEPING
LUCY IS PLAYING LUCY IS TALKING
Although only the first phrase was ever learnt, or input to the neural network, it is possible to do the same for JOHN, PETER and MARY.
Effectively it is possible to generate new expressions based on the structure ** IS and IS **.That is: LUCY IS IS CRYING
JOHN IS IS RUNNING
MARY IS IS READING
LUCY IS IS SLEEPING PETER IS IS PLAYING
IS TALKING
Therefore, it is possible to create or express 30 (5x6) phrases/clauses that are all syntactically correct, and are also all semantically correct. Similarly: ON THE THE TABLE
IN THE THE PARK
UNDER THE THE CHAIR
THETREE THE RACE THE SWING
THE PHONE
which provides for the possibility of generating 21 phrases/clauses of this nature ( 3x7) which are all syntactically correct, but not all semantically correct.
Combining the two sets together gives the structure: {*} IS {*} (*) THE {*}.
This provides for the expression of {5} IS {6} * {3} THE {7}, or 5x6x3x7 = 630 possible expressions, having learnt only seven input sentences. Thus the neural model allows the learning and building a neural structure of memories, and also allows the combining of those neurons or memories into new expressions or behaviour, according to user defined processes. The brain can explore new concepts or suggestions that are syntactically possible with what has previously been learnt. With millions of neurons, it is possible to express billions of syntactically correct sentences. That is, the neural network structure provides an ideal method for creative expression.
By use of a neural network described above, it is possible to have a system that: ■ is able to learn; ■ has expression capabilities;
■ stores associations rather than data;
■ has an efficient usage of computer memory and storage space; and
■ is computationally efficient.
Thus the network is able to recognise patterns within patterns of associations. As such it may be of use in varying industries such as, for example, monitoring and predicting stock price movements, internet surveillance, security, computer virus detection, phrases in speech and text, clauses in speech and text, plagiarism detection, data compression, and so forth.
The neural network structure and processes described above may be implemented in software or hardware. If in hardware, they may be part of a chip, all of a dedicated chip, or an array of chips, all being elemental and or structural neurons. Elemental and structural neurons may be in part of the chip, or may be in a memory array of dedicated neurons. As all neurons exist, upon the first pass of data the first elemental neuron will learn the first element of the data. For example, the upper case letter T in the example used in Figure 7. The next elemental neuron would learn the next element of the data. Again using the example of Figure 7,the lower case letter "h". And so forth. As the elemental neurons and those in the lower levels of the neural network will be activated more frequently to create the associations in the deeper levels, they may require faster processor speeds, for best performance. Neurons at deeper levels will be activated less frequently and therefore could be stored in storage with slower processor speeds.
Therefore, there is provided a neural network based on the concepts of neurons including sensor and motor neurons, and synaptic connections. Each neuron in the brain can be represented by a single node in an array or memory in a simple manner. Neurons are fixed-length nodes in an array or memory. Each synaptic connection can be represented by pointers to other neurons within each node. Neural nodes in the array may consist solely and exclusively of pointers to other neurons in the data array. However, motor or sensor neurons contain a sensor value or motor value for interacting with the external environment. Each neuron contains connections to other neurons. If desired, neurons may also maintain other information such as, for example, the frequency of activation during learning, the number successor neurons, the number of precessor neurons, and so forth, to assist processing and to be used in the rules for creating associations, and for expression.
Elemental neurons, corresponding to sensory or motor neurons can be defined for interfacing to and interacting with external input devices or external output devices
The neural network can be represented and built/constructed based on the neurons and synaptic associations, with appropriate rules for creating the neural structure and traversing the neural connections. The network learns by creating associations between neurons. For any neuron, its representation can be recalled and expressed, and exploration of multiple associations and permutations of its associations, with other neurons can be recalled or expressed. Neurons can represent memories, where a memory is defined as the expression of a neuron.
Interfacing with or learning or processing an experience of external sensory neuron events and creating memories of input experiences is represented by neurons and by new connections between neurons.
Interfacing with or learning or representing an activity of external motor neuron events and creating memories of output actions is represented by new neurons and by new connections between neurons.
The neural network can learn, it can express or recall or recollect memories, it can interact or express itself with the external environment, and has the ability to think (a process defined as exploring alternative neuron associations as described above) and to express itself creatively.
The present invention also extends to a computer usable medium comprising a computer program code or specially built digital processor chips customised to cause one or more processors to execute one or more functions to perform the methods described above. Whilst there has been described in the foregoing description preferred embodiments of the present invention, it will be understood by those skilled in the technology that many variations or modifications is details of design, construction or operation may be made without departing from the present invention.

Claims

The Claims:
1. A neural network comprising a plurality of neurons in which any one of the plurality of neurons is able to associate or link with itself or another neuron in the plurality of neurons via active connections to a further neuron in the plurality of neurons.
2. A neural network as claimed in claim 1 , where the further neuron is in a deeper level than both the neuron and the another neuron.
3. A neural network as claimed in claim 1 or claim 2, wherein the neuron and the another neuron are in a level selected from the group consisting of: the same, and different.
4. A neural network as claimed in claim 1, wherein the plurality of neurons includes a plurality of elemental neurons and a plurality of structural neurons; all elemental and structural neurons being able to be associated; all elemental neurons being able to express their elemental values, and all structural neurons being able to express a pair of neurons with which they associate.
5. A neural network as claimed in claim 4, wherein each structural neuron represents the combined information or memory represented by a pair of neurons, the structural neuron receiving input from the pair of neurons; and each elemental neuron represents at least one selected from the group consisting of: an elemental stimulus, a defined elemental pattern, a defined elemental data element, a basic input stimulus, and an output stimuli of information being processed.
6. A neural network as claimed in claim 4 or claim 5, wherein associations are at least one selected from the group consisting of: an elemental neuron with an elemental neuron, an elemental neuron with a structural neuron, a structural neuron with an elemental neuron, a structural neuron with a structural neuron.
7. A neural network as claimed in any one of claims 1 to 6, wherein each of the plurality of neurons is one or more selected from the group consisting of: initiating neuron, associating neuron, and associating neuron.
8. A neural network as claimed in claim 7, wherein an initiating neuron is associated with an associated neuron via active connections to the associating neuron.
9. A neural network as claimed in claim 8, wherein the initiating neuron, the associated neuron and the associating neuron are connected based on proximal characteristics, the proximal characteristics being at least one of: temporal, spatial, intensity, magnitude and relative position.
10. A neural network as claimed in any one of claims 1 to 9, wherein information represented by a neuron is memory, and processing is at least one of: learning and expression.
11. A neural network as claimed in any one of claims 4 to 10, wherein a level of the neural network is a deeper level within the neural network structure if, during expression, more steps are required to express the elemental neurons that it represents.
12. A neural network as claimed in any one of claims 1 to 6, wherein the one of the plurality of neurons is an initiating neuron, the another of the plurality of neurons is an associated neuron, and the further neuron is a associating neuron; the structure being such that when the initiating neuron is activated or fires, the associating neuron is potentiated; and when the associated neuron is activated or fires, the associating neuron is further potentiated and thus activated and is able to fire.
13. A neural network as claimed in claim 12, wherein the associated neuron is activated or fires at the same time as the initiating neuron.
14. A neural network as claimed in claim 12, wherein the associated neuron is activated or fires after the initiating neuron, with respect to the associating neuron
15. A neural network as claimed in any one of claims 12 to 14, wherein the activation or firing of the initiating neuron and the associated neuron is based on proximal characteristics.
16. A neural network as claimed in claim 15, wherein the proximal activation or firing of the initiating neuron and the associated neuron causes the creation of new synaptic connections, or the strengthening of existing synaptic connections, between the initiating neuron and the associating neuron and between the associated neuron and the associating neuron.
17. A neural network as claimed in any one of claims 12 to 16, wherein the associating neuron represents the sum of what is learnt from the initiating neuron and the associated neuron; the sum including one or more selected from the group consisting of: a memory trace, a combination of the experience of the initiating neuron and the associated neuron, a memory, and a sequence of events.
18. A neural network as claimed in any one of claims 4 to 17, wherein all elemental neurons are represented in a root level of the neural network.
19. A neural network as claimed in any one of claims 12 to 18, wherein once the associating neuron is activated to represent a desired result, the desired result need not be recreated in another neuron.
20. A neural network comprising a plurality of elemental neurons, and a plurality of structural neurons for representing associations between any pair of neurons, the pair of neurons being selected from the group consisting of: both elemental neurons, both structural neurons, one structural and one elemental neuron, and one elemental neuron and one structural neuron.
21. A neural network as claimed in claim 20, wherein the plurality of elemental neurons are represented in a root level of the neural network, and each elemental neuron represents at least one of: an elemental stimulus, a defined pattern and a defined data element; each elemental stimulus being for representing at least one of: a basic input stimuli, and an output stimuli of information being processed.
22. A neural network as claimed in claim 20 or claim 21 , wherein each elemental neuron is selected from the group consisting of: a sensor neuron and a motor neuron.
23. A neural network as claimed in claim 21 , wherein the information is memory.
24. A neural network as claimed in any one of claims 20 to 23, wherein the processing is at least one of: learning and expression.
25. A neural network as claimed in any one of claims 20 to 24, wherein the plurality of neuron associations are represented in a plurality of deeper neural levels.
26. A neural network as claimed in claim 25, wherein the number of levels in the plurality of deeper levels is determined by the extent of the memory or pattern to be processed or expressed, where a memory represents a plurality of elemental neurons.
27. A neural network as claimed in claim 26, wherein the number of elemental neurons and structural neurons required to represent the memory is determined by a nature of the memory to be processed.
28. A neural network as claimed in any one of claims 20 to 27, wherein any one of the plurality of structural neurons is able to associate with another structural neuron in the plurality of neurons via active connections to a further structural neuron in the plurality of structural neurons.
29. A neural network as claimed in claim 28, where the further structural neuron is in a deeper level than both the structural neuron and the another structural neuron.
30. A neural network comprising a plurality of neurons linked by associations, all neurons being able to be expressed.
31. A neural network as claimed in claim 30, wherein the plurality of neurons includes a plurality of elemental neurons and a plurality of structural neurons; all elemental neurons being able to express their elemental values, and all structural neurons being able to express a pair of neurons with which they associate.
32. A neural network comprising plurality of neurons, each neuron being represented by a unique addressable node in an array.
33. A neural network as claimed in claim 32, wherein each of the plurality of neurons are linked by associations, all neurons being able to be expressed.
34. A neural network as claimed in claim 33, wherein the plurality of neurons includes a plurality of elemental neurons and a plurality of structural neurons; all elemental neurons being able to express their elemental values, and all structural neurons being able to express a pair of neurons with which they associate.
35. A neural network as claimed in any one of claims 32 to 34, where each neuron is represented in its entirety by the single node in the array.
36. A neural network comprising a plurality of nodes in an array, each node comprising at least one pointer, each pointer being a data element of the node; each data element representing a unique address of a specific node in the array, each address representing a neuron of a plurality of neurons.
37. A neural network as claimed in claim 36, wherein each of the plurality of neurons is linked by associations, all neurons being able to be expressed.
38. A neural network as claimed in claim 36 or claim 37, wherein the plurality of neurons includes a plurality of elemental neurons and a plurality of structural neurons; all elemental neurons being able to express their elemental values, and all structural neurons being able to express a pair of neurons with which they associate.
39. A neural network as claimed in any one of claims 36 to 38, wherein each of the plurality of neurons is represented by an addressable node in an array.
40. A neural network comprising a plurality of neurons in an array, the array having pointers for providing expression.
41. A neural network as claimed in claim 40, wherein each neuron is represented by a node in an array, each node having a plurality of pointers.
42. A neural network as claimed in claim 41 , wherein each pointer in each node contains at least one of: an exclusive address of another neuron, and an elemental value for an elemental neuron.
43. A neural network as claimed in claim 41 or claim 42, wherein each pointer has a specific and unique function and represents a synaptic connection.
44. A neural network as claimed in claim 42 or claim 43 when appended to claim 42, wherein the plurality of neurons includes a plurality of elemental neurons and a plurality of structural neurons; all elemental neurons being able to express their elemental values, and all structural neurons being able to express a pair of neurons with which they associate.
45. A neural network as claimed in claim 44, wherein except where the pointer represents the value of an elemental stimulus in the elemental neurons, and each pointer contains an address of another neuron.
46. A neural network as claimed in any one of claims 41 to 45, wherein the number of pointers depends on a function being performed by the neural network.
47. A neural network as claimed in any one of claims 41 to 46, wherein the number of pointers for each neuron is at least two.
48. A neural network as claimed in any one of claims 41 to 47, wherein a function of each pointer to a neuron is selected from the group consisting of: initiating, associating, successor, next successor of the initiating neuron, precessor, and next precessor of the associating neuron
49. A neural network as claimed in any one of claims 1 to 48, wherein all neurons are of a fixed length.
50. A neuronal assembly for use in a neural network, the neuronal assembly comprising an initiating neuron, an associated neuron, and a associating neuron operatively connected to the initiating neuron and the associated neuron.
51. A neural assembly as claimed in claim 50, wherein when the initiating neuron is activated or fires, the associating neuron is potentiated; and when the associated neuron is activated or fires, the associating neuron is potentiated and activated and able to fire.
52. A neural assembly as claimed in claim 51 , wherein the associated neuron fires at the same time as the initiating neuron.
53. A neural assembly as claimed in claim 51 , wherein the associated neuron fires after the initiating neuron.
54. A neural assembly as claimed in any one of claims 50 to 53, wherein the activation or firing of the initiating neuron and the associated neuron is based on proximal characteristics.
55. A neural assembly as claimed in claim 54, wherein the proximal activation or firing of the initiating neuron and the associated neuron causes the creation of new synaptic connections, or the strengthening of existing synaptic connections, between the initiating neuron and the associating neuron and between the associated neuron and the associating neuron.
56. A neural assembly as claimed in any one of claims 50 to 55, wherein the associating neuron represents the sum of what is learnt from the initiating neuron and the associated neuron.
57. A neural assembly as claimed in claim 56, wherein the sum includes one or more selected from the group consisting of: a memory trace, a combination of the experience of the initiating neuron and the associated neuron, a memory, and a sequence of events.
58. A neural assembly as claimed in any one of claims 50 to 57, wherein once the associating neuron is activated to represent a desired result, the desired result need not be recreated in another neuron.
59. A method for creating an association of neurons in a neural network, the neural network having a plurality of neurons, one of the plurality of neurons being an initiating neuron, another of the plurality of neurons being an associated neuron, and a further neuron of the plurality of neurons being a associating neuron; the method comprising:
(a) activating or firing the initiating neuron to potentiate the associating neuron; and
(b) activating or firing the associated neuron to potentiate and activate the associating neuron, the associating neuron is activated and able to fire.
60. A method as claimed in claim 59, wherein the associated neuron is activated or fires at the same time as the initiating neuron.
61. A method as claimed in claim 59, wherein the associated neuron is activated or fires after the initiating neuron.
62. A method as claimed in any one of claims 59 to 61 , wherein the activation or firing of the initiating neuron and the activation or firing of the associated neuron is based on proximal characteristics.
63. A method as claimed in claim 62, wherein the proximal activation or firing of the initiating neuron and the associated neuron causes the creation of new synaptic connections, or the strengthening of existing synaptic connections, between the initiating neuron and the associating neuron and between the associated neuron and the associating neuron.
64. A method as claimed in any one of claims 59 to 63, wherein the associating neuron represents the sum of what is learnt from the initiating neuron and the associated neuron.
65. A method as claimed in claim 64, wherein the sum includes one or more selected from the group consisting of: a memory trace, a combination of the experience of the initiating neuron and the associated neuron, a memory, and a sequence of events.
66. A method as claimed in any one of claims 59 to 65, wherein once the associating neuron is activated to represent a desired result, the desired result need not be recreated in another neuron.
67. A method of operating a neural network having a plurality of neurons including a plurality of elemental neurons and a plurality of structural neurons, the method comprising:
(a) defining events the elemental neurons and structural neurons will represent; (b) creating a required number of elemental neurons for the total number of unique values to be represented for all defined events; and
(c) creating a set of rules for association of the plurality of neurons.
68. A method as claimed in claim 67, wherein any one of the plurality of neurons is able to associate with another neuron in the plurality of neurons via active connections to a further neuron in the plurality of neurons.
69. A method as claimed in claim 68, where the further neuron is in a deeper level than both the neuron and the another neuron.
70. A method as claimed in claim 68 or claim 69, wherein the neuron and the another neuron are in the same level.
71. A method as claimed in claim 68 or claim 69, wherein the neuron and the another neuron are on different levels.
72. A method as claimed in any one of claims 67 to 71, wherein all elemental neurons are able to express their elemental values, and all structural neurons are able to express a pair of neurons with which they associate.
73. A method as claimed in claim 72, wherein associations are one or more selected from the group consisting of: an elemental neuron with an elemental neuron, an elemental neuron with a structural neuron, a structural neuron with an elemental neuron, a structural neuron with a structural neuron.
74. A method as claimed in any one of claims 67 to 73, wherein each of the plurality of neurons is one or more selected from the group consisting of: initiating neuron, associating neuron, and associating neuron.
75. A method as claimed in claim 74, wherein an initiating neuron is associated with an associated neuron via active connections to the associating neuron.
76. A method as claimed in claim 75, wherein the initiating neuron, the associated neuron and the associating neuron are connected based on proximal characteristics.
77. A method as claimed in claim 76, wherein the proximal characteristics are at least one of: temporal, spatial, intensity, magnitude and relative position.
78. A method as claimed in any one of claims 69 to 77, wherein a level of the neural network is a deeper level within the neural network structure if, during recollection, more steps are required to express the elemental neurons.
79. A method as claimed in any one of claims 74 to 77, further comprising:
(a) activating or firing the initiating neuron potentiates the associating neuron; and (b) activating or firing the associated neuron potentiates and activates the associating neuron, the associating neuron then activated and able to fire.
80. A method as claimed in claim 79, wherein the associated neuron is activated or fires at the same time as the initiating neuron.
81. A method as claimed in claim 79, wherein the associated neuron is activated or fires after the initiating neuron.
82. A method as claimed in any one of claims 79 to 81 , wherein the activation or firing of the initiating neuron and the activation or firing of the associated neuron is based on proximal characteristics.
83. A method as claimed in claim 82, wherein the proximal activation or firing of the initiating neuron and the associated neuron causes the creation of new synaptic connections, or the strengthening of existing synaptic connections, between the initiating neuron and the associating neuron and between the associated neuron and the associating neuron.
84. A method as claimed in any one of claims 79 to 83, wherein the associating neuron represents the sum of what is learnt from the initiating neuron and the associated neuron.
85. A method as claimed in claim 84, wherein the sum includes one or more selected from the group consisting of: a memory trace, a combination of the experience of the initiating neuron and the associated neuron, a memory, and a sequence of events.
86. A method as claimed in any one of claims 69 to 85, wherein the plurality of elemental neurons are represented in a root level of the neural network, and each elemental neuron responds to an elemental stimulus or pattern, each elemental stimulus being for representing one of: a basic input stimuli and an output stimuli of information being processed.
87. A method as claimed in claim 86, wherein the information is memory.
88. A method as claimed in claim 86 or claim 87, wherein the processing is expression.
89. A method as claimed in any one of claims 86 to 88, wherein the plurality of structural neurons are represented in a plurality of deeper neural levels.
90. A method as claimed in claim 89, wherein the number of levels in the plurality of deeper levels is determined by the extent of the memory or pattern to be processed or expressed, where a memory represents a plurality of elemental stimuli, and each elemental stimulus is represented directly by an elemental neuron.
91. A method as claimed in claim 90, wherein the number of elemental neurons required to represent the memory is determined by a nature of the memory to be processed.
92. A method as claimed in any one of claims 67 to 91 , wherein each neuron is represented in its entirety by a single, fixed-length node in an array.
93. A method as claimed in any one of claims 67 to 91 , wherein each of the plurality of neurons is in an array, the array having pointers for providing expression
94. A method as claimed in claim 93, wherein each neuron is represented by a node in the array, each node having a plurality of pointers, each pointer in each node containing an exclusive address of another neuron.
95. A method as claimed in any one of claims 67 to 94, wherein all neurons are of a fixed length.
96. A computer usable medium comprising a computer program code configured to cause one or more processors to execute one or more functions to perform the method claimed in claims 67 to 95.
97. A neural network as claimed in any one of claims 1 to 49, wherein the neural network is bi-directional.
98. A neural network wherein the neural network is bi-directional and is enabled to operate in a forward direction where output is derived from events, and in a reverse direction where events are derived from output.
99. A neural network as claimed in claim 98, wherein the forward direction is learning, and the reverse direction is expression.
100. A neural network as claimed in any one of claims 1 to 49, 97 to 99, wherein the neural network stores associations and not data.
101. A neural network as claimed in claim 100, wherein the neural network recognises patterns within patterns of associations. A neural network as claimed in claim 100 or claim 101, wherein the neural network is used for one or more of: monitoring and predicting stock price movements, Internet surveillance, Internet security, computer virus detection, computer spam detection, phrases in speech and text, clauses in speech and text, plagiarism detection, bioinformatics, vision recognition, semantic analysis, representation of data ontologies, robotics, and data compression.
PCT/IB2004/002119 2003-06-26 2004-06-21 Neural networks with learning and expression capability WO2004114145A1 (en)

Priority Applications (7)

Application Number Priority Date Filing Date Title
EP04737088.7A EP1639494B1 (en) 2003-06-26 2004-06-21 Neural networks with learning and expression capability
JP2006516581A JP4943146B2 (en) 2003-06-26 2004-06-21 Neural network with learning and expression functions
US10/560,666 US7412426B2 (en) 2003-06-26 2004-06-21 Neural networks with learning and expression capability
AU2004250403A AU2004250403C1 (en) 2003-06-26 2004-06-21 Neural networks with learning and expression capability
IL172201A IL172201A (en) 2003-06-26 2005-11-27 Neural networks with learning and expression capability
US12/170,335 US7778946B2 (en) 2003-06-26 2008-07-09 Neural networks with learning and expression capability
IL195610A IL195610A (en) 2003-06-26 2008-11-30 Neural networks with learning and expression capability

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
MYPI20032400A MY138544A (en) 2003-06-26 2003-06-26 Neural networks with learning and expression capability
MYPI20032400 2003-06-26

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US12/170,335 Continuation US7778946B2 (en) 2003-06-26 2008-07-09 Neural networks with learning and expression capability

Publications (1)

Publication Number Publication Date
WO2004114145A1 true WO2004114145A1 (en) 2004-12-29

Family

ID=33536493

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2004/002119 WO2004114145A1 (en) 2003-06-26 2004-06-21 Neural networks with learning and expression capability

Country Status (9)

Country Link
US (2) US7412426B2 (en)
EP (6) EP2472444B1 (en)
JP (3) JP4943146B2 (en)
CN (2) CN101470813B (en)
AU (2) AU2004250403C1 (en)
IL (2) IL172201A (en)
MY (1) MY138544A (en)
SG (1) SG153700A1 (en)
WO (1) WO2004114145A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2011095342A1 (en) * 2010-02-05 2011-08-11 Ecole Polytechnique Federale De Lausanne Epfl-Sri Organizing neural networks

Families Citing this family (40)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7089218B1 (en) * 2004-01-06 2006-08-08 Neuric Technologies, Llc Method for inclusion of psychological temperament in an electronic emulation of the human brain
US7925492B2 (en) 2004-01-06 2011-04-12 Neuric Technologies, L.L.C. Method for determining relationships through use of an ordered list between processing nodes in an emulated human brain
MY138544A (en) * 2003-06-26 2009-06-30 Neuramatix Sdn Bhd Neural networks with learning and expression capability
US8473449B2 (en) * 2005-01-06 2013-06-25 Neuric Technologies, Llc Process of dialogue and discussion
US7475072B1 (en) 2005-09-26 2009-01-06 Quintura, Inc. Context-based search visualization and context management using neural networks
US7620607B1 (en) 2005-09-26 2009-11-17 Quintura Inc. System and method for using a bidirectional neural network to identify sentences for use as document annotations
US7437370B1 (en) * 2007-02-19 2008-10-14 Quintura, Inc. Search engine graphical interface using maps and images
US8112372B2 (en) * 2007-11-20 2012-02-07 Christopher D. Fiorello Prediction by single neurons and networks
US8396582B2 (en) 2008-03-08 2013-03-12 Tokyo Electron Limited Method and apparatus for self-learning and self-improving a semiconductor manufacturing tool
US8190543B2 (en) 2008-03-08 2012-05-29 Tokyo Electron Limited Autonomous biologically based learning tool
US8725667B2 (en) * 2008-03-08 2014-05-13 Tokyo Electron Limited Method and system for detection of tool performance degradation and mismatch
US8180754B1 (en) * 2008-04-01 2012-05-15 Dranias Development Llc Semantic neural network for aggregating query searches
US8219539B2 (en) * 2009-04-07 2012-07-10 Microsoft Corporation Search queries with shifting intent
WO2011115854A1 (en) * 2010-03-15 2011-09-22 Numenta, Inc. Temporal memory using sparse distributed representation
US11651277B2 (en) 2010-03-15 2023-05-16 Numenta, Inc. Sparse distributed representation for networked processing in predictive system
US8676734B2 (en) * 2010-07-07 2014-03-18 Qualcomm, Incorporated Methods and systems for replaceable synaptic weight storage in neuro-processors
US20130346150A1 (en) * 2012-06-21 2013-12-26 Data Ventures, Inc. System, method, and computer program product for forecasting sales
WO2015016723A1 (en) * 2013-08-02 2015-02-05 Auckland Uniservices Limited System for neurobehavioural animation
US10339447B2 (en) * 2014-01-23 2019-07-02 Qualcomm Incorporated Configuring sparse neuronal networks
US9484022B2 (en) * 2014-05-23 2016-11-01 Google Inc. Training multiple neural networks with different accuracy
KR102445468B1 (en) 2014-09-26 2022-09-19 삼성전자주식회사 Apparatus for data classification based on boost pooling neural network, and method for training the appatratus
CN105894086A (en) * 2014-12-23 2016-08-24 中国传媒大学 Representation method of neuron links in large-scale brain simulation
CN106447036B (en) * 2015-10-08 2019-03-15 上海兆芯集成电路有限公司 Execute the neural network unit being rounded at random
CN106372721B (en) * 2016-08-29 2018-08-21 中国传媒大学 The 3D method for visualizing of Large Scale Neural Networks
US11615285B2 (en) * 2017-01-06 2023-03-28 Ecole Polytechnique Federale De Lausanne (Epfl) Generating and identifying functional subnetworks within structural networks
CN108009636B (en) * 2017-11-16 2021-12-07 华南师范大学 Deep learning neural network evolution method, device, medium and computer equipment
US11468024B2 (en) * 2018-03-27 2022-10-11 Sap Se Structural data matching using neural network encoders
US11893471B2 (en) 2018-06-11 2024-02-06 Inait Sa Encoding and decoding information and artificial neural networks
US11663478B2 (en) 2018-06-11 2023-05-30 Inait Sa Characterizing activity in a recurrent artificial neural network
RU2699396C1 (en) * 2018-11-19 2019-09-05 Общество С Ограниченной Ответственностью "Инвек" Neural network for interpreting natural language sentences
US11551093B2 (en) * 2019-01-22 2023-01-10 Adobe Inc. Resource-aware training for neural networks
US11652603B2 (en) 2019-03-18 2023-05-16 Inait Sa Homomorphic encryption
US11569978B2 (en) 2019-03-18 2023-01-31 Inait Sa Encrypting and decrypting information
US11681922B2 (en) 2019-11-26 2023-06-20 Numenta, Inc. Performing inference and training using sparse neural network
US11816553B2 (en) 2019-12-11 2023-11-14 Inait Sa Output from a recurrent neural network
US11580401B2 (en) 2019-12-11 2023-02-14 Inait Sa Distance metrics and clustering in recurrent neural networks
US11651210B2 (en) 2019-12-11 2023-05-16 Inait Sa Interpreting and improving the processing results of recurrent neural networks
US11797827B2 (en) 2019-12-11 2023-10-24 Inait Sa Input into a neural network
US11568267B2 (en) 2020-03-12 2023-01-31 International Business Machines Corporation Inducing creativity in an artificial neural network
CN117688969A (en) * 2022-09-02 2024-03-12 深圳忆海原识科技有限公司 Port model object organization method, system, platform, intelligent device and medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1995000920A1 (en) * 1993-06-24 1995-01-05 The United States Of America, Represented By The Secretary, Department Of Health And Human Services An artificial network for temporal processing
US5852815A (en) * 1996-01-26 1998-12-22 Thaler; Stephen L. Neural network based prototyping system and method
US5937432A (en) * 1996-02-26 1999-08-10 Fuji Xerox Co., Ltd. Associative storage and associative storing method
US6052679A (en) * 1997-09-11 2000-04-18 International Business Machines Corporation Artificial neural networks including Boolean-complete compartments

Family Cites Families (50)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0634236B2 (en) 1985-11-02 1994-05-02 日本放送協会 Hierarchical information processing method
CA1294119C (en) 1985-11-04 1992-01-14 The Procter & Gamble Company Absorbent article having an expanding overwrap
EP0276068B1 (en) 1987-01-20 1995-04-05 AT&T Corp. An associative computation network
US5093899A (en) 1988-09-17 1992-03-03 Sony Corporation Neural network with normalized learning constant for high-speed stable learning
JP2703010B2 (en) * 1988-12-23 1998-01-26 株式会社日立製作所 Neural net signal processing processor
JPH0738186B2 (en) * 1989-03-13 1995-04-26 シャープ株式会社 Self-expanding neural network
GB8929146D0 (en) 1989-12-22 1990-02-28 British Telecomm Neural networks
JPH03288285A (en) 1990-04-04 1991-12-18 Takayama:Kk Learning method for data processor
JPH03288258A (en) 1990-04-04 1991-12-18 Takayama:Kk Learning method for data processor
DE69120854T2 (en) 1990-04-24 1996-11-21 Yozan Inc Learning process for data processing system
KR950001601B1 (en) * 1990-07-09 1995-02-27 니폰 덴신 덴와 가부시끼가시야 Neural network circuit
US5182794A (en) * 1990-07-12 1993-01-26 Allen-Bradley Company, Inc. Recurrent neural networks teaching system
US5065040A (en) * 1990-08-03 1991-11-12 Motorola Inc. Reverse flow neuron
US5671335A (en) * 1991-05-23 1997-09-23 Allen-Bradley Company, Inc. Process optimization using a neural network
JPH07120348B2 (en) * 1991-12-16 1995-12-20 株式会社ジーデイーエス Spatial information relocation device
JPH05274288A (en) * 1992-03-26 1993-10-22 Sony Corp External signal kprocessor having learning function
US5438629A (en) 1992-06-19 1995-08-01 United Parcel Service Of America, Inc. Method and apparatus for input classification using non-spherical neurons
DE69328596T2 (en) 1992-08-11 2001-01-04 Hitachi Europ Ltd Optimization of a neural network with feedforward
JP2737583B2 (en) 1992-11-26 1998-04-08 松下電器産業株式会社 Neural network circuit
EP0602717B1 (en) 1992-12-16 1997-10-01 Laboratoires D'electronique Philips S.A.S. Neural device and construction method
GB9226192D0 (en) * 1992-12-16 1993-02-10 Univ London Neural network architecture
DE4307027C2 (en) * 1993-03-05 1995-07-20 Siemens Ag Memory-oriented neural network
DE4307026C2 (en) * 1993-03-05 1995-08-03 Siemens Ag Memory-oriented neural network
JPH07129535A (en) * 1993-11-08 1995-05-19 Mitsubishi Electric Corp Learning controlling method
US5712953A (en) * 1995-06-28 1998-01-27 Electronic Data Systems Corporation System and method for classification of audio or audio/video signals based on musical content
US6018728A (en) 1996-02-09 2000-01-25 Sarnoff Corporation Method and apparatus for training a neural network to learn hierarchical representations of objects and to detect and classify objects with uncertain training data
US6324532B1 (en) 1997-02-07 2001-11-27 Sarnoff Corporation Method and apparatus for training a neural network to detect objects in an image
US6195622B1 (en) * 1998-01-15 2001-02-27 Microsoft Corporation Methods and apparatus for building attribute transition probability models for use in pre-fetching resources
US6826556B1 (en) * 1998-10-02 2004-11-30 Ncr Corporation Techniques for deploying analytic models in a parallel
US6442286B1 (en) * 1998-12-22 2002-08-27 Stmicroelectronics, Inc. High security flash memory and method
US6456993B1 (en) 1999-02-09 2002-09-24 At&T Corp. Alternating tree-based classifiers and methods for learning them
EP1073012A1 (en) * 1999-07-30 2001-01-31 Eidgenössische Technische Hochschule Zürich A method and circuit for neuron-like processing of data
US6751343B1 (en) * 1999-09-20 2004-06-15 Ut-Battelle, Llc Method for indexing and retrieving manufacturing-specific digital imagery based on image content
US6468069B2 (en) * 1999-10-25 2002-10-22 Jerome H. Lemelson Automatically optimized combustion control
US6581049B1 (en) * 1999-11-08 2003-06-17 Saffron Technology, Inc. Artificial neurons including power series of weights and counts that represent prior and next association
JP2003527686A (en) * 2000-03-16 2003-09-16 チェン,ユアン,ヤン How to classify things from many classes as members of one or more classes
NZ503882A (en) * 2000-04-10 2002-11-26 Univ Otago Artificial intelligence system comprising a neural network with an adaptive component arranged to aggregate rule nodes
US7080053B2 (en) 2000-08-16 2006-07-18 Research Foundation Of State University Of New York Neural network device for evolving appropriate connections
ES2169009B1 (en) 2000-12-14 2003-11-01 Alma Bioinformatics S L SELF-ORGANIZATIONAL ALGORITHM OF GENE EXPRESSION DATA
US6801655B2 (en) * 2001-05-10 2004-10-05 The United States Of America As Represented By The Secretary Of The Navy Spatial image processor
US7095875B2 (en) * 2001-05-15 2006-08-22 Lockheed Martin Corporation Method and system for address result arbitration
US7016886B2 (en) * 2001-08-10 2006-03-21 Saffron Technology Inc. Artificial neurons including weights that define maximal projections
MXPA04004542A (en) * 2001-11-16 2005-03-07 Yuan Yan Chen Pausible neural network with supervised and unsupervised cluster analysis.
DE10201018B4 (en) * 2002-01-11 2004-08-05 Eads Deutschland Gmbh Neural network, optimization method for setting the connection weights of a neural network and analysis methods for monitoring an optimization method
US7364846B2 (en) * 2002-10-11 2008-04-29 Molecular Devices Corporation Gene expression profiling from FFPE samples
MY138544A (en) * 2003-06-26 2009-06-30 Neuramatix Sdn Bhd Neural networks with learning and expression capability
JP3987013B2 (en) * 2003-09-01 2007-10-03 本田技研工業株式会社 Vehicle periphery monitoring device
US20060184462A1 (en) * 2004-12-10 2006-08-17 Hawkins Jeffrey C Methods, architecture, and apparatus for implementing machine intelligence and hierarchical memory systems
US7454435B2 (en) * 2005-05-03 2008-11-18 Microsoft Corporation Systems and methods for granular changes within a data storage system
US7739208B2 (en) * 2005-06-06 2010-06-15 Numenta, Inc. Trainable hierarchical memory system and method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1995000920A1 (en) * 1993-06-24 1995-01-05 The United States Of America, Represented By The Secretary, Department Of Health And Human Services An artificial network for temporal processing
US5852815A (en) * 1996-01-26 1998-12-22 Thaler; Stephen L. Neural network based prototyping system and method
US5937432A (en) * 1996-02-26 1999-08-10 Fuji Xerox Co., Ltd. Associative storage and associative storing method
US6052679A (en) * 1997-09-11 2000-04-18 International Business Machines Corporation Artificial neural networks including Boolean-complete compartments

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
B. FRITZKE: "Using a library of efficient algorithms as a neural networks research tool", PROCEEDINGS OF INTERNATIONAL CONFERENCE ON ARTIFICIAL NEURAL NETWORKS (ICANN, 1992
HUMPERT B.: "Bidirectional associative memory with several patterns", IJCNN, 17 June 1990 (1990-06-17) - 21 June 1990 (1990-06-21), pages 741 - 750, XP000144292 *
K. MEHLHORN; ST. NAHER: "The LEDA Platform of Combinatorial and Geometric Computing", 1999, CAMBRIDGE UNIVERSITY PRESS
See also references of EP1639494A4
WANG L.: "Multi-associative neural networks and their applications to learning and retrieving complex spatio-temporal sequences", IEEE TRANSACTIONS ON SYSTEMS, MAN AND CYBERNETICS, vol. 29, no. 1, February 1999 (1999-02-01), pages 73 - 82, XP003031719 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2011095342A1 (en) * 2010-02-05 2011-08-11 Ecole Polytechnique Federale De Lausanne Epfl-Sri Organizing neural networks
CN102859538A (en) * 2010-02-05 2013-01-02 洛桑联邦理工学院(Epfl) Organizing Neural Networks
KR101816329B1 (en) 2010-02-05 2018-01-08 에꼴 뽈리떼끄닉 뻬데랄 드 로잔느 (으뻬에프엘) Organizing neural networks
US10373048B2 (en) 2010-02-05 2019-08-06 Ecole Polytechnique Federale De Lausanne (Epfl) Organizing neural networks
US10387767B2 (en) 2010-02-05 2019-08-20 Ecole Polytechnique Federale De Lausanne (Epfl) Organizing neural networks
US11126911B2 (en) 2010-02-05 2021-09-21 Ecole Polytechnique Federale De Lausanne (Epfl) Organizing neural networks
US11900237B2 (en) 2010-02-05 2024-02-13 Ecole Polytechnique Federale De Lausanne (Epfl) Organizing neural networks

Also Published As

Publication number Publication date
SG153700A1 (en) 2009-07-29
EP2472443A2 (en) 2012-07-04
EP1639494A4 (en) 2009-05-06
JP5165664B2 (en) 2013-03-21
EP2472441A3 (en) 2013-02-27
EP2472445A2 (en) 2012-07-04
EP2472444A3 (en) 2013-02-27
JP5430597B2 (en) 2014-03-05
JP2010092491A (en) 2010-04-22
JP2007520780A (en) 2007-07-26
CN1826594A (en) 2006-08-30
MY138544A (en) 2009-06-30
EP2472445B1 (en) 2017-08-16
AU2009202547B2 (en) 2010-11-25
AU2009202547A1 (en) 2009-07-16
IL195610A0 (en) 2009-09-01
IL172201A (en) 2011-02-28
EP2472441B1 (en) 2017-08-16
EP1639494B1 (en) 2017-09-27
CN101470813B (en) 2011-11-16
US20060149692A1 (en) 2006-07-06
JP4943146B2 (en) 2012-05-30
EP2472444B1 (en) 2017-11-22
EP2472442A3 (en) 2013-02-27
AU2004250403B2 (en) 2009-08-13
IL195610A (en) 2011-11-30
US7412426B2 (en) 2008-08-12
EP1639494A1 (en) 2006-03-29
EP2472445A3 (en) 2013-03-06
CN101470813A (en) 2009-07-01
EP2472442B1 (en) 2017-11-29
EP2472444A2 (en) 2012-07-04
US20090119236A1 (en) 2009-05-07
EP2472443A3 (en) 2013-03-06
JP2011150721A (en) 2011-08-04
EP2472442A2 (en) 2012-07-04
AU2004250403C1 (en) 2010-01-14
CN100576197C (en) 2009-12-30
US7778946B2 (en) 2010-08-17
EP2472441A2 (en) 2012-07-04
IL172201A0 (en) 2006-04-10
AU2004250403A1 (en) 2004-12-29

Similar Documents

Publication Publication Date Title
US7412426B2 (en) Neural networks with learning and expression capability
Mind Design Philosophy, Psychology, and Artificial Intelligence Edited by: DOI: ISBN (electronic): Publisher: Published: John Haugeland The MIT Press 1997 10.7551/mitpress/4626.001. 0001 9780262275071 Page 12 1997 Massachusetts Institute of Technology All rights reserved
Churchland On the nature of theories: A neurocomputational perspective
Tienson Introduction to connectionism
Goldblum The brain-shaped mind: what the brain can tell us about the mind
Flusberg et al. Connectionism and the emergence of mind
Ahmad et al. Connectionist simulation of quantification skills
Barrow Connectionism and neural networks
Bouissac Syntactic iconicity and connectionist models of language and cognition
Yanagawa From Bacteria, a Consideration of the Evolution of Neural Network
Sparkes Pattern recognition and a model of the brain
Janßen Sequence processing and learning with a reservoir computing approach
Raghavan Engineering artificial systems with natural intelligence
Nyamapfene Unsupervised multimodal neural networks
Donaldson Predictive learning and cognitive momentum: a foundation for intelligent, autonomous systems
Veale et al. Semantic memory in a computer: A synthetic model proposal
Cockayne The connectionist modelling of language acquisition
Hawkins An Investigation of Adaptive Behavior Towards a Theory of Neocortical Function

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): BW GH GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

DPEN Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed from 20040101)
121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 172201

Country of ref document: IL

ENP Entry into the national phase

Ref document number: 2006149692

Country of ref document: US

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 10560666

Country of ref document: US

REEP Request for entry into the european phase

Ref document number: 2004737088

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2004737088

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 5916/DELNP/2005

Country of ref document: IN

WWE Wipo information: entry into national phase

Ref document number: 2006516581

Country of ref document: JP

Ref document number: 20048178475

Country of ref document: CN

WWE Wipo information: entry into national phase

Ref document number: 2004250403

Country of ref document: AU

ENP Entry into the national phase

Ref document number: 2004250403

Country of ref document: AU

Date of ref document: 20040621

Kind code of ref document: A

WWP Wipo information: published in national office

Ref document number: 2004250403

Country of ref document: AU

WWP Wipo information: published in national office

Ref document number: 2004737088

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 10560666

Country of ref document: US