default search action
Hang Li 0011
Person information
- affiliation: NEC Corporation, Kawasaki, Japan
Other persons with the same name
- Hang Li — disambiguation page
- Hang Li 0001
— ByteDance, China (and 4 more)
- Hang Li 0002
- Hang Li 0003
- Hang Li 0004
- Hang Li 0005
- Hang Li 0006
- Hang Li 0007
- Hang Li 0008 — Army Engineering University of PLA, PLAUST, College of Command and Control Engineering, Nanjing, China
- Hang Li 0009
- Hang Li 0010 — Ludwig Maximilian University of Munich, Munich, Germany (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
- [j5]Hang Li, Kenji Yamanishi:
Topic analysis using a finite mixture model. Inf. Process. Manag. 39(4): 521-541 (2003) - 2002
- [j4]Kenji Yamanishi, Hang Li:
Mining Open Answers in Questionnaire Data. IEEE Intell. Syst. 17(5): 58-63 (2002) - [j3]Hang Li, Kenji Yamanishi:
Text classification using ESC-based stochastic decision lists. Inf. Process. Manag. 38(3): 343-361 (2002) - 2001
- [c9]Hang Li, Kenji Yamanishi:
Mining from open answers in questionnaire data. KDD 2001: 443-449 - 2000
- [c8]Hang Li, Kenji Yamanishi:
Topic Analysis Using a Finite Mixture Model. EMNLP 2000: 35-44
1990 – 1999
- 1999
- [j2]Hang Li, Naoki Abe:
Learning Dependencies between Case Frame Slots. Comput. Linguistics 25(2): 283-291 (1999) - [c7]Hang Li, Kenji Yamanishi:
Text Classification Using ESC-based Stochastic Decision Lists. CIKM 1999: 122-130 - 1998
- [j1]Hang Li, Naoki Abe:
Generalizing Case Frames Using a Thesaurus and the MDL Principle. Comput. Linguistics 24(2): 217-244 (1998) - [c6]Hang Li, Naoki Abe:
Word Clustering and Disambiguation Based on Co-occurence Data. COLING-ACL 1998: 749-755 - [i7]Hang Li, Naoki Abe:
Word Clustering and Disambiguation Based on Co-occurrence Data. CoRR cmp-lg/9807004 (1998) - 1997
- [c5]Hang Li, Kenji Yamanishi:
Document Classification Using a Finite Mixture Model. ACL 1997: 39-47 - [i6]Hang Li, Kenji Yamanishi:
Document Classification Using a Finite Mixture Model. CoRR cmp-lg/9705005 (1997) - 1996
- [c4]Hang Li, Naoki Abe:
Clustering Words with the MDL Principle. COLING 1996: 4-9 - [c3]Hang Li, Naoki Abe:
Learning Dependencies between Case Frame Slots. COLING 1996: 10-15 - [c2]Naoki Abe, Hang Li:
Learning Word Association Norms Using Tree Cut Pair Models. ICML 1996: 3-11 - [i5]Hang Li, Naoki Abe:
Learning Dependencies between Case Frame Slots. CoRR cmp-lg/9605013 (1996) - [i4]Hang Li, Naoki Abe:
Clustering Words with the MDL Principle. CoRR cmp-lg/9605014 (1996) - [i3]Naoki Abe, Hang Li:
Learning Word Association Norms Using Tree Cut Pair Models. CoRR cmp-lg/9605029 (1996) - 1995
- [c1]Naoki Abe, Hang Li, Atsuyoshi Nakamura:
On-line Learning of Binary Lexical Relations Using Two-dimensional Weighted Majority Algorithms. ICML 1995: 3-11 - [i2]Naoki Abe, Hang Li, Atsuyoshi Nakamura:
On-line Learning of Binary Lexical Relations Using Two-dimensional Weighted Majority Algorithms. CoRR abs/cmp-lg/9507010 (1995) - [i1]Hang Li, Naoki Abe:
Generalizing Case Frames Using a Thesaurus and the MDL Principle. CoRR abs/cmp-lg/9507011 (1995)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-13 19:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: