chechetka's library 22 articles Export

	Near-optimal Nonmyopic Value of Information in Graphical Models [My Copy] In Uncertainty in Artificial Intelligence (2005) by Andreas Krause, Carlos Guestrin posted to _cited-by-nips2007 bayes-networks graphical-models markov-networks submodularity by chechetka on 2007-06-08 17:35:06 as
	Model-driven data acquisition in sensor networks [My Copy] In International Conference on Very Large Data Bases (2004) by Amol Deshpande, Carlos Guestrin, Sam Madden, Joseph Hellerstein, Wei Hong posted to _cited-by-nips2007 by chechetka on 2007-06-05 06:38:06 as along with 2 people and 1 group mhay kashmira kdl
	The ALARM Monitoring System: A Case Study with Two Probablistic Inference Techniques for Belief Networks [My Copy] In Second European Conference on Artificial Intelligence in Medicine (1988) by Ingo Beinlich, Jaap Suermondt, Martin Chavez, Gregory Cooper posted to _cited-by-nips2007 bayes-networks graphical-models by chechetka on 2007-06-04 06:15:38 as
	Minimizing symmetric submodular functions [My Copy] Mathematical Programming, Vol. 82, No. 1. (June 1998), pp. 3-12. by Maurice Queyranne posted to _cited-by-nips2007 optimization submodularity by chechetka on 2007-05-07 16:46:27 as
	Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) [My Copy] (15 January 1979) by Michael R. Garey, David S. Johnson posted to _cited-by-nips2007 hardness by chechetka on 2007-05-01 20:37:32 as along with 17 people frimjon NitinCR tanderson dcordeiro pverstra gale82 creswick greenw ima danielaugot lcigler fdr eporreca Fin payton345 djlin tkollar
	Causation, Prediction, and Search, Second Edition (Adaptive Computation and Machine Learning) [My Copy] (08 January 2001) by Peter Spirtes, Clark Glymour, Richard Scheines posted to _cited-by-nips2007 graphical-models markov-networks structure-learning by chechetka on 2007-04-29 22:01:51 as along with 5 people livingthingdan wnpx naegele frohike rsantana
	Complexity of Finding Embeddings in a k-Tree [My Copy] SIAM Journal on Algebraic and Discrete Methods, Vol. 8, No. 2. (1987), pp. 277-284. by Stefan Arnborg, Derek G. Corneil, Andrzej Proskurowski posted to _cited-by-nips2007 by chechetka on 2007-04-29 21:27:24 as along with 1 person AbnerCYH
	Learning Bayesian Networks is NP-Complete [My Copy] In Learning from Data: Artificial Intelligence and Statistics V (1996), pp. 121-130. by David M. Chickering edited by D. Fisher, H. J. Lenz posted to _cited-by-nips2007 bayes-networks graphical-models hardness structure-learning by chechetka on 2007-04-29 20:28:17 as
	Maximum Likelihood Bounded Tree-Width Markov Networks [My Copy] In Proceedings of the 17th Annual Conference on Uncertainty in Artificial Intelligence (UAI-01) (2001), pp. 504-51. by Nathan Srebro posted to _cited-by-nips2007 graphical-models hardness structure-learning by chechetka on 2007-04-29 20:17:17 as
	Inducing Features of Random Fields [My Copy] IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 19, No. 4. (April 1997), pp. 380-393. by Stephen Della Pietra, Vincent Della Pietra, John Lafferty posted to _cited-by-nips2007 graphical-models markov-networks structure-learning by chechetka on 2007-04-29 20:13:29 as along with 7 people and 2 groups zzb3886 mthomure lfriedl alterego bhaddow whym mmunson ReachGrasp Computational Cognitive Neuroscience Lab
	Finding Optimal Bayesian Networks by Dynamic Programming [My Copy] No. CMU-CALD-05-106. (2005) by Ajit Singh, Andrew Moore posted to _cited-by-nips2007 bayes-networks graphical-models structure-learning by chechetka on 2007-04-29 20:10:43 as
	Learning Factor Graphs in Polynomial Time and Sample Complexity [My Copy] Journal of Machine Learning Research, Vol. 7 (August 2006), pp. 1743-1788. by Pieter Abbeel, Daphne Koller, Andrew Y. Ng posted to _cited-by-nips2007 factor-graphs graphical-models structure-learning by chechetka on 2007-04-29 20:08:41 as along with 4 people and 4 groups rsabbadin mhay feasel rsantana Modèles Graphiques UBIAT kdl unc_cs_eve UNC-FPM
	Ordering-based Search: A Simple and Effective Algorithm for Learning Bayesian Networks [My Copy] In Proceedings of the Conference on Uncertainty in Artificial Intelligence (2005) by Marc Teyssier, Daphne Koller posted to _cited-by-nips2007 bayes-networks graphical-models structure-learning by chechetka on 2007-04-29 20:06:21 as
	Approximating discrete probability distributions with dependence trees [My Copy] IEEE Transactions on Information Theory, Vol. 14, No. 3. (1968), pp. 462-467. by C. Chow, C. Liu posted to _cited-by-nips2007 graphical-models structure-learning by chechetka on 2007-04-29 20:00:23 as along with 8 people and 1 group tessaverhoef pcarbo bpacker pliz craigtalbert dwf roys tkollar vision-ng
	$My PDF meil\ua_01_learning.pdf$ Learning with mixtures of trees [My Copy] Journal of Machine Learning Research, Vol. 1 (2001), pp. 1-48. by Marina Meil\ua, Michael I. Jordan posted to _cited-by-nips2007 graphical-models structure-learning by chechetka on 2007-04-29 19:58:53 as
	On Bayesian Network Approximation by Edge Deletion [My Copy] In Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence (2005) by Arthur Choi, Hei Chan, Adnan Darwiche posted to _cited-by-nips2007 graphical-models structure-learning by chechetka on 2007-04-29 19:55:55 as along with 1 person pcarbo
	Thin Junction Trees [My Copy] In Advances in Neural Information Processing Systems (2002) by Francis R. Bach, Michael I. Jordan posted to _cited-by-nips2007 graphical-models junction-trees markov-networks structure-learning by chechetka on 2007-04-29 19:51:11 as
	Being Bayesian About Network Structure. A Bayesian Approach to Structure Discovery in Bayesian Networks [My Copy] Machine Learning Journal, Vol. V50, No. 1. (1 January 2003), pp. 95-125. by Nir Friedman, Daphne Koller posted to _cited-by-nips2007 graphical-models structure-learning by chechetka on 2007-04-29 06:30:02 as along with 5 people and 1 group garyfeng Borelli wnpx quianominorleo naegele ReadingLab
	Probabilistic Networks and Expert Systems (Information Science and Statistics) [My Copy] (20 May 2003) by Robert G. Cowell, Philip A. Dawid, Steffen L. Lauritzen, David J. Spiegelhalter posted to _cited-by-nips2007 by chechetka on 2007-04-27 20:04:56 as along with 3 people namunet wnpx naegele
	Learning Graphical Models Over Partial k-Trees [My Copy] No. UWEETR-2004-0009. (2004) by Mukund Narasimhan, Jeff Bilmes posted to _cited-by-nips2007 graphical-models junction-trees pac-learning structure-learning by chechetka on 2007-04-27 19:38:05 as
	Learning and Robust Learning of Product Distributions [My Copy] In ACM Conference on Computational Learning Theory (1993) by Klaus U. Höffgen posted to _cited-by-nips2007 entropy-estimation by chechetka on 2007-04-27 19:38:05 as
	PAC-learning bounded tree-width graphical models [My Copy] In Proceedings of the 20th conference on Uncertainty in artificial intelligence (2004), pp. 410-417. by Mukund Narasimhan, Jeff Bilmes posted to _cited-by-nips2007 graphical-models junction-trees markov-networks structure-learning by chechetka on 2007-04-26 05:58:03 as along with 1 person roys

Note: You may cite this page as: http://www.citeulike.org/user/chechetka

_cited-by-nips2007	22
graphical-models	16
structure-learning	14
bayes-networks	5
markov-networks	5
hardness	3
junction-trees	3
submodularity	2
entropy-estimation	1
optimization	1
factor-graphs	1
pac-learning	1

chechetka's library 22 articles Export

chechetka's tags