Sciweavers

3096 search results - page 405 / 620
» Theory and Use of the EM Algorithm
Sort
View
IJON
2007
184views more  IJON 2007»
15 years 6 months ago
Convex incremental extreme learning machine
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
Guang-Bin Huang, Lei Chen
AMW
2009
15 years 4 months ago
Schema Design for Uncertain Databases
We address schema design in uncertain databases. Since uncertain data is relational in nature, decomposition becomes a key issue in design. Decomposition relies on dependency theo...
Anish Das Sarma, Jeffrey D. Ullman, Jennifer Widom
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 6 months ago
Information Distance
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
Charles H. Bennett, Péter Gács, Ming...
KDD
2004
ACM
110views Data Mining» more  KDD 2004»
16 years 7 months ago
Generalizing the notion of support
The goal of this paper is to show that generalizing the notion of support can be useful in extending association analysis to non-traditional types of patterns and non-binary data....
Michael Steinbach, Pang-Ning Tan, Hui Xiong, Vipin...
PODC
2006
ACM
16 years 15 days ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah