28.02.2013 Views

Bio-medical Ontologies Maintenance and Change Management

Bio-medical Ontologies Maintenance and Change Management

Bio-medical Ontologies Maintenance and Change Management

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Classifying Patterns in <strong>Bio</strong>informatics Databases 197<br />

3.2 Alpha-Beta Heteroassociative Multimemories<br />

Former associative memory models, particularly the alpha-beta model, used<br />

to keep a one-to-one correspondence between the fundamental set <strong>and</strong> the<br />

associative memory. That is, for each fundamental set there is one associative<br />

memory. To build many associative memories, which behave as one, from one<br />

fundamental set, could be helpful in both the treatment of mixed alterations<br />

<strong>and</strong> the development of new applications.<br />

As presented in [29], it is possible to divide xω in q equal partitions if<br />

n<br />

q ∈ Z+ .<br />

Definition 6. Let xμ ∈ An be a column vector, with μ, n ∈ Z + ,A = {0, 1},<br />

<strong>and</strong> q be the number of partitions in which xμ will be divided. The vector<br />

partition operator, denoted by ρ, defined as the set of n<br />

q −dimensional column<br />

vectors <strong>and</strong> it is denoted by:<br />

ρ(x μ ,q)= � x μ1 , x μ2 , ..., x μq�<br />

such that x μl ∈ A n<br />

q for ∀l ∈ {1, 2, ..., q} , ∀i ∈<br />

{1, 2, ..., n} is expressed as:<br />

x μ1<br />

i<br />

= xμ<br />

j<br />

such as j =<br />

�<br />

�<br />

(l − 1) ∗ n<br />

�<br />

+ i<br />

q<br />

1, 2, ..., n<br />

q<br />

�<br />

<strong>and</strong> ∀j ∈<br />

3.2.1 Alpha-Beta Heteroassociative Multimemories of Type Max<br />

LEARNING PHASE<br />

Let A = {0, 1} ,n,p ∈ Z + ,μ ∈{1, 2, ...p} ,i ∈{1, 2, ..., p}, j ∈{1, 2, ...n}<br />

<strong>and</strong> let x ∈ A n <strong>and</strong> y ∈ A p be input <strong>and</strong> output vectors, respectively. The<br />

corresponding fundamental set is denoted by {(x μ , y μ ) | μ =1, 2, ..., p}. The<br />

fundamental set must be built according to the following rules: First, the y<br />

vectors are built with the one-hot codification. Second, to each y μ vector<br />

correspond one <strong>and</strong> only one x μ vector, this is, there is only one couple<br />

(x μ , y μ ) in the fundamental set.<br />

For every μ ∈{1, 2, ...p}, from the couple (x μ , y μ ) the vector partition<br />

operator is applied to each x μ , then the new fundamental set is expressed by:<br />

� (x μ1 , y μ ), (x μ2 , y μ ), ..., (x μq , y μ ) | μ =1, 2, ..., p, l =1, 2, ...q �<br />

Now, from the couple (xμl , yμ ) the q matrices are built as follow:<br />

m×( n<br />

q ).Then apply the binary � operator to the correspond-<br />

� y μ ⊠ (x μl ) t �<br />

ing matrices obtained to get V l as follow: V l = p�<br />

ij−th component of the l matrix is given by:<br />

v l ij =<br />

p�<br />

μ=1<br />

α(y μ<br />

i ,xμl<br />

j )<br />

μ=1<br />

� y μ ⊠ (x μl ) t �<br />

m×( n<br />

q ).The

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!