Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Mixed integer programming and heuristics approaches for clustering with cluster-based feature selection
Date
2019-10-20
Author
İyigün, Cem
Metadata
Show full item record
Item Usage Stats
336
views
0
downloads
Cite This
In this study, we work on a clustering problem where it is assumed that the features identifying the clusters may differ for each cluster. Number of clusters and number of relevant features in each cluster are given in advance. A centerbased clustering approach is proposed. Finding the cluster centers, assigning the data points and selecting relevant features for each cluster are performed simultaneously. A non-linear mixed integer mathematical model is proposed which minimizes the total distance between data points and their cluster center by using the selected features for each cluster. Different linearization methods have been used for solving the problem. Besides, two different heuristic algorithms have been developed by taking into account the nature of the mentioned problem. Experimental results have been presented
URI
https://hdl.handle.net/11511/86852
https://cdn2.hubspot.net/hubfs/3449182/2019_INFORMS_Annual_Meeting_Back_Matter.pdf?__hstc=194041586.afeadd9fe7b3b16cc4b18d0f05894a05.1613646625948.1613646625948.1613646625948.1&__hssc=194041586.3.1613646625951&hsCtaTracking=820e16f1-b6bc-4fc7-bdf4-87cae6d9bfaf%7C3f517cf7-0c21-47b0-a192-5cd115cf9349
Conference Name
Informs Annual Meeting , October 20-23 2019
Collections
Department of Industrial Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
Probabilistic Distance Clustering: Algorithm and Applications
İyigün, Cem (World Scientific , 2009-02-01)
The probabilistic distance clustering method of the authors [2, 8], assumes the cluster membership probabilities given in terms of the distances of the data points from the cluster centers, and the cluster sizes. A resulting extremal principle is then used to update the cluster centers (as convex combinations of the data points), and the cluster sizes (if not given.) Progress is monitored by the joint distance function (JDF), a weighted harmonic mean of the above distances, that approximates the data by cap...
Integrated nonlinear regression analysis of tracer and well test data
Akın, Serhat (Elsevier BV, 2003-08-01)
One frequent observation from conventional pressure transient test analysis is that field data match mathematical models derived for homogeneous systems. This observation suggests that pressure data as presently interpreted may not contain details concerning certain reservoir heterogeneities. On the other hand, tracer tests may be more sensitive to heterogeneous elements present in the reservoir because of the convective nature of the flow test. In this study, a possible improvement of conventional pressure...
Covariance Matrix Estimation of Texture Correlated Compound-Gaussian Vectors for Adaptive Radar Detection
Candan, Çağatay; Pascal, Frederic (2022-01-01)
Covariance matrix estimation of compound-Gaussian vectors with texture-correlation (spatial correlation for the adaptive radar detectors) is examined. The texture parameters are treated as hidden random parameters whose statistical description is given by a Markov chain. States of the chain represent the value of texture coefficient and the transition probabilities establish the correlation in the texture sequence. An Expectation-Maximization (EM) method based covariance matrix estimation solution is given ...
Mixed integer programming and heuristics approachesfor clustering with cluster-based feature selection
Önen Öz, Sen; İyigün, Cem; Department of Industrial Engineering (2019)
Cluster analysis tries to figure out the hidden similarities between data points in orderto place similar data points into the same group and different data points into separategroups using unlabeled data. Understanding the data becomes difficult and the powerof obtaining informative clusters for an algorithm decreases as the dimensionality ofthe data set gets high. Identifying the relevant features of high dimensional data setsis the mostly used technique in order to increase the performance of the algorit...
Multi-target tracking using passive doppler measurements
Guldogan, Mehmet B.; Orguner, Umut; Gustafsson, Fredrik (2013-04-26)
In this paper, we analyze the performance of the Gaussian mixture probability hypothesis density (GM-PHD) filter in tracking multiple non-cooperative targets using Doppler-only measurements in a passive sensor network. Clutter, missed detections and multi-static Doppler variances are incorporated into a realistic multi-target scenario. Simulation results show that the GM-PHD filter successfully tracks multiple targets using only Doppler shift measurements in a passive multi-static scenario.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
C. İyigün, “Mixed integer programming and heuristics approaches for clustering with cluster-based feature selection,” presented at the Informs Annual Meeting , October 20-23 2019, Washington, USA, 2019, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/86852.