Ιδρυματικό Αποθετήριο
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/55476F57-08D3-4A61-BDA0-DC0CCAC78CCB | - |
| Αναγνωριστικό | http://dl.acm.org/citation.cfm?id=2074039 | - |
| Γλώσσα | en | - |
| Μέγεθος | 8 pages | en |
| Τίτλος | Efficient stepwise selection in decomposable models | en |
| Δημιουργός | Deshpande Amol | en |
| Δημιουργός | Garofalakis Minos | en |
| Δημιουργός | Γαροφαλακης Μινως | el |
| Δημιουργός | Jordan Michael I. | en |
| Εκδότης | Association for Computing Machinery | en |
| Περίληψη | 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 Publication | en |
| Άδεια Χρήσης | http://creativecommons.org/licenses/by/4.0/ | en |
| Ημερομηνία | 2015-12-01 | - |
| Ημερομηνία Δημοσίευσης | 2001 | - |
| Θεματική Κατηγορία | Databases | en |
| Βιβλιογραφική Αναφορά | 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
