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

Kent Shi

dblp:76/4137 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2012
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 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.

Databases, data mining, and information retrieval
1 paper
Recommender systems · 90% Data mining · 10%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%
Computer graphics and multimedia
1 paper
Image and video processing · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems
collaborative filtering
0.112012
GetJar mobile application recommendations with very sparse datasets · KDD 2012
Recommender systems › collaborative filtering
matrix factorization
0.112012
GetJar mobile application recommendations with very sparse datasets · KDD 2012
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
manifold learning
0.112007
Mapping Natural Image Patches by Explicit and Implicit Manifolds · CVPR 2007
Recommender systems
data sparsity
0.012012
GetJar mobile application recommendations with very sparse datasets · KDD 2012
Data mining › predictive modeling › classification › class imbalance
long-tailed distribution
0.012012
GetJar mobile application recommendations with very sparse datasets · KDD 2012
Recommender systems › domain-specific recommendation
mobile app recommendation
0.012012
GetJar mobile application recommendations with very sparse datasets · KDD 2012

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

latent factor model · 0.1information-theoretic criterion · 0.1image scaling · 0.1
YearPublicationVenuePosition
2012 GetJar mobile application recommendations with very sparse datasets
abstract
The Netflix competition of 2006 [2] has spurred significant activity in the recommendations field, particularly in approaches using latent factor models [3,5,8,12] However, the near ubiquity of the Netflix and the similar MovieLens datasets1 may be narrowing the generality of lessons learned in this field. At GetJar, our goal is to make appealing recommendations of mobile applications (apps). For app usage, we observe a distribution that has higher kurtosis (heavier head and longer tail) than that for the aforementioned movie datasets. This happens primarily because of the large disparity in resources available to app developers and the low cost of app publication relative to movies.
Kent Shi, Kamal Ali
KDD1
2010 Learning explicit and implicit visual manifolds by information projection
Song-Chun Zhu, Kent Shi, Zhangzhang Si
Pattern Recognit. Lett.2
2007 Mapping Natural Image Patches by Explicit and Implicit Manifolds
abstract
Image patches are fundamental elements for object modeling and recognition. However, there has not been a panoramic study of the structures of the whole ensemble of natural image patches in the literature. In this article, we study the structures of this ensemble by mapping natural image patches into two types of subspaces which we call "explicit manifolds " and "implicit manifolds " respectively. On explicit manifolds, one finds those simple and regular image primitives, such as edges, bars, corners and junctions. On implicit manifolds, one finds those complex and stochastic image patches, such as textures and clutters. On different types of manifolds, different perceptual metrics are used. We propose a method for learning a probabilistic distribution on the space of patches by pursuing both types of manifolds using a common information theoretical criterion. The connection between the two types of manifolds is realized by image scaling, which changes the entropy of the image patches. The explicit manifolds live in low entropy regimes while the implicit manifolds live in high entropy regimes. We study the transition between the two types of manifolds over scale and show that the complexity of the manifolds peaks in a middle entropy regime.
Kent Shi, Song-Chun Zhu
CVPR1