The DOI matches its Crossref record; 65 of the 65 references it cites were found in a registry or an index.
A survey of temporal knowledge discovery paradigms and methods
Abstract
With the increase in the size of data sets, data mining has recently become an important research topic and is receiving substantial interest from both academia and industry. At the same time, interest in temporal databases has been increasing and a growing number of both prototype and implemented systems are using an enhanced temporal understanding to explain aspects of behavior associated with the implicit time-varying nature of the universe. This paper investigates the confluence of these two areas, surveys the work to date, and explores the issues involved and the outstanding problems in temporal data mining.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907
Maintaining knowledge about temporal intervals
Allen, J. F. (1983) · Communications of the ACM · doi:10.1145/182.358434 · Cited by 7,593 · cited 2×
“Notable work includes that of Dean and McDermott [21], [22] who developed inter alia , a comprehensive system for reasoning about time, and Allen [16], Vilain [18], [23], and Freksa [17], who refined the temporal relationships used in much of the temporal data mining research.”
BackgroundAgrawal, R., & Srikant, R. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380415 · Cited by 5,155
Mining sequential patterns: Generalizations and performance improvements
Srikant, R., & Agrawal, R. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0014140 · Cited by 2,711
From data mining to knowledge discovery: an overview
Fayyad, U. M., Piatetsky-Shapiro, G., & Smyth, P. (1996) · Knowledge Discovery and Data Mining · Cited by 2,395
Efficient similarity search in sequence databases
Agrawal, R., Faloutsos, C., & Swami, A. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-57301-1_5 · Cited by 1,979
Fast subsequence matching in time-series databases
Faloutsos, C., Ranganathan, M., & Manolopoulos, Y. (1994) · Proceedings of the 1994 ACM SIGMOD international conference on Management of data · doi:10.1145/191839.191925 · Cited by 1,709
Beyond market baskets: generalizing association rules to correlations
Brin, S., Motwani, R., & Silverstein, C. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253327 · Cited by 1,281
Bayesian classification (AutoClass): theory and results
Cheeseman, P. C., & Stutz, J. (1996) · Cited by 975
Maintenance of discovered association rules in large databases: an incremental updating technique
Cheung, D. W., Han, J., Ng, V. T., & Wong, C. Y. (2002) · Proceedings of the Twelfth International Conference on Data Engineering · doi:10.1109/icde.1996.492094 · Cited by 800
Cited by
Clustering of time series data—a survey
Warren Liao, T. (2005) · Pattern Recognition · doi:10.1016/j.patcog.2005.01.025 · Cited by 2,401
Clustering of time-series subsequences is meaningless: implications for previous and future research
Keogh, E., & Lin, J. (2005) · Knowledge and Information Systems · doi:10.1007/s10115-004-0172-7 · Cited by 464
Keeping the Resident in the Loop: Adapting the Smart Home to the User
Rashidi, P., & Cook, D. J. (2009) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2009.2025137 · Cited by 443
Visualizing time-oriented data—A systematic view
Aigner, W., Miksch, S., Müller, W., Schumann, H., & Tominski, C. (2007) · Computers & Graphics · doi:10.1016/j.cag.2007.01.030 · Cited by 330
A survey of interestingness measures for knowledge discovery
MCGARRY, K. (2005) · The Knowledge Engineering Review · doi:10.1017/s0269888905000408 · Cited by 318
Metadata
- Authors
- Roddick, J. F., & Spiliopoulou, M.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2002-07
- Volume
- 14
- Issue
- 4
- Pages
- 750-767
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2122354896
- Cited by
- 397
- References
- 65
- FWCI
- 51.86
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.