SC²S Colloquium - December 13, 2012

From Sccswiki
Revision as of 13:35, 29 November 2012 by Schreibm (talk | contribs) (Created page with "{| class="wikitable" |- | '''Date:''' || November 28, 2012 |- | '''Room:''' || 02.07.023 |- | '''Time:''' || 3 pm, s.t. |- |} == Florian Zacherl: Using pre-computed matrices...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
Date: November 28, 2012
Room: 02.07.023
Time: 3 pm, s.t.


Florian Zacherl: Using pre-computed matrices in a density-based classification method with sparse grids

Classification of huge data sets is a process that requires long computation times, especially with high-dimensional data. A way to reduce this is to use function approximation on a sparse grid. Still this might not be enough for big data sets. This IDP examines a further optimization by using a density-based approach that allows to do a relevant part of the work in advance without the actual data. More precisely, the solving of a linear system of equations is simplified by pre-computing, decomposing and storing the left hand side matrix of the system.