A Unified approach for center-based clustering problems on networks

Download

index.pdf

Date

2018

Author

Eroğlu, Derya İpek

Metadata

Show full item record

Item Usage Stats

243
views

124
downloads

In this thesis, Center-Based Clustering Problems on Networks are studied. Four different problems are considered differing in the assignment scheme of the data points and the objective function. Two different assignment schemes are considered, hard assignment and soft assignment. In hard assignment, data points (vertices) are strictly assigned to one cluster, while in soft assignment, vertices are assigned to the multiple clusters with a membership probability. Objective function of a clustering problem could be categorized as minimizing sum of distances or sum of squared distances between the vertices and the centers of clusters they are assigned to. In this study, cluster centers are not restricted to vertices. They are allowed to be located on vertices or anywhere on the edges. The problems that are studied are analyzed in terms of properties of the cluster centers, and theoretical results are derived. Benefiting from these properties, a unified solution framework is developed which is named Hybrid Genetic Algorithm (HGA), a genetic algorithm with a Local Search operation which uses the theoretical results obtained about the cluster centers. Two versions of HGA, namely Node Based HGA (HGA-N) and Edge Based HGA (HGAv E) are developed by modifying HGA considering the derived properties. To test the performance of the proposed algorithms, numerical experiments are conducted on clustering of datasets from the literature and the simulated ones. Results are compared with the optimal or best solutions reported in the literature (if available). The proposed algorithms are also compared with the well-known heuristics used for the planar clustering problems. These heuristics are modified for the network problems. Computational results show that the proposed approach performs well in all clustering problems studied.

Subject Keywords

Cluster analysis., Genetic algorithms.

URI

http://etd.lib.metu.edu.tr/upload/12623011/index.pdf
https://hdl.handle.net/11511/27931

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

A new algorithm and computation approach for economic dispatch with prohibited operating zones in power systems Cetinkaya, N; Urkmez, A; Erkmen, İsmet; Yalcinoz, T (2005-01-01) This paper presents a new algorithm and computation approach to solve the economic load dispatch (ELD) in electrical power systems. We applied a new power formula to solve the LLD problem. If production units cost Curves are represented property then ELD becomes More Correct. In this respect we assumed that production units have prohibited operating zones. Cost curves of the production units are generally accepted as piece-wise quadratic function. The power production is cheaper since we do not use the prod...
On the use of genetic algorithms for synthesis of signal temporal logic formulas Aydin, Sertac Kagan; Aydın Göl, Ebru (2018-07-09) In this work, we studied use of genetic algorithms to synthesize Signal Temporal Logic formulas from a labeled data set. In the synthesis problem, the goal is to generate the best STL formula representing the labeled signals in the set. To use genetic algoritms in this domain, the basic genetic algoritm processes are defined for STL formulas. The developed synthesis method produces a formula from the data set efficiently in a fully automated way. In particular, the proposed approach does not require an expe...
A Comparative Study on Two Different Direct Parallel Solution Strategies for Large-Scale Problems Bahcecioglu, T.; Ozmen, S.; Kurç, Özgür (2009-04-08) This paper presents a comparative study on two different direct parallel solution strategies for the linear solution of large scale actual finite element models: global and domain-by-domain. The global solution strategy was examined by utilizing the parallel multi-frontal equation solver, MUMPS [1], together with a finite element program. In a similar manner a substructure based parallel solution framework [2] was utilized for investigating the domain-by-domain strategy. Various large-scale structural model...
A method for chromosome handling of r-permutations of n-element set in genetic algorithms Üçoluk, Göktürk (1997-04-16) Combinatorial optimisation problems are in the domain of Genetic Algorithms (GA) interest. Unfortunately ordinary crossover and mutation operators cause problems for chromosome representations of permutations and some types of combinations. This is so because offsprings generated by means of the ordinary operators are of a great possibility no more valid chromosomes. A variety of methods and new operators that handle that sort of obscenities are introduced throughout the literature. A new method for represe...
A Divide and Conquer Approach for Construction of Large-Scale Signaling Networks from PPI and RNAi Data Using Linear Programming Ozsoy, Oyku Eren; Can, Tolga (Institute of Electrical and Electronics Engineers (IEEE), 2013-07-01) Inference of topology of signaling networks from perturbation experiments is a challenging problem. Recently, the inference problem has been formulated as a reference network editing problem and it has been shown that finding the minimum number of edit operations on a reference network to comply with perturbation experiments is an NP-complete problem. In this paper, we propose an integer linear optimization (ILP) model for reconstruction of signaling networks from RNAi data and a reference network. The ILP ...

Citation Formats

D. İ. Eroğlu, “A Unified approach for center-based clustering problems on networks,” M.S. - Master of Science, Middle East Technical University, 2018.