Spatiotemporal Relational Probability Trees: An Introduction

Authors:
Amy McGovern;Nathan C. Hiers;Matthew Collier;David J. Gagne II;Rodger A. Brown
Affiliations:
-;-;-;-;-
Venue:
ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
Year:
2008

Citing 0
Cited 9

Tree induction over perennial objects

SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
Identifying predictive multi-dimensional time series motifs: an application to severe weather prediction

Data Mining and Knowledge Discovery
Classification rule mining for a stream of perennial objects

RuleML'2011 Proceedings of the 5th international conference on Rule-based reasoning, programming, and applications
Using trees to mine multirelational databases

Data Mining and Knowledge Discovery
Time-Evolving relational classification and ensemble methods

PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
Enhanced spatiotemporal relational probability trees and forests

Data Mining and Knowledge Discovery
Transforming graph data for statistical relational learning

Journal of Artificial Intelligence Research
GA-TVRC-Het: genetic algorithm enhanced time varying relational classifier for evolving heterogeneous networks

Data Mining and Knowledge Discovery
Enhancing understanding and improving prediction of severe weather through spatiotemporal relational learning

Machine Learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce spatiotemporal relational probability trees (SRPTs), probability estimation trees for relational data that can vary in both space and time. The SRPT algorithm addresses the exponential increase in search complexity through sampling. We validate the SRPT using a simulated data set and we empirically demonstrate the SRPT algorithm on two real-world data sets.