A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring

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.

KASHANI M.; SHOJAEDINI S.V.; GORGIN S.

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF NONLINEAR ANALYSIS AND APPLICATIONS Year:2019 | Volume:10 | Issue:1 Page(s): 185-192

Download Full-Text

View:

123

Download:

126

Cites:

Information Journal Paper

Title

A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring

Author(s)

KASHANI M. | SHOJAEDINI S.V. | GORGIN S. | Issue Writer Certificate

Keywords

Social networks

Graph coloring

Cellular automata

Abstract

All the Social networks can be modeled as a graph, where each roles as vertex and each relation roles as an edge. The graph can be show as G = [V; E], where V is the set of vertices and E is the set of edges. All Social networks can be segmented to K groups, where there are members in each group with same features. In each group each person knows other individuals and is in touch with them. In this study, the main goal is introducing a new approach for detecting these groups and minimizing the number of these groups using a cellular automat algorithm. There are two types of Social networks, containing simulated social network and real social network. The results show that the introduced method has a great potential to signi cantly reduce the number of colors assigned and running time of the program.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

KASHANI, M., SHOJAEDINI, S.V., & GORGIN, S.. (2019). A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring. INTERNATIONAL JOURNAL OF NONLINEAR ANALYSIS AND APPLICATIONS, 10(1), 185-192. SID. https://sid.ir/paper/340925/en

Vancouver: Copy

KASHANI M., SHOJAEDINI S.V., GORGIN S.. A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring. INTERNATIONAL JOURNAL OF NONLINEAR ANALYSIS AND APPLICATIONS[Internet]. 2019;10(1):185-192. Available from: https://sid.ir/paper/340925/en

IEEE: Copy

M. KASHANI, S.V. SHOJAEDINI, and S. GORGIN, “A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring,” INTERNATIONAL JOURNAL OF NONLINEAR ANALYSIS AND APPLICATIONS, vol. 10, no. 1, pp. 185–192, 2019, [Online]. Available: https://sid.ir/paper/340925/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops