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

Hang Li 0011

dblp:83/5560-11 · DBLP profile ↗
← Back
12ranked-venue papers
10as first author
0since 2021 · last 2003
—ORCID · conflict

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

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

Artificial intelligence
4 papers
Probabilistic and Bayesian machine learning · 32% Information extraction and text analysis · 30% Knowledge representation and reasoning · 20%
Databases, data mining, and information retrieval
2 papers
Data mining · 56% Knowledge graphs · 35% Information retrieval · 9%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model › mixture model
finite mixture models
0.022000
Topic Analysis Using a Finite Mixture Model · EMNLP 2000
Document Classification Using a Finite Mixture Model · ACL 1997
Knowledge graphs
relation extraction
0.012001
Mining from open answers in questionnaire data · KDD 2001
Data mining
text mining
0.012001
Mining from open answers in questionnaire data · KDD 2001
Knowledge, reasoning and agents › Knowledge representation and reasoning › semantic representation
semantic relations
0.021996
Learning Word Association Norms Using Tree Cut Pair Models · ICML 1996
On-line Learning of Binary Lexical Relations Using Two-dimensional Weighted Majority Algorithms · ICML 1995
Natural language and speech › Information extraction and text analysis › knowledge discovery from text › topic detection
topic analysis
0.012000
Topic Analysis Using a Finite Mixture Model · EMNLP 2000
Natural language and speech › Information extraction and text analysis
text classification
0.011997
Document Classification Using a Finite Mixture Model · ACL 1997
Machine learning › Learning theory
online learning
0.011995
On-line Learning of Binary Lexical Relations Using Two-dimensional Weighted Majority Algorithms · ICML 1995
Machine learning › Learning theory › online learning
weighted majority algorithm
0.011995
On-line Learning of Binary Lexical Relations Using Two-dimensional Weighted Majority Algorithms · ICML 1995
Data mining
pattern mining
0.012001
Mining from open answers in questionnaire data · KDD 2001
Data mining › pattern mining › rule mining
rule analysis
0.012001
Mining from open answers in questionnaire data · KDD 2001

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

word clustering · 0.1statistical learning · 0.1finite mixture models · 0.0rule analysis · 0.0correspondence analysis · 0.0finite mixture model · 0.0soft clustering · 0.0EM algorithm · 0.0tree cut pair models · 0.0two-dimensional weighted majority algorithm · 0.0
YearPublicationVenuePosition
2003 Topic analysis using a finite mixture model
Hang Li 0011, Kenji Yamanishi
Inf. Process. Manag.1
2002 Text classification using ESC-based stochastic decision lists
Hang Li 0011, Kenji Yamanishi
Inf. Process. Manag.1
2001 Mining from open answers in questionnaire data
abstract
Surveys are an important part of marketing and customer relationship management, and open answers (i.e., answers to open questions) in particular may contain valuable information and provide an important basis for making business decisions. We have developed a text mining system that provides a new way for analyzing open answers in questionnaire data. The product is able to perform the following two functions: (A) accurate extraction of characteristics for individual analysis targets, (B) accurate extraction of the relationships among characteristics of analysis targets. In this paper, we describe the working of our text mining system. It employs two statistical learning techniques: rule analysis and Correspondence Analysis for performing the two functions. Our text mining system has already been put into use by a number of large corporations in Japan in the performance of text mining on various types of survey data, including open answers about brand images, open answers about company images, complaints about products, comments written on home pages, business reports, and help desk records. In this it has been found to be useful in forming a basis for effective business decisions.
Hang Li 0011, Kenji Yamanishi
KDD1
2000 Topic Analysis Using a Finite Mixture Model
abstract
We address the issue of 'topic analysis,' by which is determined a text's topic structure, which indicates what topics are included in a text, and how topics change within the text.We propose a novel approach to this issue, one based on statistical modeling and learning.We represent topics by means of word clusters, and employ a finite mixture model to represent a word distribution within a text.Our experimental results indicate that our method significantly outperforms a method that combines existing techniques.
Hang Li 0011, Kenji Yamanishi
EMNLP1
1999 Text Classification Using ESC-based Stochastic Decision Lists
abstract
We propose a new method of text classification using stochastic decision lists. A stochastic decision list is an ordered sequence of IF-THEN rules, and our method can be viewed as a rule-based method for text classification having advantages of readability and refinability of acquired knowledge. Our method is unique in that decision lists are automatically constructed on the basis of the principle of minimizing Extended Stochastic Complexity (ESC), and with it we are able to construct decision lists that have fewer errors in classification. The accuracy of classification achieved with our method appears better than or comparable to those of existing rule-based methods.
Hang Li 0011, Kenji Yamanishi
CIKM1
1999 Learning Dependencies between Case Frame Slots
Hang Li 0011, Naoki Abe
Comput. Linguistics1
1998 Generalizing Case Frames Using a Thesaurus and the MDL Principle
Hang Li 0011, Naoki Abe
Comput. Linguistics1
1997 Document Classification Using a Finite Mixture Model
abstract
We propose a new method of classifying documents into categories. We define for each category a finite mixture model based on soft clustering of words. We treat the problem of classifying documents as that of conducting statistical hypothesis testing over finite mixture models, and employ the EM algorithm to efficiently estimate parameters in a finite mixture model. Experimental results indicate that our method outperforms existing methods.
Hang Li 0011, Kenji Yamanishi
ACL1
1996 Clustering Words with the MDL Principle
Hang Li 0011, Naoki Abe
COLING1
1996 Learning Dependencies between Case Frame Slots
Hang Li 0011, Naoki Abe
COLING1
1996 Learning Word Association Norms Using Tree Cut Pair Models
Naoki Abe, Hang Li 0011
ICML2
1995 On-line Learning of Binary Lexical Relations Using Two-dimensional Weighted Majority Algorithms
Naoki Abe, Hang Li 0011, Atsuyoshi Nakamura
ICML2