The Semantic Adjacency Criterion in Time Intervals Mining
We propose a new pruning constraint when mining frequent temporal patterns to be used as classification and prediction features, the <i>Semantic Adjacency Criterion [SAC]</i>, which filters out temporal patterns that contain potentially semantically contradictory components, exploiting e...
Main Authors: | Alexander Shknevsky, Yuval Shahar, Robert Moskovitch |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-11-01
|
Series: | Big Data and Cognitive Computing |
Subjects: | |
Online Access: | https://www.mdpi.com/2504-2289/7/4/173 |
Similar Items
-
<italic>k</italic>-PFPMiner: Top-k Periodic Frequent Patterns in Big Temporal Databases
by: Palla Likhitha, et al.
Published: (2023-01-01) -
Efficient Frequent Chronicle Mining Algorithms: Application to Sleep Disorder
by: Hareth Zmezm, et al.
Published: (2024-01-01) -
An Efficient Temporal Inter-Object Association Rule Mining Algorithm on Time Series
by: Nguyen Thanh Vu, et al.
Published: (2022-11-01) -
A Distributed Algorithm for Fast Mining Frequent Patterns in Limited and Varying Network Bandwidth Environments
by: Chun-Cheng Lin, et al.
Published: (2019-05-01) -
Algorithms for Extracting Frequent Episodes in the Process of Temporal Data Mining
by: Alexandru PIRJAN
Published: (2010-01-01)