کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
532946 | 870027 | 2006 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Recovery of missing information in graph sequences by means of reference pattern matching and decision tree learning
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
چشم انداز کامپیوتر و تشخیص الگو
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Algorithms for the analysis of graph sequences are proposed in this paper. In particular, we study the problem of recovering missing information and predicting the occurrence of nodes and edges in time series of graphs. Two different recovery schemes are developed. The first scheme uses reference patterns that are extracted from a training set of graph sequences, while the second method is based on decision tree induction. Our work is motivated by applications in computer network analysis. However, the proposed recovery and prediction schemes are generic and can be applied in other domains as well.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Pattern Recognition - Volume 39, Issue 4, April 2006, Pages 573–586
Journal: Pattern Recognition - Volume 39, Issue 4, April 2006, Pages 573–586
نویسندگان
Horst Bunke, Peter Dickinson, Christophe Irniger, Miro Kraetzl,