Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Dynamic time warping distance for message propagation classification in Twitter (1701.07756v1)

Published 26 Jan 2017 in cs.AI, cs.SI, and stat.ML

Abstract: Social messages classification is a research domain that has attracted the attention of many researchers in these last years. Indeed, the social message is different from ordinary text because it has some special characteristics like its shortness. Then the development of new approaches for the processing of the social message is now essential to make its classification more efficient. In this paper, we are mainly interested in the classification of social messages based on their spreading on online social networks (OSN). We proposed a new distance metric based on the Dynamic Time Warping distance and we use it with the probabilistic and the evidential k Nearest Neighbors (k-NN) classifiers to classify propagation networks (PrNets) of messages. The propagation network is a directed acyclic graph (DAG) that is used to record propagation traces of the message, the traversed links and their types. We tested the proposed metric with the chosen k-NN classifiers on real world propagation traces that were collected from Twitter social network and we got good classification accuracies.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Siwar Jendoubi (9 papers)
  2. Arnaud Martin (64 papers)
  3. Ludovic LiƩtard (4 papers)
  4. Boutheina Ben Yaghlane (11 papers)
  5. Hend Ben Hadji (1 paper)
Citations (10)

Summary

We haven't generated a summary for this paper yet.