Name
Papers
Collaborators
GEOFFREY I. WEBB
152
225
Citations 
PageRank 
Referers 
3130
234.10
5510
Referees 
References 
2402
2000
Search Limit
1001000
Title
Citations
PageRank
Year
ASPIRER: a new computational approach for identifying non-classical secreted proteins based on deep learning00.342022
An eager splitting strategy for online decision trees in ensembles00.342022
Smooth Perturbations for Time Series Adversarial Attacks00.342022
DEMoS: a deep learning-based ensemble approach for predicting the molecular subtypes of gastric adenocarcinomas from histopathological images00.342022
PROST: AlphaFold2-aware Sequence-Based Predictor to Estimate Protein Stability Changes upon Missense Mutations.00.342022
Multi-modal temporal CNNs for live fuel moisture content estimation00.342022
Critical assessment of computational tools for prokaryotic and eukaryotic promoter prediction00.342022
MultiRocket: multiple pooling operators and transformations for fast and effective time series classification00.342022
OCTID: a one-class learning-based Python package for tumor image detection00.342021
Early abandoning and pruning for elastic distances including dynamic time warping10.362021
Time Series Classification at Scale.00.342020
Procleave: Predicting Protease-specific Substrate Cleavage Sites by Combining Sequence and Structural Information10.352020
A novel selective naïve Bayes algorithm.00.342020
TS-CHIEF: A Scalable and Accurate Forest Algorithm for Time Series Classification.00.342019
A tutorial on statistically sound pattern discovery90.492019
iProt-Sub: a comprehensive package for accurately mapping and predicting protease-specific substrates and cleavage sites.50.432019
Positive-unlabelled learning of glycosylation sites in the human proteome.10.352019
Survey of distance measures for quantifying concept drift and shift in numeric data20.362019
Exploring Data Quantity Requirements for Domain Adaptation in the Classification of Satellite Image Time Series00.342019
Adaptive online extreme learning machine by regulating forgetting factor by concept drift map.00.342019
Mining Significant Crisp-Fuzzy Spatial Association Rules10.352018
Efficient and Effective Accelerated Hierarchical Higher-Order Logistic Regression for Large Data Quantities.00.342018
Critical evaluation of bioinformatics tools for the prediction of protein crystallization propensity.20.432018
iFeature: a Python package and web server for features extraction and selection from protein and peptide sequences.200.672018
Efficient search of the best warping window for Dynamic Time Warping.20.372018
On the Inter-relationships among Drift rate, Forgetting rate, Bias/variance profile and Error.00.342018
Elastic bands across the path: A new framework and methods to lower bound DTW.20.372018
Selective AnDE for large data learning: a low-bias memory constrained approach.50.432017
Indexing and classifying gigabytes of time series under time warping.40.402017
Specious rules: an efficient and effective unifying method for removing misleading and uninformative patterns in association rule mining.20.372017
A multiple test correction for streams and cascades of statistical hypothesis tests40.412016
Skopus: Mining top-k sequential patterns under leverage.00.342016
Mining significant association rules from uncertain data50.422016
Faster and more accurate classification of time series by exploiting a novel dynamic time warping averaging algorithm.310.912016
Scalable Learning of Bayesian Network Classifiers.10.352016
Deep Broad Learning - Big Models for Big Data30.462015
Scaling log-linear analysis to datasets with thousands of variables.30.422015
Exact discovery of the most interesting sequential patterns00.342015
GlycoMine: a machine learning-based approach for predicting N-, C- and O-linked glycosylation in the human proteome.200.762015
Highly Scalable Attribute Selection for Averaged One-Dependence Estimators.40.412014
Dynamic Time Warping Averaging of Time Series Allows Faster and More Accurate Classification511.642014
Fast and Effective Single Pass Bayesian Learning.30.392013
Panel: a data scientist's guide to making money from start-ups00.342013
Efficient Discovery of the Most Interesting Associations160.752013
Subsumption resolution: an efficient and effective technique for semi-naive Bayesian learning130.612012
Discovering associations in high-dimensional data00.342012
Feature-subspace aggregating: ensembles for stable and unstable learners210.942011
ICDM 2010, The 10th IEEE International Conference on Data Mining, Sydney, Australia, 14-17 December 201016217.182010
EGM: encapsulated gene-by-gene matching to identify gene orthologs and homologous segments in genomes.20.372010
Self-sufficient itemsets: An approach to screening potentially interesting associations between items281.072010
  • 1
  • 2