The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Accurate and effective latent concept modeling for ad hoc information retrieval
Open accessAbstract
A keyword query is the representation of the information need of a user, and is the result of a complex cognitive process which often results in under-specification.We propose an unsupervised method namely Latent Concept Modeling (LCM) for mining and modeling latent search concepts in order to recreate the conceptual view of the original information need.We use Latent Dirichlet Allocation (LDA) to exhibit highly-specific query-related topics from pseudo-relevant feedback documents.We define these topics as the latent concepts of the user query.We perform a thorough evaluation of our approach over two large ad-hoc TREC collections.Our findings reveal that the proposed method accurately models latent concepts, while being very effective in a query expansion retrieval setting.RÉSUMÉ.Une requête est la représentation du besoin d'information d'un utilisateur, et est le résultat d'un processus cognitif complexe qui mène souvent à un mauvais choix de mots-clés.Nous proposons une méthode non supervisée pour la modélisation de concepts implicites d'une requête, dans le but de recréer la représentation conceptuelle du besoin d'information initial.Nous utilisons l'allocation de Dirichlet latente (LDA) pour détecter les concepts implicites de la requête en utilisant des documents pseudo-pertinents.Nous évaluons cette méthode en profondeur en utilisant deux collections de test de TREC.Nous trouvons notamment que notre approche permet de modéliser précisément les concepts implicites de la requête, tout en obtenant de bonnes performances dans le cadre d'une recherche de documents.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
Blei, D. M., Ng, A. Y., & Jordan, M. I. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0082 · Cited by 12,223
Griffiths, T. L., & Steyvers, M. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307752101 · Cited by 6,049
Algebraic decay in hierarchical graphs
Garcia, A., Sonnino, G., Malek-Mansour, M.-A., & Baras, F. (1997) · doi:10.1023/a · Cited by 5,187
Yago: a core of semantic knowledge
Suchanek, F. M., Kasneci, G., & Weikum, G. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242667 · Cited by 2,512
Unsupervised Learning by Probabilistic Latent Semantic Analysis
Hofmann, T. (2001) · Machine Learning · doi:10.1023/a:1007617005950 · Cited by 2,456
Hierarchical Dirichlet Processes
Teh, Y. W., Jordan, M. I., Beal, M. J., & Blei, D. M. (2006) · Journal of the American Statistical Association · doi:10.1198/016214506000000302 · Cited by 2,120
Some Simple Effective Approximations to the 2-Poisson Model for Probabilistic Weighted Retrieval
Robertson, S. E., & Walker, S. (1994) · SIGIR ’94 · doi:10.1007/978-1-4471-2099-5_24 · Cited by 1,477
Relevance-Based Language Models
Lavrenko, V., & Croft, W. B. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130376 · Cited by 1,422
A study of smoothing methods for language models applied to information retrieval
Zhai, C., & Lafferty, J. (2004) · ACM Transactions on Information Systems · doi:10.1145/984321.984322 · Cited by 1,201
Association for Computational Linguistics
Hirst, G. (2006) · Encyclopedia of Language & Linguistics · doi:10.1016/b0-08-044854-2/05234-2 · Cited by 1,140
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
Relevance based language models
Lavrenko, V., & Croft, W. B. (2001) · Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/383952.383972 · Cited by 1,037
Placing search in context: the concept revisited.
Finkelstein, L., Gabrilovich, E., Matias, Y., Rivlin, E., Solan, Z., Wolfman, G., & Ruppin, E. (2002) · Cited by 961
A density-based method for adaptive LDA model selection
Cao, J., Xia, T., Li, J., Zhang, Y., & Tang, S. (2009) · Neurocomputing · doi:10.1016/j.neucom.2008.06.011 · Cited by 880
Automatic evaluation of topic coherence
Newman, D. J., Lau, J. H., Grieser, K., & Baldwin, T. (2010) · Cited by 846
A Markov random field model for term dependencies
Metzler, D., & Croft, W. B. (2005) · Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1076034.1076115 · Cited by 843
On Finding the Natural Number of Topics with Latent Dirichlet Allocation: Some Observations
Arun, R., Suresh, V., Veni Madhavan, C. E., & Narasimha Murthy, M. N. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13657-3_43 · Cited by 719
New York Times Annotated Corpus
Sandhaus, E., & Linguistic Data Consortium (2012) · TIB Data Manager · doi:10.57702/qbrk4fuh · Cited by 586
AlSumait, L., Barbará, D., & Domeniconi, C. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.140 · Cited by 421
Efficient and effective spam filtering and re-ranking for large web datasets
Cormack, G. V., Smucker, M. D., & Clarke, C. L. A. (2011) · Information Retrieval · doi:10.1007/s10791-011-9162-z · Cited by 282
Concept-Based Information Retrieval Using Explicit Semantic Analysis
Egozi, O., Markovitch, S., & Gabrilovich, E. (2011) · ACM Transactions on Information Systems · doi:10.1145/1961209.1961211 · Cited by 277
Investigating task performance of probabilistic topic models: an empirical study of PLSA and LDA
Lu, Y., Mei, Q., & Zhai, C. (2011) · Information Retrieval · doi:10.1007/s10791-010-9141-9 · Cited by 259
Predicting user interests from contextual information
White, R. W., Bailey, P., & Chen, L. (2009) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1571941.1572005 · Cited by 238
An effective approach to document retrieval via utilizing WordNet and recognizing phrases
Liu, S., Liu, F., Yu, C., & Meng, W. (2004) · Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1008992.1009039 · Cited by 234
Latent concept expansion using markov random fields
Metzler, D., & Croft, W. B. (2007) · Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1277741.1277796 · Cited by 229
Improving the estimation of relevance models using large external corpora
Diaz, F., & Metzler, D. (2006) · Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1148170.1148200 · Cited by 199
Similarity measures for tracking information flow
Metzler, D., Bernstein, Y., Croft, W. B., Moffat, A., & Zobel, J. (2005) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1099554.1099695 · Cited by 196
Overview of the TREC 2012 Web Track
Clarke, C. L. A., Craswell, N., & Voorhees, E. M. (2012) · Text REtrieval Conference · Cited by 192
A Comparative Study of Utilizing Topic Models for Information Retrieval
Yi, X., & Allan, J. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00958-7_6 · Cited by 166
Probabilistic models of ranking novel documents for faceted topic retrieval
Carterette, B., & Chandar, P. (2009) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1645953.1646116 · Cited by 119
Parameterized concept weighting in verbose queries
Bendersky, M., Metzler, D., & Croft, W. B. (2011) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2009916.2009998 · Cited by 113
Overview of the TREC 2009 Web Track
Clarke, C. L. A., Craswell, N., Soboroff, I., & Voorhees, E. M. (2009) · Text REtrieval Conference · Cited by 96
Using query contexts in information retrieval
Bai, J., Nie, J., Cao, G., & Bouchard, H. (2007) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1277741.1277747 · Cited by 95
Improving weak ad-hoc queries using wikipedia asexternal corpus
Li, Y., Luk, R. W. P., Ho, K. S., & Chung, F.-L. (2007) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1277741.1277914 · Cited by 89
Latent topic feedback for information retrieval
Andrzejewski, D., & Buttler, D. J. (2011) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2020408.2020503 · Cited by 82
Ingwersen, P. (1994) · Springer eBooks · doi:10.1007/978-1-4471-2099-5_11 · Cited by 75
Query reformulation using automatically generated query concepts from a document space
Chang, Y., Ounis, I., & Kim, M. (2005) · Information Processing & Management · doi:10.1016/j.ipm.2005.03.025 · Cited by 52
Finding a good query‐related topic for boosting pseudo‐relevance feedback
Ye, Z., Huang, J. X., & Lin, H. (2011) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.21501 · Cited by 46
Finding good feedback documents
He, B., & Ounis, I. (2009) · doi:10.1145/1645953.1646289 · Cited by 45
Cited by
Yang, D., Kleissl, J., Gueymard, C. A., Pedro, H. T. C., & Coimbra, C. F. M. (2018) · Solar Energy · doi:10.1016/j.solener.2017.11.023 · Cited by 548
“What Can ChatGPT Do?” Analyzing Early Reactions to the Innovative AI Chatbot on Twitter
Taecharungroj, V. (2023) · Big Data and Cognitive Computing · doi:10.3390/bdcc7010035 · Cited by 489
Twitter and Research: A Systematic Literature Review Through Text Mining
Karami, A., Lundy, M., Webb, F., & Dwivedi, Y. K. (2020) · IEEE Access · doi:10.1109/access.2020.2983656 · Cited by 278
Extrinsic versus Intrinsic Rewards for Contributing Reviews in an Online Platform
Khern-am-nuai, W., Kannan, K., & Ghasemkhani, H. (2018) · Information Systems Research · doi:10.1287/isre.2017.0750 · Cited by 260
Harnessing Artificial Intelligence for Health Message Generation: The Folic Acid Message Engine
Schmälzle, R., & Wilcox, S. (2022) · Journal of Medical Internet Research · doi:10.2196/28858 · Cited by 43
“Additional results and visualizations of n-grams, word clouds, and results from topic modeling can be found in Multimedia Appendix 1 [65-67,69-73].”
Metadata
- Authors
- Deveaud, R., SanJuan, E., & Bellot, P.
- Venue
- Document numérique
- Publisher
- Lavoisier
- Published
- 2014-04-30
- Volume
- 17
- Issue
- 1
- Pages
- 61-84
- ISSN
- 1279-5127 (ISSN-L)
- OpenAlex
- W2006604430
- Cited by
- 609
- References
- 41
- FWCI
- 7.40
- Type
- journal article
- Language
- en
- Open access
- bronze
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.