Concurrent Detection of Condense Anomalous Subgraphs in Large Social Networks

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Shahossein M.; MAHABADI A.A.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ELECTRONIC AND CYBER DEFENCE Year:2021 | Volume:9 | Issue:2 Page(s): 179-194

Download Full-Text

Persian Verion

View:

Download:

Cites:

Information Journal Paper

Title

Concurrent Detection of Condense Anomalous Subgraphs in Large Social Networks

Author(s)

Shahossein M. | MAHABADI A.A. | Issue Writer Certificate

Keywords

Anomaly DetectionQ4

Anomalous SubgraphsQ4

Signal ProcessingQ4

Compressive SensingQ4

Graph TheoryQ4

Abstract

This paper presents a new approach to the detection of asymptomatic anomalies based on the Signal Processing related to local information of graph that simultaneously detects small compact Anomalous Subgraphs in the unknown graphs of large social networks. It also introduces a novell sampling algorithm based on Compressive Sensing to retrieve the sparse properties of static networks, which aims to improve the accuracy of Anomaly Detection while reducing the complexity of data sampling. The results of experimental experiments with artificial random and real datasets of social networks in comparison with the state-of-the-art methods showed that the proposed approach, in addition to having the accuracy of simultaneous detection of anomalous compact subgraphs, the computational complexity reduced from O(n^4 √(log⁡n )) to O(n^2) in the n node networks and is easily applicable in complex dynamic networks.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops