Author: Hong Cui

Publication Overview

Publication period start: 2012
Number of co-authors: 5

Co-Authors

Number of publications with favourite co-authors

Productive Colleagues

Most productive colleagues in number of publications

Publications

Cui, Hong, Heidorn, P. Bryan (2007): The reusability of induced knowledge for the automatic semantic markup of taxonomic descri. In JASIST - Journal of the American Society for Information Science and Technology, 58 (1) pp. 133-149. https://dx.doi.org/10.1002/asi.20463
Cui, Hong, Heidorn, P. Bryan, Zhang, Hong (2002): An approach to automatic classification of text for information retrieval. In: JCDL02: Proceedings of the 2nd ACM/IEEE-CS Joint Conference on Digital Libraries , 2002, . pp. 96-97. https://doi.acm.org/10.1145/544220.544237
Cui, Hong, McCourt, Richard M., Feist, Monique (2006): Unsupervised structure discovery for biodiversity information. In: JCDL06: Proceedings of the 6th ACM/IEEE-CS Joint Conference on Digital Libraries , 2006, . pp. 382. https://doi.acm.org/10.1145/1141753.1141878
Cui, Hong (2008): Unsupervised semantic markup of literature for biodiversity digital libraries. In: JCDL08 Proceedings of the 8th ACM/IEEE-CS Joint Conference on Digital Libraries , 2008, . pp. 25-28. https://doi.acm.org/10.1145/1378889.1378894
Cui, Hong (2008): An application for semantic markup of biodiversity documents. In: JCDL08 Proceedings of the 8th ACM/IEEE-CS Joint Conference on Digital Libraries , 2008, . pp. 421. https://doi.acm.org/10.1145/1378889.1378968
Janning, Alyssa, Cui, Hong (2012): Evaluating the botanical coverage of PATO using an unsupervised learning algorithm. In: Proceedings of the 2012 iConference , 2012, . pp. 504-505. https://dx.doi.org/10.1145/2132176.2132265
Privacy Settings
By using this site, you accept our Cookie Policy and Terms of Use.
Customize
Accept all

Feel Stuck? Want Freedom?

Join 326,067+ designers who get one powerful email each week. Learn to design a life you love.

Next email in
0
days
21
hrs
6
mins
37
secs

Free forever. No spam. Unsubscribe anytime.