Complex event detection in stream is an important problem in event stream processing field. In this paper, we propose a new complex event detection algorithm in probabilistic stream, Instance Pruning and Filter-Detection Algorithm (IPF-DA). This algorithm is based on a kind of data structure called Chain Instance Queues (CIQ), to detect complex events satisfying query requirements with singlescanning probabilistic stream. In the process of complex event detection, IPF-DA prunes unnecessary event instances with query requirements and achieves filter for complex events with the given threshold. And it further improves the efficiency by setting proper tolerance, while insuring high recall. In addition, we construct Bayesian network to express and infer the probability distribution of uncertain events. Conditional Probability Indexing-Tree (CPI-Tree) is defined to store conditional probabilities of Bayesian network, saving query time compared with traditional Conditional Probability Table (CPT). Experimental results show that a series of strategies proposed by this paper are effective for complex event detection in probabilistic stream.
Given a set of spatial objects, facilities can influence the objects located within their influence regions that are represented by circular disks with the same radius r. Our task is to select the minimum number of locations such that establishing a temporary facility at each selected location would ensure that all the objects are influenced. Aiming to solve this location selection problem, we propose a novel kind of location selection query, called group location selection (GLS) queries. In many real-world applications, every object is usually located within an uncertainty region instead of at an exact point. Due to the uncertainty of the data, GLS processing needs to ensure that the probability of each uncertain object being influenced by one facility is not less than a given threshold . An analysis of the time cost reveals that it is infeasible to exactly answer GLS queries over uncertain objects in polynomial time. Hence, this paper proposes an approximate query framework for answering queries efficiently while guaranteeing that the results of GLS queries are correct with a bounded probability. The performance of the proposed methods of the framework is demonstrated by theoretical analysis and extensive experiments with both real and synthetic data sets.
It is important to choose good parameters in Support Vector Regression (SVR) modeling. Choosing different parameters will influence the accuracy of SVR models. This paper proposes a parameter choosing method of SVR models for time series prediction. In the light of data features of time series, the paper improves the traditional Cross-Validation method, and combines the improved Cross-Validation with ε-weighed SVR in order to get good parameters of models. The experiments show that the method is effective for time series prediction.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.