2512 search results - page 240 / 503 » Learning from Highly Structured Data by Decomposition |
135
click to vote
PKDD
2010
Springer
15 years 2 months ago
2010
Springer
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
125
click to vote
ECSQARU
2005
Springer
15 years 10 months ago
2005
Springer
In this paper we explore the use of several types of structural restrictions within algorithms for learning Bayesian networks. These restrictions may codify expert knowledge in a g...
177
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: Protein structural data has increased exponentially, such that fast and accurate tools are necessary to access structure similarity search. To improve the search speed...
124
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: Aligning homologous non-coding RNAs (ncRNAs) correctly in terms of sequence and structure is an unresolved problem, due to both mathematical complexity and imperfect s...
155
click to vote
SDM
2003
SIAM
15 years 5 months ago
2003
SIAM
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...