LEADER 01906nam  2200457   450 
001 996214389303316
005 20230621135405.0
035   $a(CKB)2670000000497803
035   $a(SSID)ssj0001326128
035   $a(PQKBManifestationID)12495062
035   $a(PQKBTitleCode)TC0001326128
035   $a(PQKBWorkID)11518835
035   $a(PQKB)10617971
035   $a(oapen)https://directory.doabooks.org/handle/20.500.12854/47161
035   $a(EXLCZ)992670000000497803
100   $a20160829d2013      uy             |
101 0 $aeng
135   $aurmn|---annan
181   $ctxt
182   $cc
183   $acr
200 10$aExact algorithms for size constrained clustering /$fJianyi Lin 
210   $cLedizioni$d2013
210 31$aMilan :$cLibreria Ledi Srl,$d2013
225 1 $aMathematical Sciences
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a88-6705-065-6 
320   $aIncludes bibliographical references.
330   $aClustering or cluster analysis [5] is a method in unsupervised learning and one of the most used techniques in statistical data analysis. Clustering has a wide range of applications in many areas like pattern recognition, medical diagnostics, datamining, biology, market research and image analysis among others. A cluster is a set of data points that in some sense are similar to each other, and clustering is a process of partitioning a data set into disjoint clusters. In distance clustering, the similarity among data points is obtained by means of a distance function.
606   $aAlgorithms
606   $aMathematics
610   $aMathematical
615  0$aAlgorithms.
615  0$aMathematics.
700   $aLin$b Jianyi$0802119
801  0$bPQKB
801  2$bUkMaJRU
906   $aBOOK
912   $a996214389303316
996   $aExact algorithms for size constrained clustering$91803382
997   $aUNISA