IMPROVING RESULTS OF MIXTURE MODEL BASED GRAPH CLUSTERING METHODS USING EVOLUTIONARY 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.

Elyasi Ghasem; MORADI PARHAM; Akhlaghian Fardin

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

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON COMPUTER AND KNOWLEDGE ENGINEERING (ICCKE)
Year:2014 | Issue:4

Download Full-Text

View:

116

Download:

Information Seminar Paper

Title

IMPROVING RESULTS OF MIXTURE MODEL BASED GRAPH CLUSTERING METHODS USING EVOLUTIONARY ALGORITHMS

Author(s)

Elyasi Ghasem | MORADI PARHAM | Akhlaghian Fardin

Keywords

MIXTURE MODEL

GENETIC ALGORITHM

RANDOM GRAPHS

GRAPH CLUSTERING

Abstract

IN THE RECENT YEARS THERE HAS BEEN AN INTEREST WITHINTHE PHYSICS COMMUNITY IN THE PROPERTIES OF NETWORKS OF MANYTYPES. GRAPH CLUSTERING IS THE PROCESS OF IDENTIFYING THENETWORK STRUCTURE IN TERMS OF GROUPING THE VERTICES OF A GRAPHINTO CLUSTERS TAKING INTO CONSIDERATION THE EDGE STRUCTURE OF THEGRAPH THAT IN SUCH A WAY THERE SHOULD BE MANY EDGES WITHINEACH CLUSTER AND RELATIVELY FEW BETWEEN THE CLUSTERS. BASED ONHIGH COMPUTATIONAL COST, THE CLASSICAL ALGORITHMS WILL SLOWMUCH SINCE DATA SIZE IN REAL APPLICATION INCREASES RAPIDLY. INSUCH A SITUATION, MODEL BASED GRAPH CLUSTERING ALGORITHMS AREAN EFFICIENT ALTERNATIVE TO CLASSICAL ONES. THE PERFORMANCE OFTHE MODEL BASED GRAPH CLUSTERING ALGORITHMS DEPENDS ON THECORRECT INITIAL PARAMETER SETTING. WE ARE PROPOSED ANEVOLUTIONARY ALGORITHM TO FIND PROPER VALUES FOR THE MODELBASED GRAPH CLUSTERING ALGORITHMS. THE PROPOSED METHOD ISTESTED ON BOTH SIMULATED AND REAL DATA SETS AND GAVE IMPROVINGRESULTS IN COMPARISON WITH RANDOM PARAMETER SETTING.

Cites

No record.

References

No record.

Cite

APA: Copy

Elyasi, Ghasem, MORADI, PARHAM, & Akhlaghian, Fardin. (2014). IMPROVING RESULTS OF MIXTURE MODEL BASED GRAPH CLUSTERING METHODS USING EVOLUTIONARY ALGORITHMS. INTERNATIONAL CONFERENCE ON COMPUTER AND KNOWLEDGE ENGINEERING (ICCKE). SID. https://sid.ir/paper/926271/en

Vancouver: Copy

Elyasi Ghasem, MORADI PARHAM, Akhlaghian Fardin. IMPROVING RESULTS OF MIXTURE MODEL BASED GRAPH CLUSTERING METHODS USING EVOLUTIONARY ALGORITHMS. 2014. Available from: https://sid.ir/paper/926271/en

IEEE: Copy

Ghasem Elyasi, PARHAM MORADI, and Fardin Akhlaghian, “IMPROVING RESULTS OF MIXTURE MODEL BASED GRAPH CLUSTERING METHODS USING EVOLUTIONARY ALGORITHMS,” presented at the INTERNATIONAL CONFERENCE ON COMPUTER AND KNOWLEDGE ENGINEERING (ICCKE). 2014, [Online]. Available: https://sid.ir/paper/926271/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops