Demo Data from VLDB 2026 / reviewers in the wild / expert
Ren-Jia Liou
dblp:99/9388
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 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 · 91% Information retrieval · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining
clustering |
0.1 | 1 | 2011 | A Fuzzy Self-Constructing Feature Clustering Algorithm for Text Classification · IEEE Trans. Knowl. Data Eng. 2011 |
Data mining › clustering
feature clustering |
0.1 | 1 | 2011 | A Fuzzy Self-Constructing Feature Clustering Algorithm for Text Classification · IEEE Trans. Knowl. Data Eng. 2011 |
Data mining › text mining
text classification |
0.1 | 1 | 2011 | A Fuzzy Self-Constructing Feature Clustering Algorithm for Text Classification · IEEE Trans. Knowl. Data Eng. 2011 |
Information retrieval
text analysis |
0.0 | 1 | 2011 | A Fuzzy Self-Constructing Feature Clustering Algorithm for Text Classification · IEEE Trans. Knowl. Data Eng. 2011 |
Methods — techniques the papers use, named apart from their topics
membership function · 0.1fuzzy similarity-based clustering · 0.1feature extraction · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | A Fuzzy Self-Constructing Feature Clustering Algorithm for Text ClassificationabstractFeature clustering is a powerful method to reduce the dimensionality of feature vectors for text classification. In this paper, we propose a fuzzy similarity-based self-constructing algorithm for feature clustering. The words in the feature vector of a document set are grouped into clusters, based on similarity test. Words that are similar to each other are grouped into the same cluster. Each cluster is characterized by a membership function with statistical mean and deviation. When all the words have been fed in, a desired number of clusters are formed automatically. We then have one extracted feature for each cluster. The extracted feature, corresponding to a cluster, is a weighted combination of the words contained in the cluster. By this algorithm, the derived membership functions match closely with and describe properly the real distribution of the training data. Besides, the user need not specify the number of extracted features in advance, and trial-and-error for determining the appropriate number of extracted features can then be avoided. Experimental results show that our method can run faster and obtain better extracted features than other methods. Jung-Yi Jiang, Ren-Jia Liou, Shie-Jue Lee |
IEEE Trans. Knowl. Data Eng. | 2 |