Sciweavers

4196 search results - page 521 / 840
» Unsupervised Learning of Relations
Sort
View
CN
2006
163views more  CN 2006»
15 years 4 months ago
A framework for mining evolving trends in Web data streams using dynamic learning and retrospective validation
The expanding and dynamic nature of the Web poses enormous challenges to most data mining techniques that try to extract patterns from Web data, such as Web usage and Web content....
Olfa Nasraoui, Carlos Rojas, Cesar Cardona
NN
2008
Springer
152views Neural Networks» more  NN 2008»
15 years 4 months ago
Analysis of the IJCNN 2007 agnostic learning vs. prior knowledge challenge
We organized a challenge for IJCNN 2007 to assess the added value of prior domain knowledge in machine learning. Most commercial data mining programs accept data pre-formatted in ...
Isabelle Guyon, Amir Saffari, Gideon Dror, Gavin C...
BMCBI
2004
140views more  BMCBI 2004»
15 years 4 months ago
What can we learn from noncoding regions of similarity between genomes?
Background: In addition to known protein-coding genes, large amounts of apparently non-coding sequence are conserved between the human and mouse genomes. It seems reasonable to as...
Thomas A. Down, Tim J. P. Hubbard
JMLR
2011
192views more  JMLR 2011»
14 years 11 months ago
Minimum Description Length Penalization for Group and Multi-Task Sparse Learning
We propose a framework MIC (Multiple Inclusion Criterion) for learning sparse models based on the information theoretic Minimum Description Length (MDL) principle. MIC provides an...
Paramveer S. Dhillon, Dean P. Foster, Lyle H. Unga...
PAMI
2011
14 years 11 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams