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.

Xiao-Rong Lin

dblp:67/9361 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 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.

Artificial intelligence
1 paper
Optimization for machine learning · 67% Kernel, tree and ensemble methods · 33%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning
large-scale optimization
0.112010
Tree Decomposition for Large-Scale SVM Problems · J. Mach. Learn. Res. 2010
Machine learning › Optimization for machine learning › large-scale optimization
large-scale SVM training
0.112010
Tree Decomposition for Large-Scale SVM Problems · J. Mach. Learn. Res. 2010
Machine learning › Kernel, tree and ensemble methods
support vector machine
0.112010
Tree Decomposition for Large-Scale SVM Problems · J. Mach. Learn. Res. 2010
Graph algorithms and graph theory › graph decomposition
tree decomposition
0.112010
Tree Decomposition for Large-Scale SVM Problems · J. Mach. Learn. Res. 2010

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

tree decomposition · 0.2
YearPublicationVenuePosition
2011 Classifying Textual Components of Bilingual Documents with Decision-Tree Support Vector Machines
abstract
In this paper, we propose a method for classifying textual entities of bilingual documents written in Chinese and English. In contrast to earlier works that performed classification on the level of text lines or documents, we apply our method to the level of textual components, as we must first identify Chinese components before merging them into intact characters and sending the latter characters to a Chinese recognizer. To cope with a large training data set containing 365,672 samples, we employ a decision-tree support vector machine (DTSVM) method, which decomposes a given data space into small regions and trains local SVMs on those regions. By applying this method to train classifiers on various combinations of feature types, we were able to complete each training process within 3,500 seconds and achieve higher than 99.6% test accuracy in classifying a textual component into Chinese, alphanumeric, and punctuation. Moreover, the classification had no strong bias towards any of the three categories.
Xiao-Rong Lin, Chien-Yang Guo, Fu Chang
ICDAR1
2010 Tree Decomposition for Large-Scale SVM Problems
Fu Chang, Chien-Yang Guo, Xiao-Rong Lin, Chi-Jen Lu
J. Mach. Learn. Res.3