The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Learning to classify short and sparse text & web with hidden topics from large-scale data collections
Abstract
This paper presents a general framework for building classifiers that deal with short and sparse text & segments by making the most of hidden topics discovered from large-scale data collections. The main motivation of this work is that many classification tasks working with short segments of text & Web, such as search snippets, forum & chat messages, blog & news feeds, product reviews, and book & movie summaries, fail to achieve high accuracy due to the data sparseness. We, therefore, come up with an idea of gaining external knowledge to make the data more related as well as expand the coverage of classifiers to handle future data better. The underlying idea of the framework is that for each classification task, we collect a large-scale external data collection called universal dataset, and then build a classifier on both a (small) set of labeled training data and a rich set of hidden topics discovered from that data collection. The framework is general enough to be applied to different data domains and genres ranging from search results to medical text. We did a careful evaluation on several hundred megabytes of Wikipedia (30M words) and MEDLINE (18M words) with two tasks: Web search domain disambiguation and disease categorization for medical text, and achieved significant quality enhancement.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949 · cited 1×
“Gibbs Sampling is a special case of Markov-chain Monte Carlo (MCMC) [ 18 ] and often yields relatively simple algorithms for approximate inference in high-dimensional models such as LDA [21].”
Indexing by latent semantic analysis
Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., & Harshman, R. (1990) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199009)41:6<391::aid-asi1>3.0.co;2-9 · Cited by 12,751
On the limited memory BFGS method for large scale optimization
Liu, D. C., & Nocedal, J. (1989) · Mathematical Programming · doi:10.1007/bf01589116 · Cited by 8,560
Text categorization with Support Vector Machines: Learning with many relevant features
Joachims, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0026683 · Cited by 7,999
Machine learning in automated text categorization
Sebastiani, F. (2002) · ACM Computing Surveys · doi:10.1145/505282.505283 · Cited by 7,926
Griffiths, T. L., & Steyvers, M. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307752101 · Cited by 6,049
Combining labeled and unlabeled data with co-training
Blum, A., & Mitchell, T. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279962 · Cited by 5,495
A maximum entropy approach to natural language processing
Berger, A. L., Pietra, V. J. D., & Pietra, S. A. D. (1996) · doi:10.5555/234285.234289 · Cited by 3,065
Text classification from labeled and unlabeled documents using EM
Nigam, K., Mccallum, A. K., Thrun, S., & Mitchell, T. (2000) · Machine Learning · doi:10.1023/a:1007692713085 · Cited by 2,736 · cited 1×
“However, unlike traditional semi-supervised learning algorithms [11, 29], the universal data and the training/test data are not required to have the same format.”
Background
Cited by
A review of affective computing: From unimodal analysis to multimodal fusion
Poria, S., Cambria, E., Bajpai, R., & Hussain, A. (2017) · Information Fusion · doi:10.1016/j.inffus.2017.02.003 · Cited by 1,644
SimLex-999: Evaluating Semantic Models With (Genuine) Similarity Estimation
Hill, F., Reichart, R., & Korhonen, A. (2015) · Computational Linguistics · doi:10.1162/coli_a_00237 · Cited by 1,175
Empirical study of topic modeling in Twitter
Hong, L., & Davison, B. D. (2010) · Proceedings of the First Workshop on Social Media Analytics · doi:10.1145/1964858.1964870 · Cited by 1,120
A biterm topic model for short texts
Yan, X., Guo, J., Lan, Y., & Cheng, X. (2013) · Proceedings of the 22nd international conference on World Wide Web · doi:10.1145/2488388.2488514 · Cited by 1,088
topicmodels : An R Package for Fitting Topic Models
Grün, B., & Hornik, K. (2011) · Journal of Statistical Software · doi:10.18637/jss.v040.i13 · Cited by 1,072
“GibbsLDA++ (Phan, Nguyen, and Horiguchi 2008) is available under the GPL from http://gibbslda.sourceforge.net/ .”
BackgroundMethodComposition in Distributional Models of Semantics
Mitchell, J., & Lapata, M. (2010) · Cognitive Science · doi:10.1111/j.1551-6709.2010.01106.x · Cited by 960
Short text classification in twitter to improve information filtering
Sriram, B., Fuhry, D., Demir, E., Ferhatosmanoglu, H., & Demirbas, M. (2010) · Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1835449.1835643 · Cited by 727
BTM: Topic Modeling over Short Texts
Cheng, X., Yan, X., Lan, Y., & Guo, J. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2313872 · Cited by 556
BARBERÁ, P., CASAS, A., NAGLER, J., EGAN, P. J., BONNEAU, R., JOST, J. T., & TUCKER, J. A. (2019) · American Political Science Review · doi:10.1017/s0003055419000352 · Cited by 539
Short Text Topic Modeling Techniques, Applications, and Performance: A Survey
Qiang, J., Qian, Z., Li, Y., Yuan, Y., & Wu, X. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.2992485 · Cited by 314
Wang, P., Xu, B., Xu, J., Tian, G., Liu, C.-L., & Hao, H. (2016) · Neurocomputing · doi:10.1016/j.neucom.2015.09.096 · Cited by 304
Topic Modeling for Short Texts with Auxiliary Word Embeddings
Li, C., Wang, H., Zhang, Z., Sun, A., & Ma, Z. (2016) · Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval · doi:10.1145/2911451.2911499 · Cited by 292
Text Mining in Organizational Research
Kobayashi, V. B., Mol, S. T., Berkers, H. A., Kismihók, G., & Den Hartog, D. N. (2018) · Organizational Research Methods · doi:10.1177/1094428117722619 · Cited by 275
Xianghua, F., Guo, L., Yanyan, G., & Zhiqiang, W. (2013) · Knowledge-Based Systems · doi:10.1016/j.knosys.2012.08.003 · Cited by 258
On Stopwords, Filtering and Data Sparsity for Sentiment Analysis of Twitter
Saif, H., Fernandez, M., He, Y., & Alani, H. (2014) · Proceedings of the Language Resources and Evaluation Conference · doi:10.63317/3uepwmfe264a · Cited by 219
Elites Tweet to Get Feet Off the Streets: Measuring Regime Social Media Strategies During Protest
Munger, K., Bonneau, R., Nagler, J., & Tucker, J. A. (2019) · Political Science Research and Methods · doi:10.1017/psrm.2018.3 · Cited by 84
Contrastive Learning Models for Sentence Representations
Xu, L., Xie, H., Li, Z., Wang, F. L., Wang, W., & Li, Q. (2023) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3593590 · Cited by 50
SocialStories: Segmenting Stories within Trending Twitter Topics
Jaidka, K., Ramachandran, K., Gupta, P., & Rustagi, S. (2016) · Proceedings of the 3rd IKDD Conference on Data Science, 2016 · doi:10.1145/2888451.2888453 · Cited by 5
“For LDA, we have used the Gibbs sampling implementation of LDA [13], which has also been used in the work of [9] and [17].”
Method
Metadata
- Authors
- Phan, X.-H., Nguyen, L.-M., & Horiguchi, S.
- Venue
- Proceedings of the 17th international conference on World Wide Web
- Publisher
- ACM
- Published
- 2008-04-21
- Pages
- 91-100
- OpenAlex
- W2171836785
- Cited by
- 740
- References
- 32
- FWCI
- 17.86
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.