(r2) IvoaKDDguideAlgorithms < IVOA

IVOA Web>IvoaKDD>IvoaKDDguide>IvoaKDDguideAlgorithms (revision 2) (raw view)~~EditAttach~~

---+ [[IvoaKDDguide][IVOA KDD-IG: A user guide for Data Mining in Astronomy]]

---++ 4: The main data mining algorithms

One of the aims of the KDD-IG is to build up an [[IvoaKDDCensus][inventory of data mining algorithms that are of use to astronomy]]. We don't attempt to duplicate that here, but instead provide descriptions of some of the most well-known data mining algorithms, many of which have been fairly extensively used in astronomy.

   * Artificial neural network
   * Decision tree
   * Genetic algorithms
   * k nearest neighbor
   * k-means clustering
   * Kernel density estimation
   * Kohonen self-organizing map
   * Independent component analysis
   * Mixture models and EM algorithm
   * Support vector machine

<br>

<b>Artificial Neural Networks</b>
<br><br>
Artificial Neural Networks (ANNs) are one of the oldest data-mining algorithms, and one of the first to be applied in astronomy. Modelled after the mammalian Brain, ANNs consist of a large number of processing units that are interconnected with each other. The interconnections are represented by weights (numerical values in the range 0 to 1 or -1 to 1), and learning of the model occurs by adjusting the weights. ANNs can be used for both supervised (predictive) and unsupervised (descriptive) data mining.
<br><br>
ANNs come in a large variety of flavors, more so with respect to the architecture in which the processing units, so-called <i> perceptrons </i>, are connected, but also with respect to the learning algorithm used. One typical architecture is that of a <i>feedforward</i> network, in which a distinct <i>input layer</i> is connected to a distinct <i>output layer</i> via one or more <i>hidden layers</i>. Connections in this particular network point in the forward direction only. Each node in the input layer represents one attribute for each sample, while each node in the output layer typically represents a class (with the exception of a single output node for a two-class problem).
<br><br>
For a feedforward network, learning typically occurs through the <i>Backpropagation</i> algorithm. For this algorithm, input values are presented to the input layer and passed through the hidden layers to produce values at each node in the output layer. The produced output is compared to the desired output (in the form of the correct class); the resulting error is then backpropagated in the reverse direction and used to adjust the weight so as to minimize the error.
<br><br> 
<u>Main characteristics:</u> 
<ul>
<li>convergence of the weights is slow</li>
<li>the model (the numerical values associated with the weights) is hard to interpret </li>
<li>prone to settle into a local minimum because of the complexity of the error surface</li>
<li>sensitive to noise</li>
<li>choice of the architecture is non-trivial</li>
<li>able to approximate any function, given a lack of certain restrictions with respect to the number of hidden layers and number of nodes in hidden layers</li>
<li>easy to parallize</li>
</ul>
%GREEN% *Under construction by group members* %ENDCOLOR%

<br>

-- IVOA.NickBall - 05 Sep 2010
<br>
-- IVOA.SabineMcConnell - 16 Jan 2011

<br/>
<!--
      * Set ALLOWTOPICRENAME = %MAINWEB%.TWikiAdminGroup
-->

Topic revision: r2 - 2011-01-16 - SabineMcConnell

IVOA

Log in or Register

IVOA.net
Wiki Home
WebChanges
WebTopicList
WebStatistics

Twiki Meta & Help
IVOA
Know
Main
Sandbox
TWiki

TWiki intro
TWiki tutorial
User registration
Notify me

Working Groups

Interest Groups

Committees

Stds&Procs

www.ivoa.net
Documents
Events
Members
XML Schema