An Incremental Solution for Content-Structural Graph Clustering

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.

KESHVARI S.; JAVADZADEH M.A.; NADERI H.

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

Journal Paper

Paper Information

Journal: Advanced Defense Science and Technology Year:2020 | Volume:11 | Issue:1 Page(s): 107-121

Download Full-Text

Persian Verion

View:

415

Download:

Cites:

Information Journal Paper

Title

An Incremental Solution for Content-Structural Graph Clustering

Author(s)

KESHVARI S. | JAVADZADEH M.A. | NADERI H. | Issue Writer Certificate

Keywords

Graph ClusteringQ1

Content-Structural ClusteringQ1

Attributed GraphQ1

Cluster ExtractionQ1

Abstract

Researchers have always been interested in graph nodes clustering based on content or structure. But less attention has been paid to clustering based on both structure and content. But a Content-Structural Clustering is needed in information networks like social networks. In this paper, the ICS-Cluster algorithm is proposed which takes into consideration both the structure and content aspects of the nodes. The purpose of this approach is to gain a coherent internal structure (structural aspect) and homogeneous attribute values (content aspect) in the graph. In this approach firstly the graph is converted into a content-structural graph which edges' weight show similarity between the connected nodes. Incremental clustering is done based on edges’ weight in this process the edges with the most weight is considered as clusters then the weight of connected edge to the cluster is aggregated and they’ ll be one edge, the process is repeated until the algorithm reaches the number of clusters that indicated by the user. ICS-Cluster algorithm number of cluster is indicated by the user. Comparing ICS-Cluster with other content structural algorithm based on six criteria for measuring cluster quality shows that ICS-Cluster has good performance. These criteria contain structural criteria (Modularity, Error Link, and Density), content criterion (Average Similarity), content-structural criterion (CS-Measure) and the run time.

Cites

No record.

References

No record.

Cite

APA: Copy

KESHVARI, S., JAVADZADEH, M.A., & NADERI, H.. (2020). An Incremental Solution for Content-Structural Graph Clustering. (JOURNAL OF ADVANCED DEFENCE SCIENCE AND TECHNOLOGY) JOURNAL OF PASSIVE DEFENCE SCIENCE AND TECHNOLOGY, 11(1 ), 107-121. SID. https://sid.ir/paper/406595/en

Vancouver: Copy

KESHVARI S., JAVADZADEH M.A., NADERI H.. An Incremental Solution for Content-Structural Graph Clustering. (JOURNAL OF ADVANCED DEFENCE SCIENCE AND TECHNOLOGY) JOURNAL OF PASSIVE DEFENCE SCIENCE AND TECHNOLOGY[Internet]. 2020;11(1 ):107-121. Available from: https://sid.ir/paper/406595/en

IEEE: Copy

S. KESHVARI, M.A. JAVADZADEH, and H. NADERI, “An Incremental Solution for Content-Structural Graph Clustering,” (JOURNAL OF ADVANCED DEFENCE SCIENCE AND TECHNOLOGY) JOURNAL OF PASSIVE DEFENCE SCIENCE AND TECHNOLOGY, vol. 11, no. 1 , pp. 107–121, 2020, [Online]. Available: https://sid.ir/paper/406595/en

Related Journal Papers