Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Simon Perkins

dblp:28/5291 · DBLP profile ↗
← Back
12ranked-venue papers
3as first author
1since 2021 · last 2021
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 8 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 4 · 1 since 2021Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Artificial intelligence
2 papers
Representation and self-supervised learning · 56% Efficient and distributed learning · 44%

Topics — the 8 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › gene expression analysis
gene expression meta-analysis
0.512021
An OMICs-based meta-analysis to support infection state stratification · Bioinform. 2021
Bioinformatics and computational biology
immunoinformatics
0.112008
Web-based design and evaluation of T-cell vaccine candidates · Bioinform. 2008
Bioinformatics and computational biology › immunoinformatics
vaccine design
0.112008
Web-based design and evaluation of T-cell vaccine candidates · Bioinform. 2008
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
feature selection
0.122003
Grafting: Fast, Incremental Feature Selection by Gradient Descent in Function Space · J. Mach. Learn. Res. 2003
Online Feature Selection using Grafting · ICML 2003
Machine learning › Efficient and distributed learning › data reduction
online feature selection
0.012003
Online Feature Selection using Grafting · ICML 2003
Data mining
anomaly detection
0.012003
Online novelty detection on temporal sequences · KDD 2003
Data mining › anomaly detection
novelty detection
0.012003
Online novelty detection on temporal sequences · KDD 2003
Data mining › temporal data mining
temporal sequence mining
0.012003
Online novelty detection on temporal sequences · KDD 2003

Methods — techniques the papers use, named apart from their topics

regulatory network reverse engineering · 0.5machine learning · 0.5mosaic method · 0.1k-mer coverage · 0.1online support vector regression · 0.0grafting · 0.0gradient descent · 0.0
YearPublicationVenuePosition
2021 An OMICs-based meta-analysis to support infection state stratification
abstract
MOTIVATION: A fundamental problem for disease treatment is that while antibiotics are a powerful counter to bacteria, they are ineffective against viruses. Often, bacterial and viral infections are confused due to their similar symptoms and lack of rapid diagnostics. With many clinicians relying primarily on symptoms for diagnosis, overuse and misuse of modern antibiotics are rife, contributing to the growing pool of antibiotic resistance. To ensure an individual receives optimal treatment given their disease state and to reduce over-prescription of antibiotics, the host response can in theory be measured quickly to distinguish between the two states. To establish a predictive biomarker panel of disease state (viral/bacterial/no-infection), we conducted a meta-analysis of human blood infection studies using machine learning. RESULTS: We focused on publicly available gene expression data from two widely used platforms, Affymetrix and Illumina microarrays as they represented a significant proportion of the available data. We were able to develop multi-class models with high accuracies with our best model predicting 93% of bacterial and 89% viral samples correctly. To compare the selected features in each of the different technologies, we reverse-engineered the underlying molecular regulatory network and explored the neighbourhood of the selected features. The networks highlighted that although on the gene-level the models differed, they contained genes from the same areas of the network. Specifically, this convergence was to pathways including the Type I interferon Signalling Pathway, Chemotaxis, Apoptotic Processes and Inflammatory/Innate Response. AVAILABILITY: Data and code are available on the Gene Expression Omnibus and github. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Ashleigh C. Myall, Simon Perkins, David Rushton, Jonathan David, Phillippa Spencer, Andrew R. Jones, Philipp Antczak
Bioinform.2
2008 Web-based design and evaluation of T-cell vaccine candidates
abstract
Abstract Summary: We present a suite of on-line tools to design candidate vaccine proteins, and to assess antigen potential, using coverage of k-mers (as proxies for potential T-cell epitopes) as a metric. The vaccine design tool uses the recently published ‘mosaic’ method to generate protein sequences optimized for coverage of high-frequency k-mers; the coverage-assessment tools facilitate coverage comparisons for any potential antigens. To demonstrate these tools, we designed mosaic protein sets for B-clade HIV-1 Gag, Pol and Nef, and compared them to antigens used in a recent human vaccine trial. Availability: http://hiv.lanl.gov/content/sequence/MOSAIC/ Contact: [email protected] Supplementary information: Supplementary data are available at ftp://ftp-t10.lanl.gov/pub/btk/WebToolsData
Jim Thurmond, Hyejin Yoon, Carla Kuiken, Karina Yusim, Simon Perkins, James Theiler, Tanmoy Bhattacharya 0001, Bette T. Korber, Will Fischer 0001
Bioinform.5
2006 Incorporating Spatial Contiguity into the Design of a Support Vector Machine Classifier
abstract
We describe a modification of the standard support vector machine (SVM) classifier that exploits the tendency for spatially contiguous pixels to be similarly classified. A quadratic term characterizing the spatial correlations in a multispectral image is added into the standard SVM optimization criterion. The mathematical structure of the SVM programming problem is retained, and the solution can be expressed in terms of the ordinary SVM solution with a modified dot product. The spatial correlations are characterized by a "contiguity matrix" psi whose computation does not require labeled data; thus, the method provides a way to use a mix of labeled and unlabeled data. We present numerical comparisons of classification performance for this contiguity-enhanced SVM against a standard SVM for two multispectral data sets.
Murat Dundar, James Theiler, Simon Perkins
IGARSS3
2004 Two realizations of a general feature extraction framework
Junshui Ma, James Theiler, Simon Perkins
Pattern Recognit.3
2003 Online Feature Selection using Grafting
Simon Perkins, James Theiler
ICML1
2003 Time-series novelty detection using one-class support vector machines
abstract
Time-series novelty detection, or anomaly detection, refers to the automatic identification of novel or abnormal events embedded in normal time-series points. Although it is a challenging topic in data mining, it has been acquiring increasing attention due to its huge potential for immediate applications. In this paper, a new algorithm for time-series novelty detection based on one-class support vector machines (SVMs) is proposed. The concepts of phase and projected phase spaces are first introduced, which allows us to convert a time-series into a set of vectors in the (projected) phase spaces. Then we interpret novel events in time-series as outliers of the "normal" distribution of the converted vectors in the (projected) phase spaces. One-class SVMs are employed as the outlier detectors. In order to obtain robust detection results, a technique to combine intermediate results at different phase spaces is also proposed. Experiments on both synthetic and measured data are presented to demonstrate the promising performance of the new algorithm.
Junshui Ma, Simon Perkins
IJCNN2
2003 Online novelty detection on temporal sequences
abstract
In this paper, we present a new framework for online novelty detection on temporal sequences. This framework include a mechanism for associating each detection result with a confidence value. Based on this framework, we develop a concrete online detection algorithm, by modeling the temporal sequence using an online support vector regression algorithm. Experiments on both synthetic and real world data are performed to demonstrate the promising performance of our proposed detection algorithm.
Junshui Ma, Simon Perkins
KDD2
2003 Grafting: Fast, Incremental Feature Selection by Gradient Descent in Function Space
Simon Perkins, Kevin Lacker, James Theiler
J. Mach. Learn. Res.1
2003 Accurate On-line Support Vector Regression
abstract
Batch implementations of support vector regression (SVR) are inefficient when used in an on-line setting because they must be retrained from scratch every time the training set is modified. Following an incremental support vector classification algorithm introduced by Cauwenberghs and Poggio (2001), we have developed an accurate on-line support vector regression (AOSVR) that efficiently updates a trained SVR function whenever a sample is added to or removed from the training set. The updated SVR function is identical to that produced by a batch algorithm. Applications of AOSVR in both on-line and cross-validation scenarios are presented. In both scenarios, numerical experiments indicate that AOSVR is faster than batch SVR algorithms with both cold and warm start.
Junshui Ma, James Theiler, Simon Perkins
Neural Comput.3
2002 Modified Kernel-based Nonlinear Feature Extraction
Junshui Ma, Simon Perkins, James Theiler, Stanley C. Ahalt
ICMLA2
2002 Comparison of GENIE and conventional supervised classifiers for multispectral image feature extraction
abstract
Abstract — We have developed an automated feature detection/classification system, called Genie (GENetic Imagery Exploitation), which has been designed to generate image processing pipelines for a variety of feature detection/classification tasks. Genie is a hybrid evolutionary algorithm that addresses the general problem of finding features of interest in multi-spectral remotely-sensed images. We describe our system in detail together with experiments involving comparisons of Genie with several conventional supervised classification techniques, for a number of classification tasks using multi-spectral remotely-sensed imagery.
Neal R. Harvey, James Theiler, Steven P. Brumby, Simon Perkins, John J. Szymanski, Jeffrey J. Bloch, Reid B. Porter, Mark Galassi, A. Cody Young
IEEE Trans. Geosci. Remote. Sens.4
1999 Evolving robot vision: increasing performance through shaping
abstract
Automated methods for designing robot controllers based on machine-learning techniques have shown great promise when applied to simple robot tasks, but in order to 'scale up' to more complicated problems they will require assistance from human experts, a process that is often called 'robot shaping'. In this paper, the difficult problem of learning how to visually track moving objects is examined. It is shown that through the use of shaping techniques, this intractable learning problem can be made solvable. Controllers are evolved in simulation and then transferred to a real robot.
Simon Perkins
CEC1