A Hierarchical Method For Content-Structured 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.

Rahmati K.; KESHVARI S.; NADERI H.

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

Journal Paper

Paper Information

Journal: TABRIZ JOURNAL OF ELECTRICAL ENGINEERING Year:2019 | Volume:49 | Issue:3 (89) Page(s): 1107-1117

Download Full-Text

Persian Verion

View:

508

Download:

Cites:

Information Journal Paper

Title

A Hierarchical Method For Content-Structured Graph Clustering

Author(s)

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

Keywords

ClusteringQ2

Graph Content-Structural ClusteringQ1

Information NetworkQ1

Social NetworkQ1

Abstract

Entities in Social Networks, in addition to having the relationship with each other, also have content. This type of networks can be modeled by the enriched graph, in which nodes could have text too. Graph Clustering is one of the important attempts toward analyzing Social Networks. Despite these two facts, most of the existing graph Clustering methods independently focused on one of the content or structural aspects. Content-Structural graph Clustering algorithms simultaneously consider both the structure and the content of the graph. The main aim of this paper is to achieve well connected (structured) clusters while their nodes benefit from homogeneous attribute values (content). The proposed algorithm in this paper so-called RSL-Cluster performs the Clustering by hierarchically removing the edge between nodes which has a weight lower that the average similarity of nodes. This stage continues until reaching the user’ s desired number of clusters. Comparing the proposed algorithm with three well-known content-structural Clustering algorithms represents the proper functioning of the proposed method. The used measures to evaluate our method include structural, content and the content-structural measures.

Cites

No record.

References

No record.

Cite

APA: Copy

Rahmati, K., KESHVARI, S., & NADERI, H.. (2019). A Hierarchical Method For Content-Structured Graph Clustering. TABRIZ JOURNAL OF ELECTRICAL ENGINEERING, 49(3 (89) ), 1107-1117. SID. https://sid.ir/paper/256515/en

Vancouver: Copy

Rahmati K., KESHVARI S., NADERI H.. A Hierarchical Method For Content-Structured Graph Clustering. TABRIZ JOURNAL OF ELECTRICAL ENGINEERING[Internet]. 2019;49(3 (89) ):1107-1117. Available from: https://sid.ir/paper/256515/en

IEEE: Copy

K. Rahmati, S. KESHVARI, and H. NADERI, “A Hierarchical Method For Content-Structured Graph Clustering,” TABRIZ JOURNAL OF ELECTRICAL ENGINEERING, vol. 49, no. 3 (89) , pp. 1107–1117, 2019, [Online]. Available: https://sid.ir/paper/256515/en

Related Journal Papers