Exact algorithms for size constrained clustering /

Exact algorithms for size constrained clustering / / Jianyi Lin .

Clustering 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 a...

Full description

Saved in:
Bibliographic Details
Superior document:Mathematical Sciences
VerfasserIn:
Lin, Jianyi
Place / Publishing House:Milan : : Libreria Ledi Srl,, 2013
Year of Publication:2013
Language:English
Series:Mathematical Sciences
Notes:Bibliographic Level Mode of Issuance: Monograph
Tags: Add Tag
No Tags, Be the first to tag this record!
id 993547040904498
ctrlnum (CKB)2670000000497803
(SSID)ssj0001326128
(PQKBManifestationID)12495062
(PQKBTitleCode)TC0001326128
(PQKBWorkID)11518835
(PQKB)10617971
(oapen)https://directory.doabooks.org/handle/20.500.12854/47161
(EXLCZ)992670000000497803
collection bib_alma
record_format marc
spelling Lin, Jianyi author.
Exact algorithms for size constrained clustering / Jianyi Lin .
Ledizioni 2013
Milan : Libreria Ledi Srl, 2013
text txt
computer c
online resource cr
text file rda
Mathematical Sciences
Bibliographic Level Mode of Issuance: Monograph
Includes bibliographical references.
Clustering 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.
Also available in print form.
English
Algorithms.
Mathematics.
Mathematical
88-6705-065-6
language English
format eBook
author Lin, Jianyi
spellingShingle Lin, Jianyi
Exact algorithms for size constrained clustering /
Mathematical Sciences
author_facet Lin, Jianyi
author_variant j l jl
author_role VerfasserIn
author_sort Lin, Jianyi
title Exact algorithms for size constrained clustering /
title_full Exact algorithms for size constrained clustering / Jianyi Lin .
title_fullStr Exact algorithms for size constrained clustering / Jianyi Lin .
title_full_unstemmed Exact algorithms for size constrained clustering / Jianyi Lin .
title_auth Exact algorithms for size constrained clustering /
title_new Exact algorithms for size constrained clustering /
title_sort exact algorithms for size constrained clustering /
series Mathematical Sciences
series2 Mathematical Sciences
publisher Ledizioni
Libreria Ledi Srl,
publishDate 2013
physical Also available in print form.
isbn 88-6705-065-6
illustrated Illustrated
work_keys_str_mv AT linjianyi exactalgorithmsforsizeconstrainedclustering
status_str n
ids_txt_mv (CKB)2670000000497803
(SSID)ssj0001326128
(PQKBManifestationID)12495062
(PQKBTitleCode)TC0001326128
(PQKBWorkID)11518835
(PQKB)10617971
(oapen)https://directory.doabooks.org/handle/20.500.12854/47161
(EXLCZ)992670000000497803
carrierType_str_mv cr
hierarchy_parent_title Mathematical Sciences
is_hierarchy_title Exact algorithms for size constrained clustering /
container_title Mathematical Sciences
_version_ 1796651448068472832
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01837nam a2200421 i 4500</leader><controlfield tag="001">993547040904498</controlfield><controlfield tag="005">20230621135405.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr|mn|---annan</controlfield><controlfield tag="008">160829s2013 it a ob 000 | eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CKB)2670000000497803</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SSID)ssj0001326128</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PQKBManifestationID)12495062</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PQKBTitleCode)TC0001326128</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PQKBWorkID)11518835</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PQKB)10617971</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(oapen)https://directory.doabooks.org/handle/20.500.12854/47161</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EXLCZ)992670000000497803</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">PQKB</subfield><subfield code="d">UkMaJRU</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lin, Jianyi</subfield><subfield code="e">author.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Exact algorithms for size constrained clustering /</subfield><subfield code="c">Jianyi Lin .</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="b">Ledizioni</subfield><subfield code="c">2013</subfield></datafield><datafield tag="264" ind1="3" ind2="1"><subfield code="a">Milan :</subfield><subfield code="b">Libreria Ledi Srl,</subfield><subfield code="c">2013</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="2">rda</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Mathematical Sciences</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Bibliographic Level Mode of Issuance: Monograph</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Clustering 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.</subfield></datafield><datafield tag="530" ind1=" " ind2=" "><subfield code="a">Also available in print form.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Algorithms.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Mathematics.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Mathematical</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">88-6705-065-6</subfield></datafield><datafield tag="906" ind1=" " ind2=" "><subfield code="a">BOOK</subfield></datafield><datafield tag="ADM" ind1=" " ind2=" "><subfield code="b">2023-06-25 10:33:36 Europe/Vienna</subfield><subfield code="f">system</subfield><subfield code="c">marc21</subfield><subfield code="a">2014-01-11 19:31:36 Europe/Vienna</subfield><subfield code="g">false</subfield></datafield><datafield tag="AVE" ind1=" " ind2=" "><subfield code="i">DOAB Directory of Open Access Books</subfield><subfield code="P">DOAB Directory of Open Access Books</subfield><subfield code="x">https://eu02.alma.exlibrisgroup.com/view/uresolver/43ACC_OEAW/openurl?u.ignore_date_coverage=true&amp;portfolio_pid=5338484790004498&amp;Force_direct=true</subfield><subfield code="Z">5338484790004498</subfield><subfield code="b">Available</subfield><subfield code="8">5338484790004498</subfield></datafield></record></collection>

Similar Items