In this paper we introduce a novel method to perform topic detection in Twitter based on the
recent and novel technique of Joint Complexity. Instead of relying on words as most other …

In this paper we study joint sequence complexity and its applications for finding similarities
between sequences up to the discrimination of sources. The mathematical concept of the …

We propose a classification test to discriminate Markov sources based on the joint string
complexity. String complexity is defined as the cardinality of a set of all distinct words …

During the last decade, the information within Dynamic Social Networks has increased
dramatically. The ability to study the interaction and communication between users in these …

Algorithms are extremely important in science and engineering. One of the main objectives
of science is to predict future events; this usually requires sophisticated algorithms. Once we …

In many practical applications, it is useful to consider Kolmogorov complexity K (s) of a given
string s, ie, the shortest length of a program that generates this string. Since Kolmogorov …

Algorithms are extremely important in science and engineering. One of the main objectives
of science is to predict future events; this usually requires sophisticated algorithms. Once we …

String complexity is defined as the cardinality of a set of all distinct words (factors) of a given
string. For two strings, we introduce the joint string complexity as the cardinality of a set of …

3. I-Complexity• Limitation of K (s): a small change in s=(s1s2... sn) can lead to a drastic
change in K (s).• To overcome this limitation, V. Becher and PA Heiber proposed the …