Randomized algorithm of finding the true number of clusters based on Chebychev polynomial approximation (Chapter 6)

D. Shalymov, R. Avros, O. Granichin, Z. Volkovich, G.-W. Weber

Research output

4 Citations (Scopus)

Abstract

Data mining is one of the most rapidly growing research areas in computer science and statistics. In Volume 1 of this three volume series, we have brought together contributions from some of the most prestigious researchers in the fundamental data mining tasks of clustering, association and classification. Each of the chapters is self contained. Theoreticians and applied scientists/ engineers will find this volume valuable. Additionally, it provides a sourcebook for graduate students interested in the current direction of research in these aspects of data mining.
Original languageEnglish
Title of host publicationData Mining: Foundations and Intelligent Paradigms. Vol. 1
PublisherSpringer
Pages336 стр., 131-155
ISBN (Print)978-3-642-23165-0
Publication statusPublished - 2012

Cite this

Shalymov, D., Avros, R., Granichin, O., Volkovich, Z., & Weber, G-W. (2012). Randomized algorithm of finding the true number of clusters based on Chebychev polynomial approximation (Chapter 6). In Data Mining: Foundations and Intelligent Paradigms. Vol. 1 (pp. 336 стр., 131-155). Springer.
Shalymov, D. ; Avros, R. ; Granichin, O. ; Volkovich, Z. ; Weber, G.-W. / Randomized algorithm of finding the true number of clusters based on Chebychev polynomial approximation (Chapter 6). Data Mining: Foundations and Intelligent Paradigms. Vol. 1. Springer, 2012. pp. 336 стр., 131-155
@inbook{d7f8d990310c493491500507b62cf0b7,
title = "Randomized algorithm of finding the true number of clusters based on Chebychev polynomial approximation (Chapter 6)",
abstract = "Data mining is one of the most rapidly growing research areas in computer science and statistics. In Volume 1 of this three volume series, we have brought together contributions from some of the most prestigious researchers in the fundamental data mining tasks of clustering, association and classification. Each of the chapters is self contained. Theoreticians and applied scientists/ engineers will find this volume valuable. Additionally, it provides a sourcebook for graduate students interested in the current direction of research in these aspects of data mining.",
keywords = "Computational Intelligence, Data Mining, Intelligent Paradigms",
author = "D. Shalymov and R. Avros and O. Granichin and Z. Volkovich and G.-W. Weber",
year = "2012",
language = "English",
isbn = "978-3-642-23165-0",
pages = "336 стр., 131--155",
booktitle = "Data Mining: Foundations and Intelligent Paradigms. Vol. 1",
publisher = "Springer",
address = "Germany",

}

Shalymov, D, Avros, R, Granichin, O, Volkovich, Z & Weber, G-W 2012, Randomized algorithm of finding the true number of clusters based on Chebychev polynomial approximation (Chapter 6). in Data Mining: Foundations and Intelligent Paradigms. Vol. 1. Springer, pp. 336 стр., 131-155.

Randomized algorithm of finding the true number of clusters based on Chebychev polynomial approximation (Chapter 6). / Shalymov, D.; Avros, R.; Granichin, O.; Volkovich, Z.; Weber, G.-W.

Data Mining: Foundations and Intelligent Paradigms. Vol. 1. Springer, 2012. p. 336 стр., 131-155.

Research output

TY - CHAP

T1 - Randomized algorithm of finding the true number of clusters based on Chebychev polynomial approximation (Chapter 6)

AU - Shalymov, D.

AU - Avros, R.

AU - Granichin, O.

AU - Volkovich, Z.

AU - Weber, G.-W.

PY - 2012

Y1 - 2012

N2 - Data mining is one of the most rapidly growing research areas in computer science and statistics. In Volume 1 of this three volume series, we have brought together contributions from some of the most prestigious researchers in the fundamental data mining tasks of clustering, association and classification. Each of the chapters is self contained. Theoreticians and applied scientists/ engineers will find this volume valuable. Additionally, it provides a sourcebook for graduate students interested in the current direction of research in these aspects of data mining.

AB - Data mining is one of the most rapidly growing research areas in computer science and statistics. In Volume 1 of this three volume series, we have brought together contributions from some of the most prestigious researchers in the fundamental data mining tasks of clustering, association and classification. Each of the chapters is self contained. Theoreticians and applied scientists/ engineers will find this volume valuable. Additionally, it provides a sourcebook for graduate students interested in the current direction of research in these aspects of data mining.

KW - Computational Intelligence

KW - Data Mining

KW - Intelligent Paradigms

M3 - Chapter

SN - 978-3-642-23165-0

SP - 336 стр., 131-155

BT - Data Mining: Foundations and Intelligent Paradigms. Vol. 1

PB - Springer

ER -

Shalymov D, Avros R, Granichin O, Volkovich Z, Weber G-W. Randomized algorithm of finding the true number of clusters based on Chebychev polynomial approximation (Chapter 6). In Data Mining: Foundations and Intelligent Paradigms. Vol. 1. Springer. 2012. p. 336 стр., 131-155