Greedy Algorithm



Download 97,97 Kb.
bet10/12
Sana23.06.2022
Hajmi97,97 Kb.
#696905
1   ...   4   5   6   7   8   9   10   11   12
Bog'liq
greedy (1)

Clustering and Packing


An important problem, especially in Machine Learning, is the problem of clustering. As- sume we have a metric space ( V, w ) where w : V 2 → R + is a metric ie w ( x, y ) = 0 iff x = y , w ( x, y ) = w ( y, x ) and w obeys the triangle inequality. Our goal is to partition V into k blocks such that points in the same block are 'nearby' and points in different blocks are 'far' apart. This is not meant to be formal.

Most formalizations of 'near' and 'far' result in NP-hard optimization problems (in par- ticular they are non-convex). Fortunately, most of these problems exhibit simple greedy strategies. However, the first problem we will see can actually be solved optimally through a greedy algorithm.




      1. Maxi-min Spacing


Definition 5.25 (Multi-cut) . A multi-cut S is a set of subsets { S 1 , . . . , S k } of V such that
V = S 1. . . S k and S iS j = ∅ for all 1 ≤ i < j k .
Definition 5.26 (Spacing) . The spacing of a cut S , denoted spacing ( S ) is the at least weight edge crossing S. _

spacing ( S ) = u
min
S i , v ∈ S j , i
w u, v (5.6)
j

Exercise 5.27 (Maxi-min Spacing Clustering Problem) . Given ( V, w, k ) find a k -way cut
S with maximal spacing.

Download 97,97 Kb.

Do'stlaringiz bilan baham:
1   ...   4   5   6   7   8   9   10   11   12




Ma'lumotlar bazasi mualliflik huquqi bilan himoyalangan ©hozir.org 2024
ma'muriyatiga murojaat qiling

kiriting | ro'yxatdan o'tish
    Bosh sahifa
юртда тантана
Боғда битган
Бугун юртда
Эшитганлар жилманглар
Эшитмадим деманглар
битган бодомлар
Yangiariq tumani
qitish marakazi
Raqamli texnologiyalar
ilishida muhokamadan
tasdiqqa tavsiya
tavsiya etilgan
iqtisodiyot kafedrasi
steiermarkischen landesregierung
asarlaringizni yuboring
o'zingizning asarlaringizni
Iltimos faqat
faqat o'zingizning
steierm rkischen
landesregierung fachabteilung
rkischen landesregierung
hamshira loyihasi
loyihasi mavsum
faolyatining oqibatlari
asosiy adabiyotlar
fakulteti ahborot
ahborot havfsizligi
havfsizligi kafedrasi
fanidan bo’yicha
fakulteti iqtisodiyot
boshqaruv fakulteti
chiqarishda boshqaruv
ishlab chiqarishda
iqtisodiyot fakultet
multiservis tarmoqlari
fanidan asosiy
Uzbek fanidan
mavzulari potok
asosidagi multiservis
'aliyyil a'ziym
billahil 'aliyyil
illaa billahil
quvvata illaa
falah' deganida
Kompyuter savodxonligi
bo’yicha mustaqil
'alal falah'
Hayya 'alal
'alas soloh
Hayya 'alas
mavsum boyicha


yuklab olish