Research on string similarity algorithm based on Levenshtein Distance

S Zhang, Y Hu, G Bian - 2017 IEEE 2nd Advanced Information …, 2017 - ieeexplore.ieee.org
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 …

Intelligent trademark similarity analysis of image, spelling, and phonetic features using machine learning methodologies

CV Trappey, AJC Trappey, SCC Lin - Advanced Engineering Informatics, 2020 - Elsevier
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 …

Prognosis of clinical outcomes with temporal patterns and experiences with one class feature selection

R Moskovitch, H Choi, G Hripcsak… - … /ACM transactions on …, 2016 - ieeexplore.ieee.org
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 …

Mining frequent and top-k high utility time interval-based events with duration patterns

JW Huang, BP Jaysawal, KY Chen, YB Wu - Knowledge and Information …, 2019 - Springer
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 …

On searching and indexing sequences of temporal intervals

O Kostakis, P Papapetrou - Data mining and knowledge discovery, 2017 - Springer
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 …

Subsequence search in event-interval sequences

OK Kostakis, AG Gionis - Proceedings of the 38th International ACM …, 2015 - dl.acm.org
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 …

On mining temporal patterns in dynamic graphs, and other unrelated problems

O Kostakis, A Gionis - Complex Networks & Their Applications VI …, 2018 - Springer
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 …

Abide: querying time-evolving sequences of temporal intervals

O Kostakis, P Papapetrou - Advances in Intelligent Data Analysis XVI: 16th …, 2017 - Springer
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 …

Subsequence search considering duration and relations of events in time interval-based events sequences

CW Yang, BP Jaysawal… - 2017 IEEE International …, 2017 - ieeexplore.ieee.org
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 …

[PDF][PDF] Facts and Figures 2011

E Bingham - 2012 - 128.214.112.31
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 …