-
Chapter and Conference Paper
Comparison of Squall Line Positioning Methods Using Radar Data
Squall lines are strong indicators of potential severe weather. Yet, automated positioning and tracking algorithms are not common. We propose three different ways to model and identify squall lines using radar...
-
Chapter and Conference Paper
Comparison of Squall Line Positioning Methods Using Radar Data
Squall lines are strong indicators of potential severe weather. Yet, automated positioning and tracking algorithms are not common. We propose three different ways to model and identify squall lines using radar...
-
Article
Efficient Algorithms for Mining and Incremental Update of Maximal Frequent Sequences
We study two problems: (1) mining frequent sequences from a transactional database, and (2) incremental update of frequent sequences when the underlying database changes over time. We review existing sequence ...
-
Chapter and Conference Paper
Tropical Cyclone Eye Fix Using Genetic Algorithm with Temporal Information
Tropical cyclones (TCs) are weather systems with vast destructive power. To give early TC warnings, accurate location of their circulation centers, or “eyes”, is required. The pattern matching solution to this...
-
Chapter and Conference Paper
Efficient and Effective Tropical Cyclone Eye Fix Using Genetic Algorithms
Weather forecasting often requires extensive computationally expensive numerical analysis on remote sensing data. For example, to determine the position of a tropical cyclone (the TC eye fix problem), computat...
-
Chapter and Conference Paper
FFS - An I/O-Efficient Algorithm for Mining Frequent Sequences
This paper studies the problem of mining frequent sequences in transactional databases. In [1], Agrawal and Srikant proposed the AprioriAll algorithm for extracting frequently occurring sequences. AprioriAll is a...
-
Chapter and Conference Paper
LGen — A Lattice-Based Candidate Set Generation Algorithm for I/O Efficient Association Rule Mining
Most algorithms for association rule mining are variants of the basic Apriori algorithm [2]. One characteristic of these Aprioribased algorithms is that candidate itemsets are generated in rounds, with the size o...