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

Pu Wang 0002

dblp:15/4476-2 · DBLP profile ↗
← Back
6ranked-venue papers
6as first author
0since 2021 · last 2012
—ORCID · conflict

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

Databases, data management, data science and information retrieval · 6 · 6 first-authorArtificial intelligence and machine learning · 4 · 4 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
2 papers
Data mining · 90% Information retrieval · 10%
Artificial intelligence
1 paper
Transfer learning and domain adaptation · 50% Graph learning · 50%

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

TopicWeightPapersLastEvidence papers
Data mining › text mining
text classification
0.122008
Building semantic kernels for text classification using wikipedia · KDD 2008
Using Wikipedia for Co-clustering Based Cross-Domain Text Classification · ICDM 2008
Machine learning › Graph learning
co-clustering
0.112008
Using Wikipedia for Co-clustering Based Cross-Domain Text Classification · ICDM 2008
Machine learning › Transfer learning and domain adaptation › cross-domain learning
cross-domain text classification
0.112008
Using Wikipedia for Co-clustering Based Cross-Domain Text Classification · ICDM 2008
Data mining › text mining › text classification
semantic kernels
0.112008
Building semantic kernels for text classification using wikipedia · KDD 2008
Data mining
background knowledge
0.012008
Building semantic kernels for text classification using wikipedia · KDD 2008
Information retrieval › document processing › document analysis
document representation
0.012008
Building semantic kernels for text classification using wikipedia · KDD 2008

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

latent semantic relationship · 0.2co-clustering · 0.2wikipedia · 0.1semantic kernel · 0.1bag-of-words · 0.1
YearPublicationVenuePosition
2012 Feature Enriched Nonparametric Bayesian Co-clustering
Pu Wang 0002, Carlotta Domeniconi, Huzefa Rangwala, Kathryn B. Laskey
PAKDD (1)1
2011 Nonparametric Bayesian Co-clustering Ensembles
abstract
A nonparametric Bayesian approach to co-clustering ensembles is presented. Similar to clustering ensembles, co-clustering ensembles combine various base co-clustering results to obtain a more robust consensus co-clustering. To avoid pre-specifying the number of co-clusters, we specify independent Dirichlet process priors for the row and column clusters. Thus, the numbers of row- and column-clusters are unbounded a priori; the actual numbers of clusters can be learned a posteriori from observations. Next, to model non-independence of row- and column-clusters, we employ a Mondrian Process as a prior distribution over partitions of the data matrix. As a result, the co-clusters are not restricted to a regular grid partition, but form nested partitions with varying resolutions. The empirical evaluation demonstrates the effectiveness of nonparametric Bayesian co-clustering ensembles and their advantages over traditional co-clustering methods.
Pu Wang 0002, Kathryn B. Laskey, Carlotta Domeniconi, Michael I. Jordan
SDM1
2010 Nonparametric Bayesian Clustering Ensembles
Pu Wang 0002, Carlotta Domeniconi, Kathryn B. Laskey
ECML/PKDD (3)1
2009 Latent Dirichlet Bayesian Co-Clustering
Pu Wang 0002, Carlotta Domeniconi, Kathryn B. Laskey
ECML/PKDD (2)1
2008 Using Wikipedia for Co-clustering Based Cross-Domain Text Classification
abstract
Traditional approaches to document classification requires labeled data in order to construct reliable and accurate classifiers. Unfortunately, labeled data are seldom available, and often too expensive to obtain. Given a learning task for which training data are not available, abundant labeled data may exist for a different but related domain. One would like to use the related labeled data as auxiliary information to accomplish the classification task in the target domain. Recently, the paradigm of transfer learning has been introduced to enable effective learning strategies when auxiliary data obey a different probability distribution. A co-clustering based classification algorithm has been previously proposed to tackle cross-domain text classification. In this work, we extend the idea underlying this approach by making the latent semantic relationship between the two domains explicit. This goal is achieved with the use of Wikipedia. As a result, the pathway that allows to propagate labels between the two domains not only captures common words, but also semantic concepts based on the content of documents. We empirically demonstrate the efficacy of our semantic-based approach to cross-domain classification using a variety of real data.
Pu Wang 0002, Carlotta Domeniconi
ICDM1
2008 Building semantic kernels for text classification using wikipedia
abstract
Document classification presents difficult challenges due to the sparsity and the high dimensionality of text data, and to the complex semantics of the natural language. The traditional document representation is a word-based vector (Bag of Words, or BOW), where each dimension is associated with a term of the dictionary containing all the words that appear in the corpus. Although simple and commonly used, this representation has several limitations. It is essential to embed semantic information and conceptual patterns in order to enhance the prediction capabilities of classification algorithms. In this paper, we overcome the shortages of the BOW approach by embedding background knowledge derived from Wikipedia into a semantic kernel, which is then used to enrich the representation of documents. Our empirical evaluation with real data sets demonstrates that our approach successfully achieves improved classification accuracy with respect to the BOW technique, and to other recently developed methods.
Pu Wang 0002, Carlotta Domeniconi
KDD1