Nicht aus der Schweiz? Besuchen Sie lehmanns.de

Non-Standard Parameter Adaptation for Exploratory Data Analysis

Buch | Hardcover
XI, 223 Seiten
2009 | 2009
Springer Berlin (Verlag)
978-3-642-04004-7 (ISBN)
CHF 224,65 inkl. MwSt
  • Versand in 10-15 Tagen
  • Versandkostenfrei
  • Auch auf Rechnung
  • Artikel merken
A review of standard algorithms provides the basis for more complex data mining techniques in this overview of exploratory data analysis. Recent reinforcement learning research is presented, as well as novel methods of parameter adaptation in machine learning.

Exploratory data analysis, also known as data mining or knowledge discovery from databases, is typically based on the optimisation of a specific function of a dataset. Such optimisation is often performed with gradient descent or variations thereof. In this book, we first lay the groundwork by reviewing some standard clustering algorithms and projection algorithms before presenting various non-standard criteria for clustering. The family of algorithms developed are shown to perform better than the standard clustering algorithms on a variety of datasets.

We then consider extensions of the basic mappings which maintain some topology of the original data space. Finally we show how reinforcement learning can be used as a clustering mechanism before turning to projection methods.

We show that several varieties of reinforcement learning may also be used to define optimal projections for example for principal component analysis, exploratory projection pursuit and canonical correlation analysis. The new method of cross entropy adaptation is then introduced and used as a means of optimising projections. Finally an artificial immune system is used to create optimal projections and combinations of these three methods are shown to outperform the individual methods of optimisation.

Introduction.- Review of Clustering Algorithms.- Review of Linear Projection Methods.- Non-standard Clustering Criteria.- Topographic Mappings and Kernel Clustering.- Online Clustering Algorithms and Reinforcement learning.- Connectivity Graphs and Clustering with Similarity Functions.- Reinforcement Learning of Projections.- Cross Entropy Methods.- Conclusions.

Erscheint lt. Verlag 28.9.2009
Reihe/Serie Studies in Computational Intelligence
Zusatzinfo XI, 223 p.
Verlagsort Berlin
Sprache englisch
Maße 155 x 235 mm
Gewicht 1140 g
Themenwelt Informatik Datenbanken Data Warehouse / Data Mining
Informatik Theorie / Studium Künstliche Intelligenz / Robotik
Mathematik / Informatik Mathematik Angewandte Mathematik
Technik
Schlagworte artificial immune systems • Clustering • Computational Intelligence • cross entropy • Data Analysis • Data Mining • Hardcover, Softcover / Technik/Allgemeines, Lexika • Knowledge Discovery • machine learning • Non-Standard Exploratory Data Analysis • Principal Component Analysis • Reinforcement Learning
ISBN-10 3-642-04004-7 / 3642040047
ISBN-13 978-3-642-04004-7 / 9783642040047
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Datenanalyse für Künstliche Intelligenz

von Jürgen Cleve; Uwe Lämmel

Buch | Softcover (2024)
De Gruyter Oldenbourg (Verlag)
CHF 104,90
Auswertung von Daten mit pandas, NumPy und IPython

von Wes McKinney

Buch | Softcover (2023)
O'Reilly (Verlag)
CHF 62,85