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
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
An introduction to MCMC for machine learning.
Andrieu, C., de Freitas, N., Doucet, A., & Jordan, M. I. (2003) · Machine Learning · doi:10.1023/a:1020281327116 · Cited by 2,451
Computing semantic relatedness using Wikipedia-based explicit semantic analysis
Gabrilovich, E., & Markovitch, S. (2007) · Cited by 1,981
Latent semantic models for collaborative filtering
Hofmann, T. (2004) · ACM Transactions on Information Systems · doi:10.1145/963770.963774 · Cited by 1,378
Concept Decompositions for Large Sparse Text Data Using Clustering
Dhillon, I. S., & Modha, D. S. (2001) · Machine Learning · doi:10.1023/a:1007612920971 · Cited by 1,293
A correlated topic model of Science
Blei, D. M., & Lafferty, J. (2018) · doi:10.1184/r1/6587330.v1 · Cited by 1,088
LDA-based document models for ad-hoc retrieval
Wei, X., & Croft, W. B. (2006) · Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1148170.1148204 · Cited by 1,075
A correlated topic model of Science
Blei, D. M., & Lafferty, J. D. (2007) · The Annals of Applied Statistics · doi:10.1214/07-aoas114 · Cited by 953
A web-based kernel function for measuring the similarity of short text snippets
Sahami, M., & Heilman, T. D. (2006) · Proceedings of the 15th international conference on World Wide Web · doi:10.1145/1135777.1135834 · Cited by 735
Grouper: a dynamic clustering interface to Web search results
Zamir, O., & Etzioni, O. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00054-7 · Cited by 720
Parameter estimation for text analysis
Heinrich, G. (2009) · Cited by 700
Distributional clustering of words for text classification
Baker, L. D., & McCallum, A. K. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.290970 · Cited by 676
Learning to cluster web search results
Zeng, H.-J., He, Q.-C., Chen, Z., Ma, W.-Y., & Ma, J. (2004) · Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1008992.1009030 · Cited by 587
Measuring semantic similarity between words using web search engines
(2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242675 · Cited by 540
Expectation-propagation for the generative aspect model
Minka, T. P., & Lafferty, J. (2002) · Cited by 439
Clustering short texts using wikipedia
Banerjee, S., Ramanathan, K., & Gupta, A. (2007) · Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1277741.1277909 · Cited by 336
Distributional word clusters vs. words for text categorization
Bekkerman, R., El‐Yaniv, R., Tishby, N., & Winter, Y. (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944969 · Cited by 331
Similarity Measures for Short Segments of Text
Metzler, D., Dumais, S., & Meek, C. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71496-5_5 · Cited by 305
A Latent Dirichlet Model for Unsupervised Entity Resolution
Bhattacharya, I., & Getoor, L. (2006) · Proceedings of the 2006 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972764.5 · Cited by 266
Denoyer, L., & Gallinari, P. (2006) · ACM SIGIR Forum · doi:10.1145/1147197.1147210 · Cited by 196
Kummamuru, K., Lotlikar, R., Roy, S., Singal, K., & Krishnapuram, R. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988762 · Cited by 190
Identifying Document Topics Using the Wikipedia Category Network
Schönhofen, P. (2006) · IEEE/WIC/ACM International Conference on Web Intelligence · doi:10.1109/wi.2006.92 · Cited by 110
Improving similarity measures for short segments of text
Yih, W.-T., & Meek, C. (2007) · Cited by 108
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/ .”
BackgroundMethod
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.