528 search results - page 11 / 106 » Structure learning with independent non-identically distribu... |
ICDM
2009
IEEE
13 years 5 months ago
2009
IEEE
Recently a number of modeling techniques have been developed for data mining and machine learning in relational and network domains where the instances are not independent and ide...
TNN
1998
13 years 7 months ago
1998
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
IDA
2009
Springer
14 years 2 months ago
2009
Springer
We present a novel extension to Independent Component Analysis (ICA), where the data is generated as the product of two submodels, each of which follow an ICA model, and which comb...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
ADMA
2006
Springer
14 years 1 months ago
2006
Springer
We propose a new algorithm called SCD for learning the structure of a Bayesian network. The algorithm is a kind of constraintbased algorithm. By taking advantage of variable orderi...