Probabilistic distance clustering on networks

2018-11-05
In this study, a soft clustering problem on networks is investigated. It is assumed that cluster centers are located not only on vertices, but also on the edges of the network. Two different soft assignment schemes are studied where different membership functions are considered for the assignments. Structural properties for the clustering problem have been derived for different problem settings and the relation to the p-median problem has been shown under specific conditions. As a solution approach, a metaheuristic algorithm using the properties of the problem has been proposed. Computational experiments have been conducted with different problem instances.
Informs Annual Meeting , November 4-7 2018

Suggestions

Optimal redundancy resolution for kinematically redundant parallel manipulators
Tunç, Tansel Sıtkı; Özgören, Mustafa Kemal; Department of Mechanical Engineering (2014)
In this study, the redundancy resolution of kinematically redundant parallel manipulators has been investigated as an optimization problem. The emerging optimization problem has been solved globally using a hybrid genetic algorithm. This algorithm has been applied as an example to a planar parallel manipulator which has four degrees of freedom. It has been assumed that the manipulator is used so that only the tip point of its end-effector is controlled. Therefore, the rotation angle of the end effector has ...
Non-parametric radar detection in homogeneous and non-homogeneous environments
Yılmaz, Koray Kamil (2007-06-13)
In this study, non-parametric constant false alarm rate (CFAR) radar processors are investigated. Performance analysis of the system, which uses generalized sign test in its detector, is done in homogeneous and non-homogeneous environments. Also the performance of the system is compared with the performance of the cell averaging constant false alarm rate (CA-CFAR) detector in the homogeneous and non-homogeneous environments.
An Analysis on the Effect of Skip Connections in Fully Convolutional Networks for License Plate Localization
Uzun, Engin; Akagündüz, Erdem (2019-01-01)
In this study, the effect of the skip connections, which are seen in fully convolutional networks, on object localization is analyzed. For this purpose, a local data set for plate detection is created. Experiments are carried out using this data set. Due to the small size of the image set, data augmentation method is used to overcome the danger of over-fitting. The learning rates of the first layers are frozen for analysis and fine-tuning is applied to only the last layer and deconvolution layers. The resul...
Quantum mechanical investigation of CO oxidation conducted on automotive exhaust emission catalysts containing LA and PD/LA on Ceria-Zirconia
Kaya, Yasemin; Önal, Işık; Department of Chemical Engineering (2016)
In this study, Three Way Catalyst (TWC) is investigated via Density Functional Theory (DFT) methods. DFT techniques are implemented by Vienna Ab Initio Simulation Package (VASP). Atomic lanthanum substituted and both palladium and lanthanum substituted CZO (110) surfaces are investigated for their catalytic activity in terms of carbon monoxide oxidation. Relative energy profiles for CO reaction mechanisms on these surfaces are obtained and activation barriers of reaction steps are analyzed by using CI-NEB m...
Inference in multivariate linear regression models with elliptically distributed errors
İslam, Muhammed Qamarul; Yazici, Mehmet (2014-08-01)
In this study we investigate the problem of estimation and testing of hypotheses in multivariate linear regression models when the errors involved are assumed to be non-normally distributed. We consider the class of heavy-tailed distributions for this purpose. Although our method is applicable for any distribution in this class, we take the multivariate t-distribution for illustration. This distribution has applications in many fields of applied research such as Economics, Business, and Finance. For estimat...
Citation Formats
C. İyigün, “Probabilistic distance clustering on networks,” presented at the Informs Annual Meeting , November 4-7 2018, Phoenix- Arizona, USA, 2018, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/87284.