1060 search results - page 54 / 212 » On the Discovery of Random Trees |
107
click to vote
AAAI
1996
14 years 11 months ago
1996
Procedural representations of control policies have two advantages when facing the scale-up problem in learning tasks. First they are implicit, with potential for inductive genera...
APPINF
2003
14 years 11 months ago
2003
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
Graphical models of brain functional connectivity have matured from con rming a priori hypotheses to an exploratory tool for discovering unknown connectivity. However, exploratory...
ASUNAM
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
116
click to vote
SDM
2003
SIAM
14 years 11 months ago
2003
SIAM
In this paper, we focus on mining periodic patterns allowing some degree of imperfection in the form of random replacement from a perfect periodic pattern. In InfoMiner+, we propo...