Dr. Öğr. Üyesi Deniz Cantürk

Yayın Ağı

Makaleler 6

1. A New Parallel Memetic Algorithm for the Close-Enough Traveling Salesman Problem

Cantürk D.

Düzce Üniversitesi Bilim ve Teknoloji Dergisi , cilt.14, sa.1, ss.152-162, 2026 (TRDizin)

2. Scalable parallel memetic algorithms for large close-enough traveling salesman problems

Cantürk D., Dökeroğlu T.

Neural Computing and Applications , cilt.38, sa.2, 2026 (Scopus)

3. New Harris Hawks algorithms for the Close-Enough Traveling Salesman Problem

Dökeroğlu T., Cantürk D.

Intelligent Systems with Applications , cilt.28, 2025 (Scopus)

4. Trust-aware location recommendation in location-based social networks: A graph-based approach

Canturk D., KARAGÖZ P., Kim S., TOROSLU İ. H.

Expert Systems with Applications , cilt.213, 2023 (SCI-Expanded, Scopus)

5. Sgwalk: Location recommendation by user subgraph-based graph embedding

Canturk D., KARAGÖZ P.

IEEE Access , cilt.9, ss.134858-134873, 2021 (SCI-Expanded, Scopus)

6. A framework for aspect based sentiment analysis on turkish informal texts

KARAGÖZ P., Kama B., Ozturk M., TOROSLU İ. H., Canturk D.

Journal of Intelligent Information Systems , cilt.53, sa.3, ss.431-451, 2019 (SCI-Expanded, Scopus)

Hakemli Bilimsel Toplantılarda Yayımlanmış Bildiriler 3

1. A New Parallel Fitness-Oriented Memetic Algorithm for the Close Enough Traveling Salesman Problem Yeterince Yakin Gezgin Satici Problemi i in Paralel Fitness Y nelimli Memetic Algoritma nerisi

Cantürk D.

33rd IEEE Conference on Signal Processing and Communications Applications, SIU 2025, İstanbul, Türkiye, 25 - 28 Haziran 2025, (Tam Metin Bildiri)

2. Ontology-based routing of web services in distributed service discovery system containing domain specific nodes

Cantürk D., KARAGÖZ P.

17th IEEE Symposium on Computers and Communication, ISCC 2012, Cappadocia, Türkiye, 1 - 04 Temmuz 2012, ss.283-288, (Tam Metin Bildiri)

3. Semantic annotation of web services with Lexicon-based alignment

Canturk D., KARAGÖZ P.

2011 IEEE World Congress on Services, SERVICES 2011, Washington, Amerika Birleşik Devletleri, 4 - 09 Temmuz 2011, ss.355-362, (Tam Metin Bildiri)

Metrikler

Dr. Öğr. Üyesi Deniz Cantürk

Yayınlar & Eserler

1. A New Parallel Memetic Algorithm for the Close-Enough Traveling Salesman Problem

2. Scalable parallel memetic algorithms for large close-enough traveling salesman problems

3. New Harris Hawks algorithms for the Close-Enough Traveling Salesman Problem

4. Trust-aware location recommendation in location-based social networks: A graph-based approach

5. Sgwalk: Location recommendation by user subgraph-based graph embedding

6. A framework for aspect based sentiment analysis on turkish informal texts

1. A New Parallel Fitness-Oriented Memetic Algorithm for the Close Enough Traveling Salesman Problem Yeterince Yakin Gezgin Satici Problemi i in Paralel Fitness Y nelimli Memetic Algoritma nerisi

2. Ontology-based routing of web services in distributed service discovery system containing domain specific nodes

3. Semantic annotation of web services with Lexicon-based alignment

Yayın

Yayın (WoS)

Yayın (Scopus)

Atıf (Scopus)

H-İndeks (Scopus)

Tez Danışmanlığı

Açık Erişim