Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

PKDD
1999
Springer

favoriteEmaildiscussreport

90views Data Mining» more PKDD 1999»

Learning from Highly Structured Data by Decomposition

13 years 9 months ago

Learning from Highly Structured Data by Decomposition

Download www.cs.bris.ac.uk

This paper addresses the problem of learning from highly structured data. Speci cally, it describes a procedure, called decomposition, that allows a learner to access automatically the subparts of examples represented as closed terms in a higher-order language. This procedure maintains a clear distinction between the structure of an individual and its properties. A learning system based on decomposition is also presented and several examples of its use are described.

René MacKinney-Romero, Christophe G. Giraud

Real-time Traffic

Clear Distinction | Closed Terms | Data Mining | Learner | PKDD 1999 |

claim paper

Related Content

» Learning Highly Structured Semantic Repositories from Relational Databases

» On Revealing Replicating Structures in Multiway Data A Novel Tensor Decomposition Approach

» Unsupervised Learning of Event Classes from Video

» High Order Eigentensors as Symbolic Rules in Competitive Learning

» Learning Hierarchical Shape Models from Examples

» The Effect of Principal Component Analysis on Machine Learning Accuracy with High Dimensio...

» Relational IBL in classical music

» Learning Highly Structured Manifolds Harnessing the Power of SOMs

» Structured metric learning for high dimensional problems

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	PKDD
Authors	René MacKinney-Romero, Christophe G. Giraud-Carrier

Comments (0)