Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Santhosh B. Gandreti

dblp:337/1040 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0000-0003-1009-9254ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Theoretical computer science
1 paper
Information theory · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › pattern mining › sequential pattern mining
episode mining
1.012026
Non-overlapped Frequency based Episode Significance under Markov Null Models · KDD (1) 2026
Data mining
pattern mining
1.012026
Non-overlapped Frequency based Episode Significance under Markov Null Models · KDD (1) 2026
Information theory
hypothesis testing
1.012026
Non-overlapped Frequency based Episode Significance under Markov Null Models · KDD (1) 2026
Data mining
temporal data mining
0.312026
Non-overlapped Frequency based Episode Significance under Markov Null Models · KDD (1) 2026

Methods — techniques the papers use, named apart from their topics

markov model · 2.0hypothesis testing · 2.0
YearPublicationVenuePosition
2026 Non-overlapped Frequency based Episode Significance under Markov Null Models
abstract
Frequent episode mining is a popular method for discovering temporal dependencies in symbolic time series data. In frequent pattern mining, it is important to assess statistical significance of discovered patterns so as to be able to discard unimportant patterns. In the literature, statistical significance is assessed through a hypothesis testing framework where the null hypothesis models data with no important patterns. Most currently available methods for frequent episode mining can handle only an iid null hypothesis. Since the data is a time series, it is desirable to deal with a null hypothesis that also allows for simple temporal dependencies. In this paper we present a method to characterize the distribution of non-overlapped occurrences of an episode and hence to assess its significance under a Markovian null hypothesis. This is the first such result. We illustrate the effectiveness of the method through simulations.
Avinash Achar, Santhosh B. Gandreti, P. S. Sastry 0001
KDD (1)2