The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Journal of Intelligent Information Systems
Open accessAbstract
▶ Covers the integration of artificial intelligence and database technologies to create next generation Intelligent Information Systems ▶ Presents papers describing theoretical aspects, systems architecture, analysis and design tools and techniques, and implementation experiences in intelligent information systems ▶ Includes research papers, invited papers, meeting, workshop and conference announcements and reports, survey and tutorial articles, and book reviews ▶ 91% of authors who answered a survey reported that they would definitely publish or probably publish in the journal again
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
Efficient Estimation of Word Representations in Vector Space
Mikolov, T., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1301.3781 · Cited by 26,568
Distributed Representations of Words and Phrases and their Compositionality
Mikolov, T., Sutskever, I., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1310.4546 · Cited by 24,533
Introduction to Information Retrieval
Manning, C. D., Raghavan, P., & Schütze, H. (2008) · doi:10.1017/cbo9780511809071 · Cited by 11,288
Distributed Representations of Sentences and Documents
Le, Q. V., & Mikolov, T. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1405.4053 · Cited by 4,934
Formal Concept Analysis: Mathematical Foundations
Ganter, B., Wille, R., & Franzke, C. (1998) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,245
A Comparison of Document Clustering Techniques
Steinbach, M. S., Karypis, G., & Kumar, V. (2000) · Cited by 2,532
A Synopsis of Linguistic Theory, 1930-1955
Firth, J. R. (1957) · Medical Entomology and Zoology · Cited by 1,675
Discovering Frequent Closed Itemsets for Association Rules
Pasquier, N., Bastide, Y., Taouil, R., & Lakhal, L. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49257-7_25 · Cited by 1,378
Improving Word Representations via Global Context and Multiple Word Prototypes
Huang, E., Socher, R., Manning, C. D., & Ng, A. Y. (2012) · Cited by 1,073
Scatter/Gather: a cluster-based approach to browsing large document collections
Cutting, D. R., Karger, D. R., Pedersen, J. O., & Tukey, J. W. (1992) · Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '92 · doi:10.1145/133160.133214 · Cited by 953
Improved automatic keyword extraction given more linguistic knowledge
Hulth, A. (2003) · Proceedings of the 2003 conference on Empirical methods in natural language processing - · doi:10.3115/1119355.1119383 · Cited by 951
CHARM: An Efficient Algorithm for Closed Itemset Mining
Zaki, M. J., & Hsiao, C.-J. (2002) · Proceedings of the 2002 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972726.27 · Cited by 929
Technical terminology: some linguistic properties and an algorithm for identification in text
Justeson, J. S., & Katz, S. M. (1995) · Natural Language Engineering · doi:10.1017/s1351324900000048 · Cited by 820
Entity Linking meets Word Sense Disambiguation: a Unified Approach
Moro, A., Raganato, A., & Navigli, R. (2014) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00179 · Cited by 743
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
Wikipedia-based Semantic Interpretation for Natural Language Processing
Gabrilovich, E., & Markovitch, S. (2009) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2669 · Cited by 377
Ontologies improve text document clustering
Hotho, A., Staab, S., & Stumme, G. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250972 · Cited by 355
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
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
Lingo: Search Results Clustering Algorithm Based on Singular Value Decomposition
Osiński, S., Stefanowski, J., & Weiss, D. (2004) · Intelligent Information Processing and Web Mining · doi:10.1007/978-3-540-39985-8_37 · Cited by 282
A Concept-Driven Algorithm for Clustering Search Results
Osiński, S., & Weiss, D. (2005) · IEEE Intelligent Systems · doi:10.1109/mis.2005.38 · Cited by 253
Embeddings for Word Sense Disambiguation: An Evaluation Study
Iacobacci, I., Pilehvar, M. T., & Navigli, R. (2016) · Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p16-1085 · Cited by 253
Exploiting internal and external semantics for the clustering of short texts using world knowledge
Hu, X., Sun, N., Zhang, C., & Chua, T.-S. (2009) · Proceedings of the 18th ACM conference on Information and knowledge management · doi:10.1145/1645953.1646071 · Cited by 244
Self-Taught convolutional neural networks for short text clustering
Xu, J., Xu, B., Wang, P., Zheng, S., Tian, G., Zhao, J., & Xu, B. (2017) · Neural Networks · doi:10.1016/j.neunet.2016.12.008 · Cited by 240
Fast and Accurate Annotation of Short Texts with Wikipedia Pages
Ferragina, P., & Scaiella, U. (2012) · IEEE Software · doi:10.1109/ms.2011.122 · Cited by 237
Andrade, M. A., & Valencia, A. (1998) · Bioinformatics · doi:10.1093/bioinformatics/14.7.600 · Cited by 216
Clustering and Diversifying Web Search Results with Graph-Based Word Sense Induction
Marco, A. D., & Roberto Navigli, A. (2012) · Computational Linguistics · doi:10.1162/coli_a_00148 · Cited by 166
Mining Domain-Specific Thesauri from Wikipedia: A Case Study
Milne, D., Medelyan, O., & Witten, I. H. (2006) · IEEE/WIC/ACM International Conference on Web Intelligence · doi:10.1109/wi.2006.119 · Cited by 142
Inducing Word Senses to Improve Web Search Result Clustering
Roberto Navigli, A., & Crisafulli, G. (2010) · IRIS Research product catalog (Sapienza University of Rome) · Cited by 124
Semi-Supervised Word Sense Disambiguation Using Word Embeddings in General and Specific Domains
Taghipour, K., & Ng, H. T. (2015) · Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT) · doi:10.3115/v1/n15-1035 · Cited by 107
Uno, T. (2014) · Springer eBooks · doi:10.1007/978-3-642-27848-8_722-1 · Cited by 63
Clustering Web Search Results with Maximum Spanning Trees
Marco, A. D., & Roberto Navigli, A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23954-0_20 · Cited by 23
Krause, S., Hennig, L., Moro, A., Weissenborn, D., Xu, F., Uszkoreit, H., & Roberto Navigli, A. (2016) · Journal of Web Semantics · doi:10.1016/j.websem.2016.03.004 · Cited by 22
Cited by
Recommender systems in the healthcare domain: state-of-the-art and research issues
Tran, T. N. T., Felfernig, A., Trattner, C., & Holzinger, A. (2021) · Journal of Intelligent Information Systems · doi:10.1007/s10844-020-00633-6 · Cited by 303
Metadata
- Venue
- Journal of Intelligent Information Systems
- Published
- 2013-05-25
- ISSN
- 0925-9902 (ISSN-L)
- 1573-7675
- OpenAlex
- W4242635839
- Cited by
- 279
- References
- 33
- Type
- paratext
- Language
- en
- Open access
- hybrid
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.