Kaikki kirjat 25 % alennuksella koodilla: BOOKS

  • check Yli 10 miljoonaa kirjaa
  • check Uutuuksia joka päivä
  • check Yli 1 miljoona asiakasta luottaa meihin
  • check Hyvät hinnat ja alennukset
  • check Toimitus koko Eurooppaan

Constrained Clustering: Computer Science, BIRCH (data clustering), CURE Data Clustering Algorithm -

englanti
2026-03-27
146,80 € 195,73 €

-25% koodilla BOOKS

Toimittajalla varastossa

Toimitus 15-21 arkipäivässä

30 päivän palautusoikeus

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, constrained clustering is a class of semi-supervised learning algorithms. Typically, constrained clustering incorporates either a set of must-link constraints, cannot-link constraints, or both, with a Data clustering algorithm. Both a must-link and a cannot-lin ... Täydellinen kuvaus

Saatat myös pitää

Kuvaus

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, constrained clustering is a class of semi-supervised learning algorithms. Typically, constrained clustering incorporates either a set of must-link constraints, cannot-link constraints, or both, with a Data clustering algorithm. Both a must-link and a cannot-link constraint define a relationship between two data instances. A must-link constraint is used to specify that the two instances in the must-link relation should be associated with the same cluster. A cannot-link constraint is used to specify that the two instances in the cannot-link relation should not be associated with the same cluster. These sets of constraints acts as a guide for which a constrained clustering algorithm will attempt to find clusters in a data set which satisfy the specified must-link and cannot-link constraints. Some constrained clustering algorithms will abort if no such clustering exists which satisfies the specified constraints. Others will try to minimize the amount of constraint violation should it be impossible to find a clustering which satisfies the constraints.

Lisätietoja

Julkaisija OmniScriptum
Julkaisuvuosi 2026
Kannen tyyppi Pehmeäkantinen
EAN 9786133225848
Kirjoita oma arvostelusi
Arvostelet: Constrained Clustering: Computer Science, BIRCH (data clustering), CURE Data Clustering Algorithm
Arvostelusi:

Goodreads-arvostelut

146,80 € 195,73 €