Use of Visibility Graphs for the Early Detection of DoS Attacks

Lopes, João; Pinto, Pedro; Partida, Alberto; Pinto, António

doi:10.1109/csr61664.2024.10679430

2024 IEEE International Conference on Cyber Security and Resilience (CSR) 2024

DOI: 10.1109/csr61664.2024.10679430

|View full text |Cite

Use of Visibility Graphs for the Early Detection of DoS Attacks

João Lopes,

Pedro Pinto,

Alberto Partida

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

The advantages of k-visibility: A comparative analysis of several time series clustering algorithms

Iglesias-Perez,

Partida,

Criado

2024

MATH

View full text Add to dashboard Cite

<p>This paper outlined the advantages of the k-visibility algorithm proposed in <sup>[<xref ref-type="bibr" rid="b1">1</xref>,<xref ref-type="bibr" rid="b2">2</xref>]</sup> compared to traditional time series clustering algorithms, highlighting enhanced computational efficiency and comparable clustering quality. This method leveraged visibility graphs, transforming time series into graph structures where data points were represented as nodes, and edges are established based on visibility criteria. It employed the traditional k-means clustering method to cluster the time series. This approach was particularly efficient for long time series and demonstrated superior performance compared to existing clustering methods. The structural properties of visibility graphs provided a robust foundation for clustering, effectively capturing both local and global patterns within the data. In this paper, we have compared the k-visibility algorithm with 4 algorithms frequently used in time series clustering and compared the results in terms of accuracy and computational time. To validate the results, we have selected 15 datasets from the prestigious UCR (University of California, Riverside) archive in order to make a homogeneous validation. The result of this comparison concluded that k-visibility was always the fastest algorithm and that it was one of the most accurate in matching the clustering proposed by the UCR archive.</p>

show abstract

The advantages of k-visibility: A comparative analysis of several time series clustering algorithms

Iglesias-Perez,

Partida,

Criado

2024

MATH

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Use of Visibility Graphs for the Early Detection of DoS Attacks

Cited by 1 publication

References 23 publications

The advantages of k-visibility: A comparative analysis of several time series clustering algorithms

The advantages of k-visibility: A comparative analysis of several time series clustering algorithms

Contact Info

Product

Resources

About