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
Nur Evin Özdemirel
E-mail
nurevin@metu.edu.tr
Department
Department of Industrial Engineering
ORCID
0000-0001-5905-3375
Scopus Author ID
35612115000
Web of Science Researcher ID
AAZ-8000-2020
Publications
Theses Advised
Open Courses
Projects
Centroid based Tree-Structured Data Clustering Using Vertex/Edge Overlap and Graph Edit Distance
DİNLER, DERYA; Tural, Mustafa Kemal; Özdemirel, Nur Evin (Springer Science and Business Media LLC, 2020-06-01)
We consider a clustering problem in which the data objects are rooted m-ary trees with known node correspondence. We assume that the nodes of the trees are unweighted, but the edges can be unweighted or weighted. We measur...
Extracting the Boundaries of Clusters: A Post-Clustering Tool for Spatial Datasets
İNKAYA, TÜLİN; Kayaligil, Sinan; Özdemirel, Nur Evin (World Scientific Pub Co Pte Lt, 2020-04-01)
Boundary extraction is a fundamental post-clustering problem. It facilitates interpretability and usability of clustering results. Also, it provides visualization and dataset reduction. However, it has not attracted much a...
Tree-structured Data Clustering
Dinler, Derya; Tural, Mustafa Kemal; Özdemirel, Nur Evin (2019-11-04)
Tree-structured Data ClusteringWe consider a clustering problem in which data objects are rooted trees withunweighted or weighted edges and propose a k-means based algorithm whichrepeats assignment and update steps until c...
Tree-structured Data Clustering with Graph Edit Distance
Dinler, Derya; Tural, Mustafa Kemal; Özdemirel, Nur Evin (null; 2019-06-23)
Ağaç Yapılı Verilerin Ged (Graph Edit Distance) ile Kümelenmesi
Dinler, Derya; Tural, Mustafa Kemal; Özdemirel, Nur Evin (2019-06-12)
Tree-structured Data Clustering
Dinler, Derya; Tural, Mustafa Kemal; Özdemirel, Nur Evin (null; 2018-11-04)
Tree-structured Data ClusteringWe consider a clustering problem in which data objects are rooted trees withunweighted or weighted edges and propose a k-means based algorithm whichrepeats assignment and update steps until c...
Tree-structured Data Clustering
Dinler, Derya; Tural, Mustafa Kemal; Özdemirel, Nur Evin (2018-07-08)
Traditional clustering techniques deal with point data. However, improving measurement capabilities and the need for deeper analyses result in collecting more complex datasets. In this study, we consider a clustering probl...
A matheuristic for binary classification of data sets using hyperboxes
Akbulut, Derya; İyigün, Cem; Özdemirel, Nur Evin (null; 2018-07-08)
In this study, an optimization approach is proposed for the binary classification problem. A Mixed Integer Programming (MIP) model formulation is used to construct hyperboxes as classifiers, minimizing the number of miscla...
Tree-structured Data Clustering
Dinler, Derya; Tural, Mustafa Kemal; Özdemirel, Nur Evin (null; 2018-07-08)
Traditional clustering techniques deal with point data. However, improving measurement capabilities and the need for deeper analyses result in collecting more complex datasets. In this study, we consider a clustering probl...
Baglantililik Bazli Komsuluk Kurma ile Cok Amacli Genetik Kumele Problemi
Alakus, Cansu; İyigün, Cem; Özdemirel, Nur Evin (null; 2018-06-26)
F
P
1
2
3
4
N
E
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX