![Ιδρυματικό Αποθετήριο [SANDBOX]](images/dias.logo.png "Ιδρυματικό Αποθετήριο [SANDBOX]"){kind=logo}
Ιδρυματικό Αποθετήριο [SANDBOX]
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/E5637B98-8058-4BFF-A497-8DFF4672268E | - |
| Αναγνωριστικό | http://www.linghuang.org/research/ApproximateDecisions.pdf | - |
| Γλώσσα | en | - |
| Μέγεθος | 2 pages | en |
| Τίτλος | Approximate decision making in large-scale distributed systems | en |
| Δημιουργός | Huang Ling | en |
| Δημιουργός | Garofalakis Minos | en |
| Δημιουργός | Γαροφαλακης Μινως | el |
| Δημιουργός | Joseph Anthony | en |
| Δημιουργός | Taft Nina | en |
| Περίληψη | As the Internet has evolved into a valuable and critical service platform for business and daily life, the research community has enthusiastically applied data mining methods to improve application performance by analyzing and optimizing the behaviors of the underlying systems (e.g., datacenter design, network resource provisioning, network security, etc.) These data mining procedures often use large-scale widelydistributed monitoring systems, which continuously generate numerous distributed data streams, and backhaul all of the data to a central location (e.g., a Network Operation Center or NOC) for data analysis and decision making. This application scenario presents both new opportunities and challenges in efficient data analysis and online decision making, where a decision function depends on aggregating and analyzing continuous data streams from distributed monitors. The statistics and machine learning communities have performed extensive research into decision making methods [1], including outlier detection, clustering, classification, etc., with the results being algorithms that mainly assume all data have been collected at a central point, and focus on post-collection data analysis and problem diagnosis, with little consideration of the more general distributed, continuous data collection and analysis problem. We believe that the machine learning community should now focus on the design of algorithms that function well with limited data. We envision two open problems: efficiently performing online decision making with low communication overhead, and providing fine-grain control over the tradeoff between decision accuracy and communication overhead. Most existing research has focused on sampling techniques, however, the randomness in this type of sampling could discard key information needed by decision making algorithms. Instead, we advocate using smart filtering for data reduction, where the filtering is designed to carefully select which data to not ship. Specifically, the filtered data should be that which has minimal impact on decision making performance or its accuracy. | en |
| Τύπος | Δημοσίευση σε Συνέδριο | el |
| Τύπος | Conference Publication | en |
| Άδεια Χρήσης | http://creativecommons.org/licenses/by/4.0/ | en |
| Ημερομηνία | 2015-11-30 | - |
| Ημερομηνία Δημοσίευσης | 2007 | - |
| Θεματική Κατηγορία | Database management | en |
| Θεματική Κατηγορία | Information systems | en |
| Βιβλιογραφική Αναφορά | L. Huang, M. Garofalakis, A. Joseph and N. Taft, "Approximate decision making in large-scale distributed systems", in the Proceedings of MLSys'2007, December. | en |
Copyright © DIAS 2013
