Discovering calendar-based temporal association rules
Data & Knowledge Engineering - Special issue: Temporal representation and reasoning
Efficient Partial Multiple Periodic Patterns Mining without Redundant Rules
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Market basket analysis in a multiple store environment
Decision Support Systems
Periodic association mining in a geospatial decision support system
dg.o '06 Proceedings of the 2006 international conference on Digital government research
Constraint-based sequential pattern mining: the consideration of recency and compactness
Decision Support Systems
Data & Knowledge Engineering
A novel approach for discovering retail knowledge with price information from transaction databases
Expert Systems with Applications: An International Journal
A smart calendar application for mobile environments
Proceedings of the 3rd international conference on Mobile multimedia communications
Mining Temporal Association Patterns under a Similarity Constraint
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
A traceability link mining approach for identifying insider threats
Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies
Supporting temporal reasoning by mapping calendar expressions to minimal periodic sets
Journal of Artificial Intelligence Research
Visualizing and fuzzy filtering for discovering temporal trajectories of association rules
Journal of Computer and System Sciences
Mining sequential patterns in the B2B environment
Journal of Information Science
Mining balanced patterns in web access data
AIA '08 Proceedings of the 26th IASTED International Conference on Artificial Intelligence and Applications
An efficient algorithm for incremental mining of temporal association rules
Data & Knowledge Engineering
Efficient temporal pattern mining for humanoid robot
Proceedings of the 1st Amrita ACM-W Celebration on Women in Computing in India
Finding locally and periodically frequent sets and periodic association rules
PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
Discovering richer temporal association rules from interval-based data
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Discovery of temporal frequent patterns using TFP-Tree
WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
Building the data warehouse of frequent itemsets in the DWFIST approach
ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
Mining time-profiled associations: an extended abstract
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
A parallel algorithm for mining multiple partial periodic patterns
Information Sciences: an International Journal
DWFIST: leveraging calendar-based pattern mining in data streams
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
| Hi-index | 0.00 |
A temporal association rule is an association rule that holds during specific time intervals. An example is that eggs and coffee are frequently sold together in morning hours. This paper studies temporal association rules during the time intervals specified by user-given calendar schemas. Generally, the use of calendar schemas makes the discovered temporal association rules easier to understand. An example of calendar schema is (year, month, day), which yields a set of calendar-based patterns of the form , where each di is either an integer or the symbol *. For example, is such a pattern, which corresponds to the time intervals, each consisting of the 16th day of a month in year 2000. This paper defines two types of temporal association rules: precise-match association rules that require the association rule hold during every interval, and fuzzy-match ones that require the association rule hold during most of these intervals. The paper extends the well-known Apriori algorithm, and also develops two optimization techniques to take advantage of the special properties of the calendar-based patterns. The experiments show that the algorithms and optimization techniques are effective.