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.

Akshat Surve

dblp:54/7056 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none

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

Artificial 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.

Artificial intelligence
1 paper
Image recognition and object detection · 50% Representation and self-supervised learning · 50%
Databases, data mining, and information retrieval
1 paper
Data mining · 81% Information retrieval · 19%

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

TopicWeightPapersLastEvidence papers
Computer vision › Image recognition and object detection › image classification
object classification
0.112009
Learning non-redundant codebooks for classifying complex objects · ICML 2009
Machine learning › Representation and self-supervised learning › vector quantization
representation codebook
0.112009
Learning non-redundant codebooks for classifying complex objects · ICML 2009
Data mining › text mining
text classification
0.112009
Learning non-redundant codebooks for classifying complex objects · ICML 2009
Data mining
clustering
0.012009
Learning non-redundant codebooks for classifying complex objects · ICML 2009
Information retrieval
visual codebook construction
0.012009
Learning non-redundant codebooks for classifying complex objects · ICML 2009

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

codebook learning · 0.2clustering · 0.2
YearPublicationVenuePosition
2009 Learning non-redundant codebooks for classifying complex objects
abstract
Codebook-based representations are widely employed in the classification of complex objects such as images and documents. Most previous codebook-based methods construct a single codebook via clustering that maps a bag of low-level features into a fixed-length histogram that describes the distribution of these features. This paper describes a simple yet effective framework for learning multiple non-redundant codebooks that produces surprisingly good results. In this framework, each codebook is learned in sequence to extract discriminative information that was not captured by preceding codebooks and their corresponding classifiers. We apply this framework to two application domains: visual object categorization and document classification. Experiments on large classification tasks show substantial improvements in performance compared to a single codebook or codebooks learned in a bagging style.
Wei Zhang 0014, Akshat Surve, Xiaoli Z. Fern, Thomas G. Dietterich
ICML2