Dear guest, welcome to this publication database. As an anonymous user, you will probably not have edit rights. Also, the collapse status of the topic tree will not be persistent. If you like to have these and other options enabled, you might ask Pascal Held for a login account.
| This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit www.aigaion.nl. |
|
Predicting Future Decision Trees from Evolving Data
| Type of publication: | Inproceedings |
| Citation: | boettcher2008icdm |
| Booktitle: | Proceedings of ICDM '08 |
| Year: | 2008 |
| Month: | December |
| Pages: | 33--42 |
| Publisher: | IEEE Computer Society |
| Location: | Pisa, Italy |
| ISBN: | 978-0-7695-3502-9 |
| DOI: | 10.1109/icdm.2008.90 |
| Abstract: | Recognizing and analyzing change is an important human virtue because it enables us to anticipate future scenarios and thus allows us to act pro-actively. One approach to understand change within a domain is to analyze how modelsand patterns evolve. Knowing how a model changes over time is suggesting to ask: Can we use this knowledge to learn a model in anticipation, such that it better reflects the near-future characteristics of an evolving domain? In this paper we provide an answer to this question by presenting an algorithm which predicts future decision trees based ona model of change. In particular, this algorithm encompasses a novel approach to change mining which is based on analyzing the changes of the decisions made during model learning. The proposed approach can also be applied to other types of classifiers and thus provides a basis for future research. We present our first experimental results which show that anticipated decision trees have the potential to outperform trees learned on the most recent data. |
| Keywords: | |
| Authors | |
| Added by: | [ADM] |
| Total mark: | 0 |
|
Attachments
|
|
|
|
|
Notes
|
|
|
|
|
|
Topics
|
|
