A New Clustering Algorithm for Attributive Graphs through Information Diffusion Approaches

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.

Kianian S.; FARZI S.; SAMAK H.

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

Journal Paper

Paper Information

Journal: JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING INNOVATIONS Year:2020 | Volume:8 | Issue:2 Page(s): 273-284

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

A New Clustering Algorithm for Attributive Graphs through Information Diffusion Approaches

Author(s)

Kianian S. | FARZI S. | SAMAK H. | Issue Writer Certificate

Keywords

Attributive graph

Clustering algorithm

Signal similarity

Heat diffusion

Community detection

Abstract

Background and Objectives: Simplicity and flexibility constitute the two basic features for graph models which has made them functional models for real life problems. The Attributive graphs are too popular among researchers because of their efficiency and functionality. An Attributive graph is a graph the nodes and edges of which can be attributive. Nodes and edges as structural dimension and their attributes as contextual dimension made graphs more flexible in modeling real problems. Methods: In this study, a new Clustering algorithm is proposed based on KMedoid which focuses on graph’ s structure dimension, through Heat diffusion algorithm and contextual dimension through weighted Jaccard coefficient in a simultaneous matter. The calculated clusters through the proposed algorithm are of denser and nodes with more similar attributes. Results: DBLP and PBLOG real data sets are applied to evaluate and compare this algorithm with new and well-known cluster algorithms. Conclusion: Results indicate the outperformers of this algorithm in relation to its counterparts as to structure quality, cluster contextual and time complexity criteria.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Kianian, S., FARZI, S., & SAMAK, H.. (2020). A New Clustering Algorithm for Attributive Graphs through Information Diffusion Approaches. JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING INNOVATIONS, 8(2), 273-284. SID. https://sid.ir/paper/977848/en

Vancouver: Copy

Kianian S., FARZI S., SAMAK H.. A New Clustering Algorithm for Attributive Graphs through Information Diffusion Approaches. JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING INNOVATIONS[Internet]. 2020;8(2):273-284. Available from: https://sid.ir/paper/977848/en

IEEE: Copy

S. Kianian, S. FARZI, and H. SAMAK, “A New Clustering Algorithm for Attributive Graphs through Information Diffusion Approaches,” JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING INNOVATIONS, vol. 8, no. 2, pp. 273–284, 2020, [Online]. Available: https://sid.ir/paper/977848/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops