Result 1 to 20 from 192 total
Qualitative and quantitative conditions for the transitivity of perceived causation: theoretical and experimental results. (English)
Ann. Math. Artif. Intell. 64, No. 2-3, 311-333 (2012).
1
Learning from mixture of experimental data: a constraint-based approach. (English)
Maglogiannis, Ilias (ed.) et al., Artificial intelligence: Theories and applications. 7th Hellenic conference on AI, SETN 2012, Lamia, Greece, May 28‒31, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30447-7/pbk). Lecture Notes in Computer Science 7297. Lecture Notes in Artificial Intelligence, 124-131 (2012).
2
Objective priors for generative star-shape models. (English)
Stat. Probab. Lett. 82, No. 5, 991-997 (2012).
3
Tree cumulants and the geometry of binary tree models. (English)
Bernoulli 18, No. 1, 290-321 (2012).
4
Pair-copula constructions for non-Gaussian DAG models. (English)
Can. J. Stat. 40, No. 1, 86-109 (2012).
5
Foundations of compositional model theory. (English)
Int. J. Gen. Syst. 40, No. 6, 623-678 (2011).
6
An optimization approach for structural learning Bayesian networks based on prior node ordering. (Chinese)
Acta Autom. Sin. 37, No. 12, 1514-1519 (2011).
7
An improved Bayesian network structure learning algorithm based on the conditional independence test. (Chinese)
J. Yunnan Univ. Natly., Nat. Sci. 20, No. 5, 402-405 (2011).
8
Quasi-symmetric graphical log-linear models. (English)
Scand. J. Stat. 38, No. 3, 447-465 (2011).
9
Detection of mutually dependent test items using the LCI test. (English)
Onada, Takashi (ed.) et al., New frontiers in artificial intelligence. JSAI-isAI 2010 workshops, LENLS, JURISIN, AMBN, ISS, Tokyo, Japan, November 18‒19, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25654-7/pbk). Lecture Notes in Computer Science 6797. Lecture Notes in Artificial Intelligence, 196-209 (2011).
10
Analysis of Markov boundary induction in Bayesian networks: a new view from matroid theory. (English)
Fundam. Inform. 107, No. 4, 415-434 (2011).
11
Exploiting local dependencies with spatial-scale space (S-cube) for near-duplicate retrieval. (English)
Comput. Vis. Image Underst. 115, No. 6, 750-758 (2011).
12
A hierarchical Bayesian approach to record linkage and population size problems. (English)
Ann. Appl. Stat. 5, No. 2B, 1553-1585 (2011).
13
Dynamic ordering-based search algorithm for Markov blanket discovery. (English)
Huang, Joshua Zhexue (ed.) et al., Advances in knowledge discovery and data mining. 15th Pacific-Asia conference, PAKDD 2011, Shenzhen, China, May 24‒27, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-20846-1/pbk). Lecture Notes in Computer Science 6635. Lecture Notes in Artificial Intelligence, 420-431 (2011).
14
Compositional models and conditional independence in evidence theory. (English)
Int. J. Approx. Reasoning 52, No. 3, 316-334 (2011).
15
The binomial ideal of the intersection axiom for conditional probabilities. (English)
J. Algebr. Comb. 33, No. 3, 455-463 (2011).
16
BASSUM: a Bayesian semi-supervised method for classification feature selection. (English)
Pattern Recognition 44, No. 4, 811-820 (2011).
17
A construction algorithm of MPD-JT for Bayesian networks based on full conditional independence. (Chinese)
Syst. Eng. Electron. 32, No. 6, 1325-1328 (2010).
18
Learning subsumption hierarchies of ontology concepts from texts. (English)
Web Intell. Agent Syst. 8, No. 1, 37-51 (2010).
19
Marginal log-linear parameterization of conditional independence models. (English)
Biometrika 97, No. 4, 1006-1012 (2010).
20
Result 1 to 20 from 192 total
Start
Contact
Print
General Help
