DBScholar

Back to papers

Testing Complex Temporal Relationships Involving Multiple Granularities and Its Application to Data Mining

Summary: Defines event-structure temporal-constraint graphs with multiple granularities (TCGs), proves TCG consistency NP-hard and provides an approximation algorithm. Introduces timed automata with granularities (TAGs) to detect TCG instantiations in sequences for temporal-pattern mining. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1077
Venue
PODS
Year
1996
Pagerank
-
Overall Rank
14,212 | 2.50%
DOI
10.1145/237661.237680

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{bettini_pods96,
        address = {New York, NY, USA},
        series = {{PODS} '96},
        title = {{Testing Complex Temporal Relationships Involving Multiple Granularities and Its Application to Data Mining}},
        url = {https://dl.acm.org/doi/10.1145/237661.237680},
        doi = {10.1145/237661.237680},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Bettini, Claudio and Wang, X. Sean and Jajodia, Sushil},
        year = {1996}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers