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

Maomao Min

dblp:195/8206 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2Artificial intelligence and machine learning · 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.

Databases, data mining, and information retrieval
1 paper
Data mining · 67% Machine learning and data management · 33%

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

TopicWeightPapersLastEvidence papers
Data mining
clustering
0.312017
Fast Online Incremental Learning on Mixture Streaming Data · AAAI 2017
Machine learning and data management › continual learning
incremental learning
0.312017
Fast Online Incremental Learning on Mixture Streaming Data · AAAI 2017
Data mining › text mining › topic modeling
latent dirichlet allocation
0.312017
Fast Online Incremental Learning on Mixture Streaming Data · AAAI 2017

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

gram-schmidt process · 0.3cholesky factorization · 0.3QR-updating · 0.3
YearPublicationVenuePosition
2017 Fast Online Incremental Learning on Mixture Streaming Data
abstract
The explosion of streaming data poses challenges to feature learning methods including linear discriminant analysis (LDA). Many existing LDA algorithms are not efficient enough to incrementally update with samples that sequentially arrive in various manners. First, we propose a new fast batch LDA (FLDA/QR) learning algorithm that uses the cluster centers to solve a lower triangular system that is optimized by the Cholesky-factorization. To take advantage of the intrinsically incremental mechanism of the matrix, we further develop an exact incremental algorithm (IFLDA/QR). The Gram-Schmidt process with reorthogonalization in IFLDA/QR significantly saves the space and time expenses compared with the rank-one QR-updating of most existing methods. IFLDA/QR is able to handle streaming data containing 1) new labeled samples in the existing classes, 2) samples of an entirely new (novel) class, and more significantly, 3) a chunk of examples mixed with those in 1) and 2). Both theoretical analysis and numerical experiments have demonstrated much lower space and time costs (2~10 times faster) than the state of the art, with comparable classification accuracy.
Yi Wang 0037, Xin Fan 0001, Zhongxuan Luo, Tianzhu Wang, Maomao Min, Jiebo Luo 0001
AAAI5
2017 Incremental zero-shot learning based on attributes for image classification
abstract
Instead of assuming a closed-world environment comprising a fixed number of objects, modern pattern recognition systems need to recognize outliers, identify anomalies, or discover entirely new objects, which is known as zero-shot object recognition. However, many existing zero-shot learning methods are not efficient enough to incrementally update themselves with new samples mixed with known or novel class labels. In this paper, we propose an incremental zero-shot learning framework (IIAP/QR) based on indirect-attribute-prediction (IAP) model. Firstly, a fast incremental classifier based on null space based linear discriminant analysis with QR-updating (NLDA/QR) is put forward, which can solve small-sample-size (SSS) problem and unequal-sample-size (USS) problem that usually occur in incremental learning using the centroid of each class as input. Then with the probabilistic inference of Class-Attribute layer and Attribute-Zero shot classification layer, IIAP/QR model can efficiently update itself for the insertion of both new samples to the existing class and totally novel classes with comparable recognition accuracy for zero-shot object recognition.
Nan Xue 0004, Yi Wang 0037, Xin Fan 0001, Maomao Min
ICIP4