scispace - formally typeset
Journal ArticleDOI

Context Based Positive and Negative Spatio-Temporal Association Rule Mining

Reads0
Chats0
TLDR
An approach to spatial association rule mining from datasets projected at a temporal bar in which the contextual situation is considered while generating positive and negative frequent itemsets and the numerical evaluation shows that the algorithm is more efficient at generating specific, reliable and robust information than traditional algorithms.
Abstract
This paper proposes a new approach to mine context based positive and negative spatial association rules as they might be applied to hydrocarbon prospection. Many researchers are currently using an Apriori algorithm on spatial databases but this algorithm does not utilize the strengths of positive and negative association rules and of time series analysis, hence it misses the discovery of very interesting and useful associations present in the data. In dense spatial databases, the number of negative association rules is much higher compared to the positive rules which need exploitation. Using positive and negative association rule discovery and then pruning out the uninteresting rules consumes resources without much improvement in the overall accuracy of the knowledge discovery process. The associations among different objects and lattices are strongly dependent upon the context, particularly where context is the state of entity, environment or action. We propose an approach to spatial association rule mining from datasets projected at a temporal bar in which the contextual situation is considered while generating positive and negative frequent itemsets. An extended algorithm based on the Apriori approach is developed and compared with existing spatial association rule algorithms. The algorithm for positive and negative association rule mining is based on Apriori algorithm which is further extended to include context variable and simulate temporal series spatial inputs. The numerical evaluation shows that our algorithm is more efficient at generating specific, reliable and robust information than traditional algorithms.

read more

Citations
More filters
Journal ArticleDOI

A smart TV system with body-gesture control, tag-based rating and context-aware recommendation

TL;DR: A body control system is designed that recognizes and interprets human gestures as machine commands to control the TV and a new social tag-based method is created to recommend the most suitable multimedia contents for users.
Journal ArticleDOI

Mining association rules in big data with NGEP

TL;DR: NGEP divides individuals to several niches to evolve separately and fuses selected niches according to the similarities of the best individuals to ensure the dispersibility of chromosomes, and adjusts the fitness function to adapt to the needs of the underlying applications.
Journal ArticleDOI

A method of data mining for selection of site for wind turbines

TL;DR: A data mining framework which will help in selection of suitable site for wind turbine installation and the prediction of the model developed for the wind energy site has been found to be significantly accurate when compared with expert opinion and previous studies.
Journal ArticleDOI

A New Methodology for Mining Frequent Itemsets on Temporal Data

TL;DR: This paper proposes a new algorithm to restrict time intervals, called frequent itemset mining with time cubes, which is developed by extending the well-known a priori algorithm to handle time hierarchies.
Journal ArticleDOI

A spatiotemporal mining framework for abnormal association patterns in marine environments with a time series of remote sensing images

TL;DR: A spatiotemporal mining framework for abnormal association patterns in marine environments, including pixel-based and object-based mining models is outlined, and results prove the effectiveness and the efficiency of the proposed mining framework.
References
More filters
Proceedings ArticleDOI

Mining association rules between sets of items in large databases

TL;DR: An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
Proceedings Article

Fast algorithms for mining association rules

TL;DR: Two new algorithms for solving thii problem that are fundamentally different from the known algorithms are presented and empirical evaluation shows that these algorithms outperform theknown algorithms by factors ranging from three for small problems to more than an order of magnitude for large problems.
Book

Computational Geometry: Algorithms and Applications

TL;DR: In this article, an introduction to computational geometry focusing on algorithms is presented, which is related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems.
Journal ArticleDOI

Mining generalized association rules

TL;DR: A new interest-measure for rules which uses the information in the taxonomy is presented, and given a user-specified “minimum-interest-level”, this measure prunes a large number of redundant rules.
Related Papers (5)