Dimitrios P. Papamichail

Learn More
This paper describes the k-means range algorithm, a combination of the partitional k-means clustering algorithm with a well known spatial data structure, namely the range tree, which allows fast range searches. It offers a real-time solution for the development of distributed interactive decision aids in e-commerce since it allows the consumer to model his(More)
BACKGROUND The problem of approximate string matching is important in many different areas such as computational biology, text processing and pattern recognition. A great effort has been made to design efficient algorithms addressing several variants of the problem, including comparison of two strings, approximate pattern identification in a string or(More)
Web educational resources integrating interactive simulation tools provide students with an in-depth understanding of the medical imaging process. The aim of this work was the development of a purely Web-based, open access, interactive application, as an ancillary learning tool in graduate and postgraduate medical imaging education, including a systematic(More)
This paper presents a personalized approach for distributed trust management by employing the k-means range algorithm, a combination of the partitional k-means clustering algorithm with orthogonal range search concepts. The aim of this approach is to aid the human or computer agent in organizing information from multiple sources into clusters according to(More)
  • 1