Specification Mining over Temporal Data †

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Current specification mining algorithms for temporal data rely on exhaustive search approaches, which become detrimental in real data settings where a plethora of distinct temporal behaviours are recorded over prolonged observations. This paper proposes a novel algorithm, Bolt2, based on a refined heuristic search of our previous algorithm, Bolt. Our experiments show that the proposed approach not only surpasses exhaustive search methods in terms of running time but also guarantees a minimal description that captures the overall temporal behaviour. This is achieved through a hypothesis lattice search that exploits support metrics. Our novel specification mining algorithm also outperforms the results achieved in our previous contribution.

References Powered by Scopus

Mining frequent patterns without candidate generation: A frequent-pattern tree approach

2216Citations
N/AReaders
Get full text

DECLARE: Full support for loosely-structured processes

545Citations
N/AReaders
Get full text

Sequel: A struciured english query language

349Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Streamlining Temporal Formal Verification over Columnar Databases

1Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Bergami, G., Appleby, S., & Morgan, G. (2023). Specification Mining over Temporal Data †. Computers, 12(9). https://doi.org/10.3390/computers12090185

Readers' Seniority

Tooltip

Professor / Associate Prof. 1

33%

PhD / Post grad / Masters / Doc 1

33%

Researcher 1

33%

Readers' Discipline

Tooltip

Computer Science 1

33%

Engineering 1

33%

Earth and Planetary Sciences 1

33%

Article Metrics

Tooltip
Mentions
News Mentions: 1

Save time finding and organizing research with Mendeley

Sign up for free