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

Forrest Briggs

dblp:82/1237 · DBLP profile ↗
← Back
7ranked-venue papers
6as first author
0since 2021 · last 2016
—ORCID · none

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

Databases, data management, data science and information retrieval · 5 · 5 first-authorArtificial intelligence and machine learning · 4 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author

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.

Artificial intelligence
1 paper
Deep learning architectures and training · 67% Learning paradigms · 33%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Computer graphics and multimedia
1 paper
Audio and music processing · 100%

Topics — the 5 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › clustering
novel category discovery
0.212016
Multi-Instance Multi-Label Class Discovery: A Computational Approach for Assessing Bird Biodiversity · AAAI 2016
Machine learning › Deep learning architectures and training › data-centric deep learning
instance annotation
0.112012
Rank-loss support instance machines for MIML instance annotation · KDD 2012
Machine learning › Learning paradigms › multiple instance learning
multi-instance multi-label learning
0.112012
Rank-loss support instance machines for MIML instance annotation · KDD 2012
Machine learning › Deep learning architectures and training › loss function design
ranking loss
0.112012
Rank-loss support instance machines for MIML instance annotation · KDD 2012
Bioinformatics and computational biology
bioacoustics
0.012009
Audio Classification of Bird Species: A Statistical Manifold Approach · ICDM 2009

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

multi-instance multi-label learning · 0.5support instance machines · 0.1primal sub-gradient descent · 0.1aggregation models · 0.1statistical manifold · 0.1nearest neighbor classifier · 0.1kullback-leibler divergence · 0.1hellinger metric · 0.1fisher information metric · 0.1
YearPublicationVenuePosition
2016 Multi-Instance Multi-Label Class Discovery: A Computational Approach for Assessing Bird Biodiversity
abstract
We study the problem of analyzing a large volume ofbioacoustic data collected in-situ with the goal of assessingthe biodiversity of bird species at the data collectionsite. We are interested in the class discoveryproblem for this setting. Specifically, given a large collectionof audio recordings containing bird and othersounds, we aim to automatically select a fixed size subsetof the recordings for human expert labeling suchthat the maximum number of species/classes is discovered.We employ a multi-instance multi-label representationto address multiple simultaneously vocalizingbirds with sounds that overlap in time, and proposenew algorithms for species/class discovery using thisrepresentation. In a comparative study, we show that theproposed methods discover more species/classes thancurrent state-of-the-art in a real world datasetof 92,095 ten-second recordings collected in field conditions.
Forrest Briggs, Xiaoli Z. Fern, Raviv Raich, Matthew Betts
AAAI1
2015 Context-aware MIML instance annotation: exploiting label correlations with classifier chains
Forrest Briggs, Xiaoli Z. Fern, Raviv Raich
Knowl. Inf. Syst.1
2013 Context-Aware MIML Instance Annotation
abstract
In multi-instance multi-label (MIML) instance annotation, the goal is to learn an instance classifier while training on a MIML dataset, which consists of bags of instances paired with label sets, instance labels are not provided in the training data. The MIML formulation can be applied in many domains. For example, in an image domain, bags are images, instances are feature vectors representing segments in the images, and the label sets are lists of objects or categories present in each image. Although many MIML algorithms have been developed for predicting the label set of a new bag, only a few have been specifically designed to predict instance labels. We propose MIML-ECC (ensemble of classifier chains), which exploits bag-level context through label correlations to improve instance-level prediction accuracy. The proposed method is scalable in all dimensions of a problem (bags, instances, classes, and feature dimension), and has no parameters that require tuning (which is a problem for prior methods). In experiments on two image datasets, a bioacoustics dataset, and two artificial datasets, MIML-ECC achieves higher or comparable accuracy in comparison to several recent methods and baselines.
Forrest Briggs, Xiaoli Z. Fern, Raviv Raich
ICDM1
2013 Instance Annotation for Multi-Instance Multi-Label Learning
Forrest Briggs, Xiaoli Z. Fern, Raviv Raich, Qi Lou
ACM Trans. Knowl. Discov. Data1
2012 Rank-loss support instance machines for MIML instance annotation
abstract
Multi-instance multi-label learning (MIML) is a framework for supervised classification where the objects to be classified are bags of instances associated with multiple labels. For example, an image can be represented as a bag of segments and associated with a list of objects it contains. Prior work on MIML has focused on predicting label sets for previously unseen bags. We instead consider the problem of predicting instance labels while learning from data labeled only at the bag level. We propose Rank-Loss Support Instance Machines, which optimize a regularized rank-loss objective and can be instantiated with different aggregation models connecting instance-level predictions with bag-level predictions. The aggregation models that we consider are equivalent to defining a "support instance" for each bag, which allows efficient optimization of the rank-loss objective using primal sub-gradient descent. Experiments on artificial and real-world datasets show that the proposed methods achieve higher accuracy than other loss functions used in prior work, e.g., Hamming loss, and recent work in ambiguous label classification.
Forrest Briggs, Xiaoli Z. Fern, Raviv Raich
KDD1
2011 Time-frequency segmentation of bird song in noisy acoustic environments
abstract
Recent work in machine learning considers the problem of identifying bird species from an audio recording. Most methods require segmentation to isolate each syllable of bird call in input audio. Energy-based time-domain segmentation has been successfully applied to low-noise, single-bird recordings. However, audio from automated field recorders contains too much noise for such methods, so a more robust segmentation method is required. We propose a supervised time frequency audio segmentation method using a Random Forest classifier, to extract syllables of bird call from a noisy signal. When applied to a test data set of 625 field-collected audio segments, our method isolates 93.6% of the acoustic energy of bird song with a false positive rate of 8.6%, outperforming energy thresholding.
Lawrence Neal, Forrest Briggs, Raviv Raich, Xiaoli Z. Fern
ICASSP2
2009 Audio Classification of Bird Species: A Statistical Manifold Approach
abstract
Our goal is to automatically identify which species of bird is present in an audio recording using supervised learning. Devising effective algorithms for bird species classification is a preliminary step toward extracting useful ecological data from recordings collected in the field. We propose a probabilistic model for audio features within a short interval of time, then derive its Bayes risk-minimizing classifier, and show that it is closely approximated by a nearest-neighbor classifier using Kullback-Leibler divergence to compare histograms of features. We note that feature histograms can be viewed as points on a statistical manifold, and KL divergence approximates geodesic distances defined by the Fisher information metric on such manifolds. Motivated by this fact, we propose the use of another approximation to the Fisher information metric, namely the Hellinger metric. The proposed classifiers achieve over 90% accuracy on a data set containing six species of bird, and outperform support vector machines.
Forrest Briggs, Raviv Raich, Xiaoli Z. Fern
ICDM1