| Document Date: 2006-05-23 00:36:59
Open Document File Size: 131,31 KBShare Result on Facebook
City Ordering / / Company Bayesian Networks / MIT Press / Cambridge U. Press / / Country Jordan / / Currency pence / / / Facility Computing Science University of Alberta / / IndustryTerm bj jb ner solution / feasible search / heuristic greedy search / greedy heuristic search techniques / satisfactory solution / variable networks / greedy search / greedy search algorithms / polynomial time algorithm / greedy search methods / structure search procedures / genetic algorithms / heuristic algorithms / greedy search techniques / convex relaxation algorithm / structure search / maximum likelihood solution / search problem / combinatorial search / line search / greedy local search / empty network / belief networks / order optimization algorithm / greedy heuristic search / search algorithm / search operator / probabilistic networks / relaxed ordering search / greedy heuristic search procedures / primal solution / learning algorithms / / Organization MIT / UC Berkeley / Approximate Ordering Yuhong Guo and Dale Schuurmans Department / University of Alberta / Computational Intelligence / / Person Van Allen / Dale Schuurmans / Morgan Kaufmann / / Position D. Fisher / / PublishedMedium Machine Learning / Journal of Machine Learning Research / / Technology order optimization algorithm / greedy search algorithms / polynomial time algorithm / learning algorithms / convex relaxation algorithm / proposed algorithms / Machine Learning / K2 search algorithm / K2 algorithm / /
SocialTag |
Convex Structure Learning for Bayesian Networks: Polynomial Feature Selection and Approximate Ordering Yuhong Guo and Dale Schuurmans Department of Computing Science University of Alberta