default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMehmet M. Dalkilic
Person information
- affiliation: Indiana University, Bloomington, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c28]Ganesh Arkanath, Nishad Gupta, Hasan Kurban, Parichit Sharma, K. R. Madhavan, Elham Khorasani Buxton, Mehmet M. Dalkilic:
Novel NBA Fantasy League driven by Engineered Team Chemistry and Scaled Position Statistics. IEEE Big Data 2023: 4268-4275- 2022
- [j8]Marcin Malec, Hasan Kurban
, Mehmet M. Dalkilic:
ccImpute: an accurate and scalable consensus clustering based algorithm to impute dropout events in the single-cell RNA-seq data. BMC Bioinform. 23(1): 291 (2022) - [j7]Parichit Sharma, Hasan Kurban, Mehmet M. Dalkilic:
DCEM: An R package for clustering big data via data-centric modification of Expectation Maximization. SoftwareX 17: 100944 (2022) - 2020
- [c27]Xiaomeng Ye, David Leake, William Huibregtse, Mehmet M. Dalkilic:
Applying Class-to-Class Siamese Networks to Explain Classifications with Supportive and Contrastive Cases. ICCBR 2020: 245-260
2010 – 2019
- 2018
- [c26]Kurt Zimmer, Hasan Kurban, Mark Jenne, Logan Keating, Perry Maull, Mehmet M. Dalkilic:
Using Data Analytics to Optimize Public Transportation on a College Campus. DSAA 2018: 460-469 - [r4]Mehmet M. Dalkiliç:
Biostatistics and Data Analysis. Encyclopedia of Database Systems (2nd ed.) 2018 - [r3]Mehmet M. Dalkiliç:
Gene Expression Arrays. Encyclopedia of Database Systems (2nd ed.) 2018 - 2017
- [j6]Hasan Kurban, Mark Jenne, Mehmet M. Dalkilic:
Using data to build a better EM: EM* for big data. Int. J. Data Sci. Anal. 4(2): 83-97 (2017) - [c25]Hasan Kurban, Can Kockan, Mark Jenne, Mehmet M. Dalkilic:
Case Study: Clustering Big Stellar Data with EM. BDCAT 2017: 271-272 - [c24]Hasan Kurban, Mehmet M. Dalkilic:
A novel approach to optimization of iterative machine learning algorithms: Over heap structure. IEEE BigData 2017: 102-109 - [c23]Hasan Kurban, Can Kockan, Mark Jenne, Mehmet M. Dalkilic:
Improving expectation maximization algorithm over stellar data. IEEE BigData 2017: 2559-2568 - 2016
- [j5]Kurt Zimmer, Yilun Zhang, Peng Lu, Yanyan Chen, Guanru Zhang, Mehmet M. Dalkilic, Chen Zhu:
SUPCRTBL: A revised and extended thermodynamic dataset and software package of SUPCRT92. Comput. Geosci. 90: 97-111 (2016) - [c22]Hasan Kurban, Mark Jenne, Mehmet M. Dalkilic:
EM*: An EM Algorithm for Big Data. DSAA 2016: 312-320 - 2015
- [c21]Hussein Mohsen, Hasan Kurban, Kurt Zimmer, Mark Jenne, Mehmet M. Dalkiliç:
Red-RF: Reduced Random Forest for Big Data Using Priority Voting & Dynamic Data Reduction. BigData Congress 2015: 118-125 - [c20]Gregory J. Zynda, Niall Gaffney, Mehmet M. Dalkilic, Matthew W. Vaughn:
Feature frequency profiles for automatic sample identification using PySpark. PyHPC@SC 2015: 5:1-5:5 - 2014
- [j4]Mark Jenne, Owen Boberg, Hasan Kurban, Mehmet M. Dalkilic:
Studying the Milky Way Galaxy Using ParaHeap-k. Computer 47(9): 26-33 (2014) - [c19]Hussein Mohsen, Hasan Kurban, Mark Jenne, Mehmet M. Dalkilic:
A new set of Random Forests with varying dynamic data reduction and voting techniques. DSAA 2014: 399-405 - 2012
- [c18]Jiong Yang, Wei Su, Shirong Li, Mehmet M. Dalkiliç:
WIGM: Discovery of Subgraph Patterns in a Large Weighted Graph. SDM 2012: 1083-1094
2000 – 2009
- 2009
- [c17]James C. Costello, Daniel R. Schrider, Jeff Gehlhausen, Mehmet M. Dalkilic:
Data-Driven Ontologies. Pacific Symposium on Biocomputing 2009: 15-26 - [p1]Henry M. Kim, Arijit Sengupta, Mark S. Fox, Mehmet M. Dalkilic:
A Measurement Ontology Generalizable for Emerging Domain Applications on the Semantic Web. Database Technologies: Concepts, Methodologies, Tools, and Applications 2009: 2384-2404 - [r2]Mehmet M. Dalkiliç:
Biostatistics and Data Analysis. Encyclopedia of Database Systems 2009: 236-238 - [r1]Mehmet M. Dalkilic:
Gene Expression Arrays. Encyclopedia of Database Systems 2009: 1218-1221 - 2007
- [j3]Henry M. Kim, Arijit Sengupta, Mark S. Fox, Mehmet M. Dalkilic:
A Measurement Ontology Generalizable for Emerging Domain Applications on the Semantic Web. J. Database Manag. 18(1): 20-42 (2007) - [c16]James C. Costello, Jade E. Buchanan-Carter, Mehmet M. Dalkilic, Justen Andrews:
Using Drosophila melanogaster Data to Discover Disease-Related Protein Interactions in Humans. CIBCB 2007: 469-475 - 2006
- [j2]Do-Hoon Lee, Jeong-Hyeon Choi, Mehmet M. Dalkilic, Sun Kim:
COMPAM : visualization of combining pairwise alignments for multiple genomes. Bioinform. 22(2): 242-244 (2006) - [j1]Christopher Mueller, Mehmet M. Dalkilic, Andrew Lumsdaine:
High-Performance Direct Pairwise Comparison of Large Genomic Sequences. IEEE Trans. Parallel Distributed Syst. 17(8): 764-772 (2006) - [c15]Sukamol Srikwan, Markus Jakobsson, Andrew Albrecht, Mehmet M. Dalkilic:
Trust Establishment in Data Sharing: An Incentive Model for Biodiversity Information Systems. CollaborateCom 2006 - [c14]Mehmet M. Dalkilic, Wyatt T. Clark, James C. Costello, Predrag Radivojac:
Using Compression to Identify Classes of Inauthentic Texts. SDM 2006: 604-608 - [c13]Rupali Patwardhan, Haixu Tang, Sun Kim, Mehmet M. Dalkilic:
An Approximate de Bruijn Graph Approach to Multiple Local Alignment and Motif Discovery in Protein Sequences. VDMB 2006: 158-169 - [e1]Mehmet M. Dalkilic, Sun Kim, Jiong Yang:
Data Mining and Bioinformatics, First International Workshop, VDMB 2006, Seoul, Korea, September 11, 2006, Revised Selected Papers. Lecture Notes in Computer Science 4316, Springer 2006, ISBN 3-540-68970-2 [contents] - 2005
- [c12]Mehmet M. Dalkilic:
An Architecture and Application for Integrating Curation Data at the Residue Level for Proteins. DILS 2005: 335-338 - [c11]Christopher Mueller, Mehmet M. Dalkilic, Andrew Lumsdaine:
High-Performance Direct Pairwise Comparison of Large Genomic Sequences. IPDPS 2005 - [c10]Mehmet M. Dalkilic, Arijit Sengupta:
Design and evaluation of CATPA: curation and alignment tool for protein analysis. SAC 2005: 190-194 - [c9]Mehmet M. Dalkilic, Arijit Sengupta:
Circle: design and implementation of a classifier based on circuit minimization. SAC 2005: 547-548 - 2004
- [c8]Mehmet M. Dalkilic, Arijit Sengupta:
A logic-theoretic classifier called Circle. ICARCV 2004: 1043-1048 - [c7]Zhiping Wang, Mehmet M. Dalkilic, Sun Kim:
Guiding motif discovery by iterative pattern refinement. SAC 2004: 162-166 - [c6]Arijit Sengupta, Mehmet M. Dalkilic, James C. Costello:
Semantic thumbnails: a novel method for summarizing document collections. SIGDOC 2004: 45-51 - 2003
- [c5]Irfan Gunduz, Sihui Zhao, Mehmet M. Dalkilic, Sun Kim:
Motif Discovery from Large Number of Sequences: A Case Study with Disease Resistance Genes in Arabidopsos thaliana. METMBS 2003: 29-34 - 2002
- [c4]Chris Giannella, Mehmet M. Dalkilic, Dennis P. Groth, Edward L. Robertson:
Improving Query Evaluation with Approximate Functional Dependency Based Decompositions. BNCOD 2002: 26-41 - [c3]Arijit Sengupta, Mehmet M. Dalkilic:
DSQL - An SQL for Structured Documents. CAiSE 2002: 757-760 - 2000
- [c2]Mehmet M. Dalkilic, Edward L. Robertson:
Information Dependencies. PODS 2000: 245-253
1990 – 1999
- 1997
- [c1]Mehmet M. Dalkilic, Edward L. Robertson, Dirk Van Gucht:
CE: the Classifier-Estimator Framework for Data Mining. DS-7 1997: 89-104
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-04-24 22:54 CEST 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:
