Abstract
We propose a new representation of calendars such that users can specify fuzzy calendar constraints to discover asynchronous periodical association rules embedded in temporal databases. We borrow the fuzzy set theory and use the conjunction operation to construct fuzzy calendar patterns and each fuzzy calendar pattern represents an asynchronous periodical behavior. Moreover, different time intervals have different weights corresponding to their matching degrees to the specified fuzzy calendar pattern. An efficient algorithm is also proposed to find association rules with the specified fuzzy calendar pattern. Unlike levelwise Apriori-based approaches, our method scans the underlying database at most twice. In the first scan, frequent 2-itemsets with their weighted counts in the specified fuzzy calendar pattern are obtained and then all candidate itemsets are generated from the discovered frequent 2-itemsets. Finally, all frequent itemsets with their weighted counts in the specified fuzzy calendar pattern are discovered in one shot. Asynchronous periodical association rules in the specified fuzzy calendar pattern are then obtained.
| Original language | English |
|---|---|
| Pages (from-to) | 773-778 |
| Number of pages | 6 |
| Journal | IEEE International Conference on Fuzzy Systems |
| Publication status | Published - 2005 |
| Event | IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2005 - Reno, NV, United States Duration: 2005 May 22 → 2005 May 25 |
All Science Journal Classification (ASJC) codes
- Software
- Theoretical Computer Science
- Artificial Intelligence
- Applied Mathematics