Example: barber

Supervised k-Means Clustering - cs.cornell.edu

vised approach based on structural support vector machines, taking as input a training set S = {(x1,y1),(x2,y2),...,(xn,yn)}. Each xi ∈ X is a set of items and yi ∈ Y a complete partitioning of that set. For example, S could have xi as noun-phrases in a document and yi as the partitioning into co-referent sets, or xi as images with yi as ...

Tags:

  Name, Supervised, Clustering, Vised, Supervised k means clustering

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Transcription of Supervised k-Means Clustering - cs.cornell.edu

Related search queries