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

Shilin Ding

dblp:10/3791 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
1since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 2 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 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
3 papers
Probabilistic and Bayesian machine learning · 30% Graph learning · 30% Information extraction and text analysis · 20%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models
0.112011
Learning Higher-Order Graph Structure with Features by Structure Penalty · NIPS 2011
Machine learning › Graph learning
graph structure learning
0.112011
Learning Higher-Order Graph Structure with Features by Structure Penalty · NIPS 2011
Machine learning › Graph learning
high-order interaction
0.112011
Learning Higher-Order Graph Structure with Features by Structure Penalty · NIPS 2011
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
structure learning
0.112011
Learning Higher-Order Graph Structure with Features by Structure Penalty · NIPS 2011
Natural language and speech › Question answering and dialogue systems
community question answering
0.112008
Using Conditional Random Fields to Extract Contexts and Answers of Questions from Online Forums · ACL 2008
Machine learning › Efficient and distributed learning › model compression › quantization
network binarization
0.112008
Better Binarization for the CKY Parsing · EMNLP 2008
Natural language and speech › Information extraction and text analysis
syntactic parsing
0.112008
Better Binarization for the CKY Parsing · EMNLP 2008

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

structure lasso · 0.1reparameterization · 0.1kernel methods · 0.1conditional random field · 0.1
YearPublicationVenuePosition
2023 ESO: An enhanced snake optimizer for real-world engineering problems
Liguo Yao, Panliang Yuan, Chieh-Yuan Tsai, Taihua Zhang, Yao Lu 0004, Shilin Ding
Expert Syst. Appl.6
2011 Learning Higher-Order Graph Structure with Features by Structure Penalty
abstract
In discrete undirected graphical models, the conditional independence of node labels Y is specified by the graph structure. We study the case where there is another input random vector X (e.g. observed features) such that the distribution P (Y | X) is determined by functions of X that characterize the (higher-order) interactions among the Y ’s. The main contribution of this paper is to learn the graph structure and the functions conditioned on X at the same time. We prove that discrete undirected graphical models with feature X are equivalent to mul- tivariate discrete models. The reparameterization of the potential functions in graphical models by conditional log odds ratios of the latter offers advantages in representation of the conditional independence structure. The functional spaces can be flexibly determined by kernels. Additionally, we impose a Structure Lasso (SLasso) penalty on groups of functions to learn the graph structure. These groups with overlaps are designed to enforce hierarchical function selection. In this way, we are able to shrink higher order interactions to obtain a sparse graph structure.
Shilin Ding, Grace Wahba, Xiaojin Zhu 0001
NIPS1
2008 Using Conditional Random Fields to Extract Contexts and Answers of Questions from Online Forums
Shilin Ding, Gao Cong, Chin-Yew Lin, Xiaoyan Zhu 0001
ACL1
2008 Better Binarization for the CKY Parsing
Xinying Song, Shilin Ding, Chin-Yew Lin
EMNLP2
2008 Exploiting and integrating rich features for biological literature classification
abstract
BACKGROUND: Efficient features play an important role in automated text classification, which definitely facilitates the access of large-scale data. In the bioscience field, biological structures and terminologies are described by a large number of features; domain dependent features would significantly improve the classification performance. How to effectively select and integrate different types of features to improve the biological literature classification performance is the major issue studied in this paper. RESULTS: To efficiently classify the biological literatures, we propose a novel feature value schema TF*ML, features covering from lower level domain independent "string feature" to higher level domain dependent "semantic template feature", and proper integrations among the features. Compared to our previous approaches, the performance is improved in terms of AUC and F-Score by 11.5% and 8.8% respectively, and outperforms the best performance achieved in BioCreAtIvE 2006. CONCLUSIONS: Different types of features possess different discriminative capabilities in literature classification; proper integration of domain independent and dependent features would significantly improve the performance and overcome the over-fitting on data distribution.
Hongning Wang, Minlie Huang, Shilin Ding, Xiaoyan Zhu 0001
BMC Bioinform.3
2007 Semi-supervised Pattern Learning for Extracting Relations from Bioscience Texts
Shilin Ding, Minlie Huang, Xiaoyan Zhu 0001
APBC1
2006 ONBRIRES: Ontology-Based Biological Relation Extraction System
Minlie Huang, Xiaoyan Zhu 0001, Shilin Ding, Hao Yu 0005, Ming Li 0001
APBC3