( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
MAMBO: Discovering Association Rules Based on Conditional Independencies.

, , и . IDA, том 2189 из Lecture Notes in Computer Science, стр. 289-298. Springer, (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Lúcio Castelo Branco

Lúcio Castelo Branco

José Alexandre Castelo Branco Matallo

Robert Wille

Towards a design flow for reversible logic. Uni Bremen, (2009)

Robert Klöfkorn

Numerics for evolution equations: a general interface based design concept. Uni Freiburg, (2009)
 

Другие публикации лиц с тем же именем

Learning mixed graphical models from data with p larger than n., и . UAI, стр. 689-697. AUAI Press, (2011)Reasoning from non-stationarity, , и . Physica A: Statistical Mechanics and its Applications, 314 (1-4): 246--255 (01.11.2002)A characterization of moral transitive acyclic directed graph Markov models as labeled trees, и . Journal of Statistical Planning and Inference, 115 (1): 235--259 (01.07.2003)Learning Bayesian Network Classifiers for Credit Scoring Using Markov Chain Monte Carlo Search., , , и . ICPR (3), стр. 49-52. IEEE Computer Society, (2002)A Robust Procedure For Gaussian Graphical Model Search From Microarray Data With p Larger Than n., и . J. Mach. Learn. Res., (2006)On Inclusion-Driven Learning of Bayesian Networks., и . J. Mach. Learn. Res., (2003)Priors on network structures. Biasing the search for Bayesian networks., и . Int. J. Approx. Reason., 24 (1): 39-57 (2000)MAMBO: Discovering Association Rules Based on Conditional Independencies., , и . IDA, том 2189 из Lecture Notes in Computer Science, стр. 289-298. Springer, (2001)Learning mixed graphical models from data with p larger than n, и . CoRR, (2012)Association Models for Web Mining., и . Data Min. Knowl. Discov., 5 (3): 183-196 (2001)