Content-Structural Graph Clustering and a New Criterion for its Evaluation

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.

Rahmati K.; NADERI H.; KESHVARI S.

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

Journal Paper

Paper Information

Journal: Advanced Defense Science and Technology Year:2018 | Volume:9 | Issue:2 Page(s): 201-210

Download Full-Text

Persian Verion

View:

1,039

Download:

Cites:

Information Journal Paper

Title

Content-Structural Graph Clustering and a New Criterion for its Evaluation

Author(s)

Rahmati K. | NADERI H. | KESHVARI S. | Issue Writer Certificate

Keywords

ClusteringQ2

Content GraphQ1

Content-Structural ClusteringQ1

Content-Structural EvaluationQ1

Abstract

Today, with the spread of social networks, the opposition's efforts to chill out people from government (known as “ soft war” ) are increased. Therefore, dealing with this type of networks is important for military and security organizations. Graph Clustering is one of the first attempts toward analyzing social networks which can appropriately be modeled by a Content Graph. In contrast, most of the existing graph Clustering methods independently focused on one of the content or structural aspects of a graph. The aim of this paper (implemented as CS-Cluster algorithm) is to achieve well connected clusters while their nodes benefits from homogeneous attribute values (content). In the second step of our research, after an intensive search, no measure has found which could simultaneously consider content and structural features of Clustering algorithms. So to be able to appropriately evaluate our algorithm, a new content-structural measure (so-called “ CS-Measure” ) is proposed. Our experimentation shows that the proposed Clustering algorithm outperforms two other well-known content-structural Clustering algorithms, using the new content-structural, average similarity, and Error link measure as well as the previous content and structural measures, And it also performed relatively well in density measure.

Cites

No record.

References

No record.

Cite

APA: Copy

Rahmati, K., NADERI, H., & KESHVARI, S.. (2018). Content-Structural Graph Clustering and a New Criterion for its Evaluation. (JOURNAL OF ADVANCED DEFENCE SCIENCE AND TECHNOLOGY) JOURNAL OF PASSIVE DEFENCE SCIENCE AND TECHNOLOGY, 9(2 ), 201-210. SID. https://sid.ir/paper/167441/en

Vancouver: Copy

Rahmati K., NADERI H., KESHVARI S.. Content-Structural Graph Clustering and a New Criterion for its Evaluation. (JOURNAL OF ADVANCED DEFENCE SCIENCE AND TECHNOLOGY) JOURNAL OF PASSIVE DEFENCE SCIENCE AND TECHNOLOGY[Internet]. 2018;9(2 ):201-210. Available from: https://sid.ir/paper/167441/en

IEEE: Copy

K. Rahmati, H. NADERI, and S. KESHVARI, “Content-Structural Graph Clustering and a New Criterion for its Evaluation,” (JOURNAL OF ADVANCED DEFENCE SCIENCE AND TECHNOLOGY) JOURNAL OF PASSIVE DEFENCE SCIENCE AND TECHNOLOGY, vol. 9, no. 2 , pp. 201–210, 2018, [Online]. Available: https://sid.ir/paper/167441/en

Related Journal Papers