default search action
Imad Rahal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c20]Colin Glynn
, Emily Hed
CAET: Code Analysis and Education Tutor. SIGCSE (2) 2024: 1656-1657 - 2021
- [c19]Imad Rahal, Ryan Strelow, Jeremy Iverson:
Efficient Algorithmic Music Composition Using Neural Networks. FLAIRS 2021
2010 – 2019
- 2017
- [c18]Ramzi A. Haraty
A Systematic Review of Anonymous Communication Systems. ICEIS (2) 2017: 211-220 - 2016
- [c17]Imad Rahal, Emily Furst, Ramzi A. Haraty:
Parallelizing Instance-Based Data Classifiers. FLAIRS 2016: 442-447 - 2015
- [j11]Tony Ohmann, Imad Rahal:
Efficient clustering-based source code plagiarism detection using PIY. Knowl. Inf. Syst. 43(2): 445-472 (2015) - [c16]Imad Rahal, Preston Hardy, Kelsey Weiers:
Data Preprocessing via Polynomial Fitting to Improve Clustering of Spoken Arabic Digits. FLAIRS 2015: 448-451 - 2014
- [j10]Imad Rahal, Colin Wielga:
Source Code Plagiarism Detection Using Biological String Similarity Algorithms. J. Inf. Knowl. Manag. 13(3) (2014) - 2013
- [j9]Sean R. Landman, Imad Rahal:
Using naïve Bayesian classification as a meta-predictor to improve start codon prediction accuracy in prokaryotic organisms. Int. J. Data Min. Model. Manag. 5(3): 246-260 (2013) - 2011
- [j8]Baoying Wang, Imad Rahal, Aijuan Dong:
Parallel hierarchical clustering using weighted confidence affinity. Int. J. Data Min. Model. Manag. 3(2): 110-129 (2011) - 2010
- [j7]Baoying Wang, Imad Rahal, William Perrizo:
DAVYD: An iterative Density-Based Approach for Clusters with VarYing Densities. Int. J. Comput. Their Appl. 17(1): 2-15 (2010) - [c15]Jeremy Iverson, James Schnepf, Imad Rahal:
Using Metrics to Quantify Similarity in Source Code: An Empirical Study Using VOCS. SEDE 2010: 269-274 - [c14]Sean R. Landman, Imad Rahal:
Improving Start Codon Prediction Accuracy Using Naive Bayesian Classification. SEDE 2010: 289-294 - [e1]Imad Rahal, Rym Zalila-Wenkstern:
ISCA 19th International Conference on Software Engineeringand Data Engineering (SEDE-2010) June 16-18, 2010, Hilton Fisherman's Wharf, San Francisco, CA, USA. ISCA 2010, ISBN 978-1-880843-77-2 [contents]
2000 – 2009
- 2009
- [j6]Imad Rahal, Baoying Wang, Riad Rahhal
Automated Gene-Retrieval System for Biological Information Needs. J. Inf. Knowl. Manag. 8(1): 13-23 (2009) - 2008
- [j5]Imad Rahal, Riad Rahhal
CARIBIAM: Constrained Association Rules using Interactive Biological IncrementAl Mining. Int. J. Bioinform. Res. Appl. 4(1): 28-48 (2008) - [c13]Imad Rahal, Joseph Degiovanni:
Towards Efficient Source Code Plagiarism Detection: An N-gram-based Approach. CAINE 2008: 174-179 - [c12]Baoying Wang, Qin Ding, Imad Rahal:
Parallel Hierarchical Clustering on Market Basket Data. ICDM Workshops 2008: 526-532 - [c11]Imad Rahal:
Undergraduate research experiences in data mining. SIGCSE 2008: 461-465 - 2007
- [c10]Baoying Wang, Imad Rahal:
WC-Clustering: Hierarchical Clustering Using the Weighted Confidence Affinity Measure. ICDM Workshops 2007: 355-360 - 2006
- [j4]Imad Rahal, Hassan Najadat
Efficiency Considerations for Vertical KNN Text Categorisation. J. Inf. Knowl. Manag. 5(3): 211-222 (2006) - [j3]Imad Rahal, Dongmei Ren, Weihua Wu, Anne Denton, Christopher Besemann, William Perrizo:
Exploiting edge semantics in citation graphs using efficient, vertical ARM. Knowl. Inf. Syst. 10(1): 57-91 (2006) - [c9]Imad Rahal, Walid Saeed, Arun Srivastava, Pratap Kotala, Ranapratap Syamala, William Perrizo, Cesar Carvalho:
Biological, Intelligent Text-Based Ranking of Genes. SEDE 2006: 193-198 - 2005
- [c8]Imad Rahal, Dongmei Ren, Amal Perera, Hassan Najadat
Incremental interactive mining of constrained association rules from biological annotation data with nominal features. SAC 2005: 123-127 - 2004
- [j2]Imad Rahal, William Perrizo:
A Ptree-Based Framework for Accelerating MLS Database Queries. Int. J. Comput. Their Appl. 11(4): 262-269 (2004) - [j1]Imad Rahal, Dongmei Ren, William Perrizo:
A Scalable Vertical Model for Mining Association Rules. J. Inf. Knowl. Manag. 3(4): 317-329 (2004) - [c7]Fei Pan, Imad Rahal, Yue Cui, William Perrizo:
Efficient Ranking of Keyword Queries Using P-trees. CATA 2004: 278-281 - [c6]Dongmei Ren, Imad Rahal, William Perrizo, Kirk Scott:
A vertical distance-based outlier detection method with local pruning. CIKM 2004: 279-284 - [c5]Imad Rahal, Dongmei Ren, Weihua Wu, William Perrizo:
Mining Confident Minimal Rules with Fixed-Consequents. ICTAI 2004: 6-13 - [c4]Dongmei Ren, Imad Rahal, William Perrizo:
A Vertical Outlier Detection Algorithm with Clusters as By-Product. ICTAI 2004: 22-29 - [c3]Imad Rahal, William Perrizo:
An optimized approach for KNN text categorization using P-trees. SAC 2004: 613-617 - [c2]Masum Serazi, Amal Perera, Qiang Ding, Vasiliy Malakhov, Imad Rahal, Fei Pan, Dongmei Ren, Weihua Wu, William Perrizo:
DataMIME™. SIGMOD Conference 2004: 923-924 - 2003
- [c1]Imad Rahal, William Perrizo:
Accelerating Multilevel Secure Database Queries using P-Tree Technology. CATA 2003: 139-142
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-25 05:45 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: