The application of string similarity is very extensive, and the algorithm based on Levenshtein
Distance is particularly classic, but it is still insufficient in the aspect of universal applicability …

The rapid development of consumer products with short life spans, along with fast, global e-
commerce and e-marketing distribution of products and services requires greater due …

Traditional frequent sequential pattern mining only considers the time point-based item or
event in the patterns. However, in many application, the events may span over multiple time …

Accurate prognosis of outcome events, such as clinical procedures or disease diagnosis, is
central in medicine. The emergence of longitudinal clinical data, like the Electronic Health …

In several application domains, including sign language, sensor networks, and medicine,
events are not necessarily instantaneous but they may have a time duration. Such events …

We study the problem of subsequence search in databases of event-interval sequences, or
e-sequences. In contrast to sequences of instantaneous events, e-sequences contain events …

We study the problem of online similarity search in sequences of temporal intervals; given a
standing query and a time-evolving sequence of event-intervals, we want to assess the …

Given a social network with dynamic interactions, how can we discover frequent interactions
between groups of entities? What are the temporal patterns exhibited by these interactions …

Previous works of subsequence search in time interval-based events sequences have
focused on the relations among events without considering the duration of each event …

We first list the funding sources and the distribution of expenses of each site separately. One
should note that comparison between different years or between universities is not always …