default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBelgin Ergenç
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Belgin Ergenç Bostanoglu, Nourhan Abuzayed:
Dynamic frequent subgraph mining algorithms over evolving graphs: a survey. PeerJ Comput. Sci. 10: e2361 (2024)- [j10]Büsra Çalmaz, Belgin Ergenç Bostanoglu
:
BDAC: Boundary-Driven Approximations of K-Cliques. Symmetry 16(8): 983 (2024) - 2020
- [j9]Belgin Ergenç Bostanoglu, Ahmet Cumhur Öztürk:
Minimizing information loss in shared data: Hiding frequent patterns with multiple sensitive support thresholds. Stat. Anal. Data Min. 13(4): 309-323 (2020)
2010 – 2019
- 2018
- [j8]Büsra Güvenoglu, Belgin Ergenç Bostanoglu:
A qualitative survey on frequent subgraph mining. Open Comput. Sci. 8(1): 194-209 (2018) - [j7]Ahmet Cumhur Öztürk, Belgin Ergenç:
Dynamic Itemset Hiding Algorithm for Multiple Sensitive Support Thresholds. Int. J. Data Warehous. Min. 14(2): 37-59 (2018) - 2017
- [j6]Damla Oguz, Shaoyi Yin, Belgin Ergenç, Abdelkader Hameurlain, Oguz Dikenelli:
Extended Adaptive Join Operator with Bind-Bloom Join for Federated SPARQL Queries. Int. J. Data Warehous. Min. 13(3): 47-72 (2017) - [c8]Ahmet Cumhur Öztürk, Belgin Ergenç Bostanoglu:
Itemset Hiding under Multiple Sensitive Support Thresholds. KMIS 2017: 222-231 - [c7]Nourhan Abuzayed, Belgin Ergenç:
Comparison of Dynamic Itemset Mining Algorithms for Multiple Support Thresholds. IDEAS 2017: 309-316 - [c6]Sadeq Darrab, Belgin Ergenc:
Vertical Pattern Mining Algorithm for Multiple Support Thresholds. KES 2017: 417-426 - 2016
- [c5]Damla Oguz, Shaoyi Yin, Abdelkader Hameurlain, Belgin Ergenc, Oguz Dikenelli:
Adaptive Join Operator for Federated Queries over Linked Data Endpoints. ADBIS 2016: 275-290 - [c4]Nourhan Abuzayed, Belgin Ergenc:
Dynamic Itemset Mining Under Multiple Support Thresholds. FSDM 2016: 141-148 - 2015
- [j5]Tolga Ayav, Belgin Ergenc:
Full-Exact Approach for Frequent Itemset Hiding. Int. J. Data Warehous. Min. 11(4): 49-63 (2015) - [j4]Damla Oguz, Belgin Ergenc, Shaoyi Yin, Oguz Dikenelli, Abdelkader Hameurlain:
Federated query processing on linked data: a qualitative survey and open challenges. Knowl. Eng. Rev. 30(5): 545-563 (2015) - 2013
- [j3]Damla Oguz, Baris Yildiz, Belgin Ergenc:
DMA: Matrix Based Dynamic Itemset Mining Algorithm. Int. J. Data Warehous. Min. 9(4): 62-75 (2013) - 2012
- [c3]Beakal Gizachew Assefa, Belgin Ergenc:
OrderBased Labeling Scheme for Dynamic XML Query Processing. CD-ARES 2012: 287-301 - [c2]Damla Oguz, Belgin Ergenc:
Incremental Itemset Mining Based on Matrix Apriori Algorithm. DaWaK 2012: 192-204
2000 – 2009
- 2007
- [c1]Belgin Ergenc, Franck Morvan, Abdelkader Hameurlain:
Robust Placement of Mobile Relational Operators for Large Scale Distributed Query Optimization. PDCAT 2007: 227-235 - 2005
- [j2]Belgin Ozakar, Franck Morvan, Abdelkader Hameurlain:
Query optimization mobile agents versus accuracy of the cost estimation. Comput. Syst. Sci. Eng. 20(3) (2005) - [j1]Belgin Ozakar, Franck Morvan, Abdelkader Hameurlain:
Mobile join operators for restricted sources. Mob. Inf. Syst. 1(3): 167-184 (2005)
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-12-09 23:08 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:
