Sciweavers

2512 search results - page 1 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
PKDD
1999
Springer
90views Data Mining» more  PKDD 1999»
13 years 9 months ago
Learning from Highly Structured Data by Decomposition
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...
René MacKinney-Romero, Christophe G. Giraud...
ESWS
2008
Springer
13 years 6 months ago
Learning Highly Structured Semantic Repositories from Relational Databases:
Abstract. Relational databases are valuable sources for ontology learning. Methods and tools have been proposed to generate ontologies from such structured input. However, a major ...
Farid Cerbah
ICA
2012
Springer
12 years 8 days ago
On Revealing Replicating Structures in Multiway Data: A Novel Tensor Decomposition Approach
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
Anh Huy Phan, Andrzej Cichocki, Petr Tichavsk&yacu...
AAAI
2010
13 years 6 months ago
Unsupervised Learning of Event Classes from Video
We present a method for unsupervised learning of event classes from videos in which multiple actions might occur simultaneously. It is assumed that all such activities are produce...
Muralikrishna Sridhar, Anthony G. Cohn, David C. H...
HYBRID
1998
Springer
13 years 9 months ago
High Order Eigentensors as Symbolic Rules in Competitive Learning
We discuss properties of high order neurons in competitive learning. In such neurons, geometric shapes replace the role of classic `point' neurons in neural networks. Complex ...
Hod Lipson, Hava T. Siegelmann