DISCOVERY OF SOCIETY STRUCTURE IN A SOCIAL NETWORK USING DISTRIBUTED CACHE MEMORY

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.

Fattahi Saeideh; YAZDANI REZA; Vahidipour Seyyed Mehdi

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

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON WEB RESEARCH
Year:2019 | Issue:5

Download Full-Text

View:

110

Download:

Information Seminar Paper

Title

DISCOVERY OF SOCIETY STRUCTURE IN A SOCIAL NETWORK USING DISTRIBUTED CACHE MEMORY

Author(s)

Fattahi Saeideh | YAZDANI REZA | Vahidipour Seyyed Mehdi

Keywords

SOCIAL MEDIA

COMMUNITY STRUCTURE DETECTION

MAPPING-REDUCTION MODEL

SPARK

DISTRIBUTED CACHE MEMORY

Abstract

COMMUNITY STRUCTURE DETECTION IN SOCIAL NETWORKS HAS BECOME A BIG CHALLENGE. VARIOUS METHODS IN THE LITERATURE HAVE BEEN PRESENTED TO SOLVE THIS CHALLENGE. RECENTLY, SEVERAL METHODS HAVE ALSO BEEN PROPOSED TO SOLVE THIS CHALLENGE BASED ON A MAPPING-REDUCTION MODEL, IN WHICH DATA AND ALGORITHMS ARE DIVIDED BETWEEN DIFFERENT PROCESS NODES SO THAT THE COMPLEXITY OF TIME AND MEMORY OF COMMUNITY DETECTION IN LARGE SOCIAL NETWORKS IS REDUCED. IN THIS PAPER, A MAPPING-REDUCTION MODEL IS FIRST PROPOSED TO DETECT THE STRUCTURE OF COMMUNITIES. THEN THE PROPOSED FRAMEWORK IS REWRITTEN ACCORDING TO A NEW MECHANISM CALLED DISTRIBUTED CACHE MEMORY; DISTRIBUTED CACHE MEMORY CAN STORE DIFFERENT VALUES ASSOCIATED WITH DIFFERENT KEYS AND, IF NECESSARY, PUT THEM AT DIFFERENT COMPUTATIONAL NODES. FINALLY, THE PROPOSED REWRITTEN FRAMEWORK HAS BEEN IMPLEMENTED USING SPARK TOOLS AND ITS IMPLEMENTATION RESULTS HAVE BEEN REPORTED ON SEVERAL MAJOR SOCIAL NETWORKS. THE PERFORMED EXPERIMENTS SHOW THE EFFECTIVENESS OF THE PROPOSED FRAMEWORK BY VARYING THE VALUES OF VARIOUS PARAMETERS.

Cites

No record.

References

No record.

Cite

APA: Copy

Fattahi, Saeideh, YAZDANI, REZA, & Vahidipour, Seyyed Mehdi. (2019). DISCOVERY OF SOCIETY STRUCTURE IN A SOCIAL NETWORK USING DISTRIBUTED CACHE MEMORY. INTERNATIONAL CONFERENCE ON WEB RESEARCH. SID. https://sid.ir/paper/949093/en

Vancouver: Copy

Fattahi Saeideh, YAZDANI REZA, Vahidipour Seyyed Mehdi. DISCOVERY OF SOCIETY STRUCTURE IN A SOCIAL NETWORK USING DISTRIBUTED CACHE MEMORY. 2019. Available from: https://sid.ir/paper/949093/en

IEEE: Copy

Saeideh Fattahi, REZA YAZDANI, and Seyyed Mehdi Vahidipour, “DISCOVERY OF SOCIETY STRUCTURE IN A SOCIAL NETWORK USING DISTRIBUTED CACHE MEMORY,” presented at the INTERNATIONAL CONFERENCE ON WEB RESEARCH. 2019, [Online]. Available: https://sid.ir/paper/949093/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops