1 / 6

NN applications

NN applications. Mortgage risk evaluator appraises underwriting process Deliquency risk mortgage origination mortgage insurance Assessment underwriting underwiriting

boone
Télécharger la présentation

NN applications

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. NN applications • Mortgage risk evaluator appraises underwriting process Deliquency risk mortgage origination mortgage insurance Assessment underwriting underwiriting • Clean up noise on telephone lines and reduce transmission errors on modems (adaptive filters). • SNOOPE – bomb detector system at JFK. Detect explosives based on g– ray emissions. • Airline Marketing Tactician (AMT)- advices on seat yield management.

  2. Hopfield Nets(Associative Memories) Wij = Wji -1 -1 1 3 -1 1 -2 3 2 1 -1 Si = sgn(S Wij Sj ) j Where: Si =Activation of node i And sgn(X) = 1, x>=0 -1, x<0

  3. Parallel relaxation • Stable states

  4. Memorize patterns: zμ , μ= 1,2,…,p • Where zμ = (z1μ , …., z Nμ ) • Attractors (net nodes labeled 1,…,N) _______________________________________ Learning Rule is Hebb’s rule: Wij= (1/N) * Sziμ zjμ _______________________________________ p μ = 1 • Asynchronous unit updating • To recall perfectly P attractors with N units • P= N/ (4 log N)

  5. To train hopfield 1 2 To store pattern Wij = 1 if both states have same activation = -1 otherwise 4 3 5 7 6

  6. To train Hopfield (contd..) = W1 1 2 3 4 5 6 7 • 0 -1 1 -1 0 0 0 • 0 0 1 0 0 0 • 0 -1 1 1 0 • 0 0 -1 1 • 0 1 0 • 0 -1 • 0 Total net weight matrix: W = W1 +W2 +… One matrix per pattern

More Related