Documente Academic
Documente Profesional
Documente Cultură
& Technology
Clustering Techniqiues
of Science
Jully Sabat
The Java
Roll # IT200198026
National Institute
Introduction
& Technology
elements.
The Java
J ≤ m, K ≤ N
correlation between f(x, y), w(x, y) is
c ( s, t ) = ∑ ∑ f ( x, y)w( x, y)
of Science
x y
s = 0………..M-1
t = 0, 1, ……N-1
The Java
∑ ∑[ f ( x, y ) − f ( x, y )][ w( x − s, y −t ) − w ]
γ ( s, t ) =
x y
National Institute
1
∑[ f ( x, y ) − f ( x, y )] ∑ ∑[ w( x − s, y −t ) − w ]
2
∑
2 2
x y x y
Neural Network
& Technology
2 Platform
• Background
• Training Patterns
of Science
• Neurons
The Java
• Activation Function
• Fixed increment correction Rule
• Perception Training Theorm
Jully Sabat, National Institute of Science & Technology [L1-7]
Pattern Matching and Clustering Techniques
Solution:
National Institute
PROBABILITY OF MISCALCULATION
∈= P2 + ∫ [ P1 p1 ( x) − P2 p 2 ( x ) ]dx
2 Platform
S2
Hence 2ε = ( P1 + P2 ) + ∫ ( P2 p 2 ( x) − P1 p1 ( x) ) dx + ∫ ( P1 p1 ( x) − P2 p 2 ( x) ) dx
of Science
s1 s2
=1+ ∫ ( P2 p2 ( x) − P1 p1 ( x) ) dx + ∫ ( P1 p1 ( x) − P2 p2 ( x) ) dx
s1 s2
The Java
∫( P p ( x) − P1 p1 ( x ) ) dx + ∫ ( P1 p1 ( x) − P2 p 2 ( x) ) dx
National Institute
2 2
s1 s2
CLUSTERING TECHNIQUES
2 Platform
Dissimilarity
The Java
(i) dp (x,y) = ∑ i x − y i
p
} 1/ p
; p ≥1
It can be shown that, for every P ≥ 1, dp is a metric. For p=2, we get
Euclidean, distance.
(ii) d∞ (x,y) = max
i =1...n |xi-yi|
K-Means Algorithm
& Technology
process.
The Java
Remarks
& Technology
2 Platform
Conclusion
& Technology
on preceding accomplishments.
• For the forseenable future, the design of image
The Java
THANK YOU!!
The Java
National Institute