Konstantinos F. Xylogiannopoulos

Learn More
Suffix array is a powerful data structure, used mainly for pattern detection in strings. The main disadvantage of a full suffix array is its quadratic O(n 2 ) space capacity when the actual suffixes are needed. In our previous work [39], we introduced the innovative All Repeated Patterns Detection (ARPaD) algorithm and the Moving Longest Expected Repeated(More)
Suffix arrays form a powerful data structure for pattern detection and matching. In a previous work, we presented a novel algorithm (COV) which is the only algorithm that allows the detection of all repeated patterns in a time series by using the actual suffix array. However, the requirements for storing the actual suffix strings even on external media(More)
Frequent pattern mining and consequently association rule mining is a useful technique for discovering relationships between items in databases. However, as the size of the data to be analyzed increases or the values of the pruning thresholds decrease, larger number of frequent pattern and more association rules will be generated with little information(More)
This paper discusses the practices employed by various terrorist groups that operated in European countries between the years of 1968 and 2009. We focus on the deployment of the terrorist operations as presented in the RAND Database of Worldwide Terrorism Activities. In this context we elaborate on the tactics of the terrorist groups with the highest(More)
Sequential frequent itemsets detection is one of the core problems in data mining. In the current paper we propose a new methodology based on our previous work regarding the detection of all repeated patterns in a string. By analyzing big datasets from FIMI website of up to one million transactions we were able to detect not only the most frequent(More)