A scalable parallel FEM surface fitting algorithm for data mining
Christen, Peter; Hegland, Markus; Roberts, Stephen; Altas, Irfan
Description
The development of automatic techniques to process and detect patterns in very large data sets is a major task in data mining. An essential subtask is the interpolation of surfaces, which can be done with multivariate regression. Thin plate splines provide a very good method to determine an approximating surface. Unfortunately, obtaining standard thin plate splines requires the solution of a dense linear system of order n, where n is the number of observations. Thus, standard thin plate splines...[Show more]
dc.contributor.author | Christen, Peter | |
---|---|---|
dc.contributor.author | Hegland, Markus | |
dc.contributor.author | Roberts, Stephen | |
dc.contributor.author | Altas, Irfan | |
dc.date.accessioned | 2003-07-03 | |
dc.date.accessioned | 2004-05-19T12:19:22Z | |
dc.date.accessioned | 2011-01-05T08:37:56Z | |
dc.date.available | 2004-05-19T12:19:22Z | |
dc.date.available | 2011-01-05T08:37:56Z | |
dc.date.created | 2001 | |
dc.identifier.uri | http://hdl.handle.net/1885/40729 | |
dc.identifier.uri | http://digitalcollections.anu.edu.au/handle/1885/40729 | |
dc.description.abstract | The development of automatic techniques to process and detect patterns in very large data sets is a major task in data mining. An essential subtask is the interpolation of surfaces, which can be done with multivariate regression. Thin plate splines provide a very good method to determine an approximating surface. Unfortunately, obtaining standard thin plate splines requires the solution of a dense linear system of order n, where n is the number of observations. Thus, standard thin plate splines are not practical, as the number of observations for data mining applications is often in the millions. We have developed a finite element approximation of a thin plate spline that can handle data sizes with millions of records. Each observation record has to be read from an external file once only and there is no need to store the data in memory. The resolution of the finite element method can be chosen independently from the number of data records. An overlapping domain partitioning is applied to achieve parallelism. Our algorithm is scalable both in the number of data points as well as with the number of processors. We present first results on a Sun shared-memory multiprocessor. | |
dc.format.extent | 385105 bytes | |
dc.format.extent | 356 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | application/octet-stream | |
dc.language.iso | en_AU | |
dc.subject | thin plate splines | |
dc.subject | finite element method | |
dc.subject | parallel computing | |
dc.subject | linear system | |
dc.subject | TE-CS | |
dc.title | A scalable parallel FEM surface fitting algorithm for data mining | |
dc.type | Working/Technical Paper | |
local.description.refereed | no | |
local.identifier.citationmonth | jan | |
local.identifier.citationyear | 2001 | |
local.identifier.eprintid | 1547 | |
local.rights.ispublished | yes | |
dc.date.issued | 2001 | |
local.contributor.affiliation | Department of Computer Science, FEIT | |
local.contributor.affiliation | ANU | |
local.citation | TR-CS-01-01 | |
Collections | ANU Research Publications |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
TR-CS-01-01.pdf | 376.08 kB | Adobe PDF |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator