Data clustering in C++

Data clustering in C++: an object-oriented approach

by Gan, Guojun

Type Book
Rate 0.0 /5

Title Statements

  • Full title :Data clustering in C++ : an object-oriented approach / Guojun Gan.

Edition Statements

  • Publication Date:©2011.

Publication Statements

  • Publisher(s):CRC Press
  • Place of Publication:Boca Raton, Fla
  • Language:eng
  • Publication Date:©2011.

Notes

"A Chapman & Hall book."

CD-ROM contains classes, examples, unit test cases, and GNU configuration files. System requirements: C++ compiler, Boost C++ libraries.

The Physical Object

  • Description:xvii, 496 pages : : illustrations ; : 25 cm +

Edition Identifiers

  • ISBN:9781439862230, 1439862230
  • oclc:ocn668196928
  • LC Classification:QA76.9.D343
  • Dewey Decimal:519.53

Table of Contents

Introduction to data clustering -- The unified modeling language -- Object-oriented programming and C++ -- Design patterns -- C++ libraries and tools -- The clustering library -- Datasets -- Clusters -- Dissimilarity measures -- Clustering algorithms -- Utility classes -- Agglomerative hierarchical algorithms -- DIANA -- The k-means algorithm -- The c-means algorithm -- The k-prototypes algorithm -- The genetic k-modes algorithm -- The FSC algorithm -- The Gaussian mixture algorithm -- A parallel k-means algorithm.

Read More ↓

Subjects

Writers

More from this Series

  • Handbook of educational data mining

    ©2011.
    more →
    Handbook of educational data mining
  • Handbook of educational data mining

    2011.
    more →
    Handbook of educational data mining
  • Handbook of educational data mining

    2011.
    more →
    Handbook of educational data mining
  • Handbook of educational data mining

    2011.
    more →
    Handbook of educational data mining
  • Handbook of educational data mining

    2011.
    more →
    Handbook of educational data mining

Rate & Review

0.0/5
(0 people Voted)

No reviews yet. Be the first to rate this work.

Files & Downloads

No downloadable files are registered for this work yet.