Ιδρυματικό Αποθετήριο [SANDBOX]
Πολυτεχνείο Κρήτης
EN  |  EL

Αναζήτηση

Πλοήγηση

Ο Χώρος μου

Efficient stepwise selection in decomposable models

Deshpande Amol, Garofalakis Minos, Jordan Michael I.

Απλή Εγγραφή

URIhttp://purl.tuc.gr/dl/dias/55476F57-08D3-4A61-BDA0-DC0CCAC78CCB-
Αναγνωριστικόhttp://dl.acm.org/citation.cfm?id=2074039-
Γλώσσαen-
Μέγεθος8 pagesen
ΤίτλοςEfficient stepwise selection in decomposable modelsen
ΔημιουργόςDeshpande Amolen
ΔημιουργόςGarofalakis Minosen
ΔημιουργόςΓαροφαλακης Μινωςel
ΔημιουργόςJordan Michael I.en
ΕκδότηςAssociation for Computing Machineryen
ΠερίληψηIn this paper, we present an efficient algorithm for performing stepwise selection in the class of decomposable models. We focus on the forward selection procedure, but we also discuss how backward selection and the combination of the two can be performed efficiently. The main contributions of this paper are (1) a simple characterization for the edges that can be added to a decomposable model while retaining its decomposability and (2) an efficient algorithm for enumerating all such edges for a given decomposable model in O(n2) time, where n is the number of variables in the model. We also analyze the complexity of the overall stepwise selection procedure (which includes the complexity of enumerating eligible edges as well as the complexity of deciding how to “progress”). We use the KL divergence of the model from the saturated model as our metric, but the results we present here extend to many other metrics as well.en
ΤύποςΔημοσίευση σε Συνέδριοel
ΤύποςConference Publicationen
Άδεια Χρήσηςhttp://creativecommons.org/licenses/by/4.0/en
Ημερομηνία2015-12-01-
Ημερομηνία Δημοσίευσης2001-
Θεματική ΚατηγορίαDatabasesen
Βιβλιογραφική ΑναφοράA. Deshpande, M. Garofalakis and M. Jordan, "Efficient stepwise selection in decomposable models", in Seventeenth Conference on Uncertainty in Artificial Intelligence, August 2001.en

Υπηρεσίες

Στατιστικά

 

Copyright © DIAS 2013