DINGA: DISCOVERY OF IMPORTANT NODES IN SOCIAL NETWORKS USING GENETIC ALGORITHMS

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.

Kamali Hasti; RAHMANI HOSSEIN; SHAH HOSSEINI HAMED

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

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON WEB RESEARCH
Year:2018 | Issue:4

Download Full-Text

View:

171

Download:

Information Seminar Paper

Title

DINGA: DISCOVERY OF IMPORTANT NODES IN SOCIAL NETWORKS USING GENETIC ALGORITHMS

Author(s)

Kamali Hasti | RAHMANI HOSSEIN | SHAH HOSSEINI HAMED

Keywords

SOCIAL NETWORKS

IMPORTANT NODES

GENETIC ALGORITHM

Abstract

NOWADAYS, THE DISCOVERY OF IMPORTANT NODES IS AMONG THE MAIN CONCERNS OF SOCIAL NETWORKS ANALYSIS. DISCOVERING IMPORTANT NODES HAS BEEN DONE FOR WIDE RANGE OF PURPOSES; FROM DISCOVERING LEADERS IN TERRORISTIC NETWORKS TO DISCOVERING INFLUENTIAL PEOPLE IN ADVERTISEMENT NETWORKS. SO FAR DIFFERENT CRITERIA HAVE BEEN INTRODUCED FOR DISCOVERY OF IMPORTANT NODES. DUE TO THE DIVERSITY OF GRAPH STRUCTURES FROM ON SIDE, AND GENERALITY OF PREVIOUS METHODS IN OTHER SIDE THE ACCURACY OF PREVIOUS METHODS IN DISCOVERING THE IMPORTANT NODES IS VERY LIMITED. IN THIS PAPER, A SYSTEM CALLED DINGA FOR DISCOVERING OF IMPORTANT NODES IN SOCIAL NETWORKS WITH AN UNKNOWN STRUCTURE HAS BEEN PROPOSED. OUR PROPOSED SYSTEM DISCOVERS THE IMPORTANT NODES IN SOCIAL NETWORKS BY EMPLOYING A WEIGHTED COMBINATION OF EIGHT INFORMATIVE CRITERIA OF IMPORTANT NODES USING GENETIC ALGORITHM. THE EFFICIENCY OF THE PROPOSED SOLUTION HAS BEEN INVESTIGATED THROUGH SIMULATION ON THE ENRON E-MAIL NETWORK. OUR PROPOSED METHOD OUTPERFORMS THE PREVIOUS METHODS, IN ADDITION TO RANDOM WEIGHT LEARNER, 21% WITH RESPECT TO ACCURACY.

Cites

No record.

References

No record.

Cite

APA: Copy

Kamali, Hasti, RAHMANI, HOSSEIN, & SHAH HOSSEINI, HAMED. (2018). DINGA: DISCOVERY OF IMPORTANT NODES IN SOCIAL NETWORKS USING GENETIC ALGORITHMS. INTERNATIONAL CONFERENCE ON WEB RESEARCH. SID. https://sid.ir/paper/948828/en

Vancouver: Copy

Kamali Hasti, RAHMANI HOSSEIN, SHAH HOSSEINI HAMED. DINGA: DISCOVERY OF IMPORTANT NODES IN SOCIAL NETWORKS USING GENETIC ALGORITHMS. 2018. Available from: https://sid.ir/paper/948828/en

IEEE: Copy

Hasti Kamali, HOSSEIN RAHMANI, and HAMED SHAH HOSSEINI, “DINGA: DISCOVERY OF IMPORTANT NODES IN SOCIAL NETWORKS USING GENETIC ALGORITHMS,” presented at the INTERNATIONAL CONFERENCE ON WEB RESEARCH. 2018, [Online]. Available: https://sid.ir/paper/948828/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops