default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGünce Keziban Orman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j5]Sükrü Demir Inan Özer, Günce Keziban Orman
:
Experimental evaluation of the effect of community structures on link prediction. Inf. Sci. 689: 121394 (2025)- 2024
- [j4]Afra Arslan, Koray Tecimer, Hacer Turgut, Ömür Bali, Tayfun Arda Yücel, Gülfem Isiklar Alptekin, Günce Keziban Orman:
A Comprehensive Framework for Measuring the Immediate Impact of TV Advertisements: TV-Impact. Entropy 26(2): 109 (2024) - 2022
- [j3]Günce Keziban Orman:
Dynamic network modelling with similarity based aggregation algorithm. Comput. Sci. Inf. Syst. 19(2): 1023-1046 (2022) - 2015
- [j2]Günce Keziban Orman, Vincent Labatut, Marc Plantevit, Jean-François Boulicaut:
Interpreting communities based on the evolution of a dynamic attributed network. Soc. Netw. Anal. Min. 5(1): 20:1-20:22 (2015) - 2013
- [j1]Günce Keziban Orman, Vincent Labatut, Hocine Cherifi:
Towards realistic artificial benchmark for community detection algorithms evaluation. Int. J. Web Based Communities 9(3): 349-370 (2013)
Conference and Workshop Papers
- 2024
- [c21]Sükrü Demir Inan Özer, Günce Keziban Orman:
Enhanced Item Recommendation via Graph Properties in Sparse Data. AIAI (4) 2024: 111-124 - [c20]Özgür Anil Özlü, Günce Keziban Orman, Sultan N. Turhan:
Exploring Graph-Based Techniques in Job Recommendation Systems. IS 2024: 1-6 - 2023
- [c19]Kutay Acar, Günce Keziban Orman, Sultan Nezihe Turhan:
An Empirical Study of Covid-19 Effect on Health Care Workers' Career Development. IEEE Big Data 2023: 4826-4833 - [c18]Sena Atakan, Günce Keziban Orman:
On the usage of Benford's Law on coronavirus data statistics. IEEE Big Data 2023: 4848-4853 - [c17]Elif Ece Erdem, Günce Keziban Orman:
On the role of user segmentation in recommender systems' performances. KES 2023: 2333-2342 - [c16]Fatma Gizem Çalli, Günce Keziban Orman:
Job Seeker Recommendation for Employers: A Graph-Based Recommendation Approach Using Node Embedding. KES 2023: 3660-3669 - 2022
- [c15]Atakan Kara, F. Serhan Danis, Günce Keziban Orman, Sultan Nezihe Turhan:
Extracting Relations Between Sectors. BDCAT 2022: 77-82 - [c14]Seref Recep Keskin, Yavuz Bali, Günce Keziban Orman, F. Serhan Danis, Sultan N. Turhan:
Determining Column Numbers in Résumés with Clustering. AIAI (2) 2022: 460-471 - [c13]Sükrü Demir Inan Özer, Berkay Ülke, F. Serhan Danis, Günce Keziban Orman:
Salary Prediction via Sectoral Features in Turkey. INISTA 2022: 1-6 - [c12]Atakan Kara, F. Serhan Danis, Günce Keziban Orman, Sultan N. Turhan, Özgür Anil Özlü:
Job Recommendation Based on Extracted Skill Embeddings. IntelliSys (3) 2022: 497-507 - [c11]Özgür Anil Özlü, Günce Keziban Orman, F. Serhan Danis, Sultan N. Turhan, K. Can Kara, Tayfun Arda Yücel:
Similarity-Based Résumé Matching via Triplet Loss with BERT Models. IntelliSys (3) 2022: 520-532 - 2021
- [c10]Damla Sentürk, Günce Keziban Orman:
Detecting Genetic Disposition of Ethnicity to Autoimmune Diseases via Clustering. IEEE BigData 2021: 4761-4769 - [c9]Günce Keziban Orman, Serhat Çolak:
Similarity Based Compression Ratio for Dynamic Network Modelling. EUROCON 2021: 227-232 - [c8]Serhat Çolak, Günce Keziban Orman:
Aggregating Time Windows for Dynamic Network Extraction. INISTA 2021: 1-6 - 2015
- [c7]Günce Keziban Orman, Onur Karadeli, Emre ÇaliotaSiotar:
Overlapping Communities via k-Connected Ego Centered Groups. ASONAM 2015: 1598-1599 - 2014
- [c6]Günce Keziban Orman, Vincent Labatut, Marc Plantevit, Jean-François Boulicaut:
A method for characterizing communities in dynamic attributed complex networks. ASONAM 2014: 481-484 - [c5]Günce Keziban Orman, Vincent Labatut, Marc Plantevit, Jean-François Boulicaut:
Une méthode pour caractériser les communautés des réseaux dynamiques à attributs. EGC 2014: 101-112 - 2012
- [c4]Günce Keziban Orman, Vincent Labatut, Hocine Cherifi:
An Empirical Study of the Relation between Community Structure and Transitivity. CompleNet 2012: 99-110 - 2011
- [c3]Günce Keziban Orman, Vincent Labatut, Hocine Cherifi:
Qualitative Comparison of Community Detection Algorithms. DICTAP (2) 2011: 265-279 - 2010
- [c2]Günce Keziban Orman, Vincent Labatut:
The Effect of Network Realism on Community Detection Algorithms. ASONAM 2010: 301-305 - 2009
- [c1]Günce Keziban Orman, Vincent Labatut:
A Comparison of Community Detection Algorithms on Artificial Networks. Discovery Science 2009: 242-256
Reference Works
- 2018
- [r1]Vincent Labatut, Günce Keziban Orman:
Community Structure Characterization. Encyclopedia of Social Network Analysis and Mining. 2nd Ed. 2018
Informal and Other Publications
- 2024
- [i13]Sükrü Demir Inan Özer, Günce Keziban Orman, Vincent Labatut:
Link Prediction in Bipartite Networks. CoRR abs/2406.06658 (2024) - 2022
- [i12]Günce Keziban Orman, Nadir Türe, Selim Balcisoy, Hasan Alp Boz:
Finding Proper Time Intervals for Dynamic Network Extraction. CoRR abs/2206.12678 (2022) - [i11]Atakan Kara, F. Serhan Danis, Günce Keziban Orman, Sultan Nezihe Turhan:
Extracting Relations Between Sectors. CoRR abs/2208.14332 (2022) - 2017
- [i10]Günce Keziban Orman, Vincent Labatut, Ahmet Teoman Naskali:
Exploring the Evolution of Node Neighborhoods in Dynamic Networks. CoRR abs/1704.07171 (2017) - [i9]Vincent Labatut, Günce Keziban Orman:
Community Structure Characterization. CoRR abs/1705.10621 (2017) - 2015
- [i8]Günce Keziban Orman, Vincent Labatut, Marc Plantevit, Jean-François Boulicaut:
Interpreting communities based on the evolution of a dynamic attributed network. CoRR abs/1506.04693 (2015) - 2014
- [i7]Günce Keziban Orman, Vincent Labatut, Marc Plantevit, Jean-François Boulicaut:
A Method for Characterizing Communities in Dynamic Attributed Complex Networks. CoRR abs/1406.6597 (2014) - 2013
- [i6]Günce Keziban Orman, Vincent Labatut, Hocine Cherifi:
Towards realistic artificial benchmark for community detection algorithms evaluation. CoRR abs/1308.0577 (2013) - [i5]Günce Keziban Orman, Vincent Labatut, Marc Plantevit, Jean-François Boulicaut:
Une méthode pour caractériser les communautés des réseaux dynamiques à attributs. CoRR abs/1312.4676 (2013) - 2012
- [i4]Günce Keziban Orman, Vincent Labatut, Hocine Cherifi:
Comparative Evaluation of Community Detection Algorithms: A Topological Approach. CoRR abs/1206.4987 (2012) - [i3]Günce Keziban Orman, Vincent Labatut, Hocine Cherifi:
An Empirical Study of the Relation Between Community Structure and Transitivity. CoRR abs/1207.3234 (2012) - [i2]Günce Keziban Orman, Vincent Labatut, Hocine Cherifi:
Qualitative Comparison of Community Detection Algorithms. CoRR abs/1207.3603 (2012) - 2011
- [i1]Günce Keziban Orman, Vincent Labatut, Hocine Cherifi:
On Accuracy of Community Structure Discovery Algorithms. CoRR abs/1112.4134 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
