126 search results - page 14 / 26 » Finding low-entropy sets and trees from binary data |
110
click to vote
CCGRID
2010
IEEE
15 years 22 days ago
2010
IEEE
Abstract--Large high dimension datasets are of growing importance in many fields and it is important to be able to visualize them for understanding the results of data mining appro...
111
click to vote
AUSDM
2006
Springer
15 years 3 months ago
2006
Springer
In response to the rapid development of DNA Microarray technology, many classification methods have been used for Microarray classification. SVMs, decision trees, Bagging, Boostin...
NIPS
2004
15 years 1 months ago
2004
We propose a novel a framework for deriving approximations for intractable probabilistic models. This framework is based on a free energy (negative log marginal likelihood) and ca...
WEBDB
2009
Springer
15 years 6 months ago
2009
Springer
We study the problem of automatically discovering semantic associations between schema elements, namely foreign keys. This problem is important in all applications where data sets...
110
click to vote
ECCV
2002
Springer
16 years 1 months ago
2002
Springer
Abstract. This paper addresses the problem of probabilistically modeling 3D human motion for synthesis and tracking. Given the high dimensional nature of human motion, learning an ...