2021
DOI: 10.1109/tsmc.2019.2899398
|View full text |Cite
|
Sign up to set email alerts
|

Learning Graph Similarity With Large Spectral Gap

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 16 publications
(7 citation statements)
references
References 53 publications
0
7
0
Order By: Relevance
“…K-Means and spectral clustering with normalized cut (Ncut) are chosen for the baseline. In addition, classical sparse subspace clustering (SSC) [21] and four related algorithms in recent years are adopted for further analysis, including RSEC [22], FastESC [23], USENC [24] and JSPC [25]. We choose four general performance indicators to evaluate the effect, including accuracy (ACC), normalized mutual information (NMI), adjusted rand index (ARI) and F-measure (F).…”
Section: Comparison Methodsmentioning
confidence: 99%
“…K-Means and spectral clustering with normalized cut (Ncut) are chosen for the baseline. In addition, classical sparse subspace clustering (SSC) [21] and four related algorithms in recent years are adopted for further analysis, including RSEC [22], FastESC [23], USENC [24] and JSPC [25]. We choose four general performance indicators to evaluate the effect, including accuracy (ACC), normalized mutual information (NMI), adjusted rand index (ARI) and F-measure (F).…”
Section: Comparison Methodsmentioning
confidence: 99%
“…Machine learning-based IDPS are particularly effective in evolving threat landscapes, as they can learn from new data and adapt their detection strategies accordingly, enhancing their ability to identify and mitigate threats before they can cause significant harm. This proactive approach not only improves the accuracy of threat detection but also reduces the response time, allowing organizations to address vulnerabilities and mitigate attacks more swiftly and effectively (Wu et al, 2021). By integrating advanced IDPS into their cybersecurity framework, organizations can significantly enhance their defense mechanisms, ensuring a more secure and resilient network environment.…”
Section: Intrusion Detection and Prevention Systems (Idps)mentioning
confidence: 99%
“…Data Loss Prevention (DLP) solutions are crucial for safeguarding sensitive information by preventing unauthorized data exfiltration through continuous monitoring and control of data transfers. These solutions are designed to detect, monitor, and block the unauthorized transmission of sensitive data, thereby mitigating the risk of data breaches (Wu et al, 2021). Content-aware DLP systems enhance this capability by analyzing data content in real-time to identify sensitive information, such as personal identifiable information (PII), financial records, or intellectual property.…”
Section: Data Loss Prevention (Dlp)mentioning
confidence: 99%
“…Another well-known theory is spectral analysis, which builds a graph with data points as nodes and similarities between points as edges, and then studies the eigenvalues of the normalized graph Laplacian matrix [29]. The graph cut theory suggests that small eigenvalues of the Laplacian matrix reflect weak connections of components, and a large eigen gap indicates a proper cluster number [30]. The advantages of spectral clustering include the detection of various cluster shapes, utilization of kernel functions, and cluster number estimation [29].…”
Section: B Automatic Clustering Algorithmsmentioning
confidence: 99%