GraphTS: Graph-represented time series for subsequence anomaly detection
Automatic detection of subsequence anomalies (ie, an abnormal waveform denoted by a
sequence of data points) in time series is critical in a wide variety of domains. However, most …
sequence of data points) in time series is critical in a wide variety of domains. However, most …
Sentiment analysis of semantically interoperable social media platforms using computational intelligence techniques
Competitive intelligence in social media analytics has significantly influenced behavioral
finance worldwide in recent years; it is continuously emerging with a high growth rate of …
finance worldwide in recent years; it is continuously emerging with a high growth rate of …
On the Complexity of 2-club Cluster Editing with Vertex Splitting
FN Abu-Khzam, T Davot, L Isenmann… - arXiv preprint arXiv …, 2024 - arxiv.org
Editing a graph to obtain a disjoint union of s-clubs is one of the models for correlation
clustering, which seeks a partition of the vertex set of a graph so that elements of each …
clustering, which seeks a partition of the vertex set of a graph so that elements of each …
Graph embedding: A methodological survey
Embedding a high dimensional combinatorial object like tokens in text or nodes in graphs
into a lower dimensional Euclidean space is a form of (lossy) data compression. We will …
into a lower dimensional Euclidean space is a form of (lossy) data compression. We will …
Correlation Clustering with Overlap: a Heuristic Graph Editing Approach
FN Abu-Khzam, L Isenmann, S Thoumi - arXiv preprint arXiv:2412.02704, 2024 - arxiv.org
Correlation clustering seeks a partition of the vertex set of a given graph/network into groups
of closely related, or just close enough, vertices so that elements of different groups are not …
of closely related, or just close enough, vertices so that elements of different groups are not …
[HTML][HTML] (1, 1)-Cluster Editing is polynomial-time solvable
A graph H is a clique graph if H is a vertex-disjoin union of cliques. Abu-Khzam (2017)
introduced the (a, d)-Cluster Editing problem, where for fixed natural numbers a, d, given a …
introduced the (a, d)-Cluster Editing problem, where for fixed natural numbers a, d, given a …
(1, 1)-Cluster Editing is Polynomial-time Solvable
A graph $ H $ is a clique graph if $ H $ is a vertex-disjoin union of cliques. Abu-Khzam
(2017) introduced the $(a, d) $-{Cluster Editing} problem, where for fixed natural numbers …
(2017) introduced the $(a, d) $-{Cluster Editing} problem, where for fixed natural numbers …