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

Anh T. Pham 0001

dblp:25/4698-1 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2020
0000-0003-3898-2727ORCID · verified

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

Artificial intelligence and machine learning · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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.

Artificial intelligence
1 paper
Learning paradigms · 33% Deep learning architectures and training · 33% Probabilistic and Bayesian machine learning · 33%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › parameter estimation
expectation-maximization
0.312017
Dynamic Programming for Instance Annotation in Multi-Instance Multi-Label Learning · IEEE Trans. Pattern Anal. Mach. Intell. 2017
Machine learning › Deep learning architectures and training › data-centric deep learning
instance annotation
0.312017
Dynamic Programming for Instance Annotation in Multi-Instance Multi-Label Learning · IEEE Trans. Pattern Anal. Mach. Intell. 2017
Machine learning › Learning paradigms › multiple instance learning
multi-instance multi-label learning
0.312017
Dynamic Programming for Instance Annotation in Multi-Instance Multi-Label Learning · IEEE Trans. Pattern Anal. Mach. Intell. 2017
Data mining › predictive modeling
classification
0.112017
Dynamic Programming for Instance Annotation in Multi-Instance Multi-Label Learning · IEEE Trans. Pattern Anal. Mach. Intell. 2017

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

expectation-maximization · 0.6dynamic programming · 0.6discriminative probabilistic model · 0.6
YearPublicationVenuePosition
2020 A Novel Attribute-Based Symmetric Multiple Instance Learning for Histopathological Image Analysis
abstract
Histopathological image analysis is a challenging task due to a diverse histology feature set as well as due to the presence of large non-informative regions in whole slide images. In this paper, we propose a multiple-instance learning (MIL) method for image-level classification as well as for annotating relevant regions in the image. In MIL, a common assumption is that negative bags contain only negative instances while positive bags contain one or more positive instances. This asymmetric assumption may be inappropriate for some application scenarios where negative bags also contain representative negative instances. We introduce a novel symmetric MIL framework associating each instance in a bag with an attribute which can be either negative, positive, or irrelevant. We extend the notion of relevance by introducing control over the number of relevant instances. We develop a probabilistic graphical model that incorporates the aforementioned paradigm and a corresponding computationally efficient inference for learning the model parameters and obtaining an instance level attribute-learning classifier. The effectiveness of the proposed method is evaluated on available histopathology datasets with promising results.
Trung Vu 0001, Phung Lai, Raviv Raich, Anh T. Pham 0001, Xiaoli Z. Fern, Arvind U. K. Rao
IEEE Trans. Medical Imaging4
2017 Dynamic Programming for Instance Annotation in Multi-Instance Multi-Label Learning
abstract
Labeling data for classification requires significant human effort. To reduce labeling cost, instead of labeling every instance, a group of instances (bag) is labeled by a single bag label. Computer algorithms are then used to infer the label for each instance in a bag, a process referred to as instance annotation. This task is challenging due to the ambiguity regarding the instance labels. We propose a discriminative probabilistic model for the instance annotation problem and introduce an expectation maximization framework for inference, based on the maximum likelihood approach. For many probabilistic approaches, brute-force computation of the instance label posterior probability given its bag label is exponential in the number of instances in the bag. Our contribution is a dynamic programming method for computing the posterior that is linear in the number of instances. We evaluate our method using both benchmark and real world data sets, in the domain of bird song, image annotation, and activity recognition. In many cases, the proposed framework outperforms, sometimes significantly, the current state-of-the-art MIML learning methods, both in instance label prediction and bag label prediction.
Anh T. Pham 0001, Raviv Raich, Xiaoli Z. Fern
IEEE Trans. Pattern Anal. Mach. Intell.1