Self-Tuned Descriptive Document Clustering Using a Predictive Network
Open accessThe DOI matches its Crossref record; 88 of the 93 references it cites were found in a registry or an index, and 2 are not checked yet.
Abstract
Descriptive clustering consists of automatically organizing data instances into clusters and generating a descriptive summary for each cluster. The description should inform a user about the contents of each cluster without further examination of the specific instances, enabling a user to rapidly scan for relevant clusters. Selection of descriptions often relies on heuristic criteria. We model descriptive clustering as an auto-encoder network that predicts features from cluster assignments and predicts cluster assignments from a subset of features. The subset of features used for predicting a cluster serves as its description. For text documents, the occurrence or count of words, phrases, or other attributes provides a sparse feature representation with interpretable feature labels. In the proposed network, cluster predictions are made using logistic regression models, and feature predictions rely on logistic or multinomial regression models. Optimizing these models leads to a completely self-tuned descriptive clustering approach that automatically selects the number of clusters and the number of features for each cluster. We applied the methodology to a variety of short text documents and showed that the selected clustering, as evidenced by the selected feature subsets, are associated with a meaningful topical organization.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“It also incorporates a statistical selection process for identifying the key terms characterising each cluster (Brockmeier et al. 2018).”
From Artificial intelligence for literature reviews: opportunities and challenges (2024) · cites this paper as Brockmeier et al. 2018
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
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Estimating the Dimension of a Model
Schwarz, G. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344136 · Cited by 47,033
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,410
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
Regularization and Variable Selection Via the Elastic Net
Zou, H., & Hastie, T. (2005) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00503.x · Cited by 20,957
Regularization Paths for Generalized Linear Models via Coordinate Descent
Friedman, J., Hastie, T., & Tibshirani, R. (2010) · Journal of Statistical Software · doi:10.18637/jss.v033.i01 · Cited by 19,927
Information Theory and an Extension of the Maximum Likelihood Principle
Akaike, H. (1998) · Springer Series in Statistics · doi:10.1007/978-1-4612-1694-0_15 · Cited by 17,781
"Why Should I Trust You?": Explaining the Predictions of Any Classifier
Ribeiro, M. T., Singh, S., & Guestrin, C. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939778 · Cited by 17,555
Learning Internal Representations by Error Propagation
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1985) · doi:10.21236/ada164453 · Cited by 16,172
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
Classification And Regression Trees
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (2017) · doi:10.1201/9781315139470 · Cited by 11,417
Peng, H., Long, F., & Ding, C. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.159 · Cited by 10,544
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
Wrappers for feature subset selection
Kohavi, R., & John, G. H. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00043-x · Cited by 8,947
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
An introduction to variable and feature selection
GuyonIsabelle, & ElisseeffAndré (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944968 · Cited by 7,715
A vector space model for automatic indexing
Salton, G., Wong, A., & Yang, C. S. (1975) · Communications of the ACM · doi:10.1145/361219.361220 · Cited by 7,521 · cited 1×
“to the similarity matrix implicitly formed from the cosine similarity between the TF-IDF vectors [80], and the spec-”
Background“Why Should I Trust You?”: Explaining the Predictions of Any Classifier
Ribeiro, M., Singh, S., & Guestrin, C. (2016) · Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Demonstrations · doi:10.18653/v1/n16-3020 · Cited by 6,682
An Introduction to Variable and Feature Selection.
Guyon, I., & Elisseeff, A. (2003) · Cited by 6,576
Survey of Clustering Algorithms
Xu, R., & WunschII, D. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.845141 · Cited by 6,197
Griffiths, T. L., & Steyvers, M. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307752101 · Cited by 6,049 · cited 1×
“Specifically, latent topic models [44], [45] assume the words in each document are drawn from a mixture of word distributions, where each word distribution is associated with a topic.”
BackgroundA Comparative Study on Feature Selection in Text Categorization
Yang, Y., & Pedersen, J. (1997) · Cited by 4,790
Probabilistic Latent Semantic Indexing
Hofmann, T. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130370 · Cited by 3,988
Probabilistic latent semantic indexing
Hofmann, T. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312649 · Cited by 3,976
A survey of cross-validation procedures for model selection
Arlot, S., & Célisse, A. (2010) · LillOA (Université de Lille (University Of Lille)) · Cited by 3,669
Word association norms, mutual information, and lexicography
Church, K., & Hanks, P. (1990) · doi:10.5555/89086.89095 · Cited by 3,590
Figueiredo, M. A. T., Nowak, R. D., & Wright, S. J. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910281 · Cited by 3,524
A survey of cross-validation procedures for model selection
Arlot, S., & Celisse, A. (2010) · Statistics Surveys · doi:10.1214/09-ss054 · Cited by 3,522 · cited 6×
“(13) to BIC by using the negative log-likelihood for the expected loss and setting a ¼ ln ffiffiffinp , where n is the number of instances in the sample.”
BackgroundMethodInfluentialA learning algorithm for Boltzmann machines
Ackley, D. H., Hinton, G. E., & Sejnowski, T. J. (1985) · Cognitive Science · doi:10.1207/s15516709cog0901_7 · Cited by 3,402
A sentimental education: sentiment analysis using subjectivity summarization based on minimum cuts
Pang, B., & Lee, L. (2004) · Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics - ACL '04 · doi:10.3115/1218955.1218990 · Cited by 3,301
Character-level Convolutional Networks for Text Classification
Zhang, X., Zhao, J., & LeCun, Y. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1509.01626 · Cited by 3,205
Information Theory and an Extension of the Maximum Likelihood Principle
Akaike, H. (1992) · Springer Series in Statistics · doi:10.1007/978-1-4612-0919-5_38 · Cited by 3,028
The use of MMR, diversity-based reranking for reordering documents and producing summaries
Carbonell, J., & Goldstein, J. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.291025 · Cited by 2,329
The SMART Retrieval System—Experiments in Automatic Document Processing
Salton, G. (1971) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,252
The Use of MMR, Diversity-Based Reranking for Reordering Documents and Producing Summaries
Carbonell, J., & Goldstein, J. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130369 · Cited by 2,156
NewsWeeder: Learning to Filter Netnews
Lang, K. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50048-7 · Cited by 2,051
(2007) · Cited by 2,018
Toward optimal feature selection
Koller, D., & Sahami, M. (1996) · Cited by 1,482
Inductive learning algorithms and representations for text categorization
Dumais, S., Platt, J., Heckerman, D., & Sahami, M. (1998) · Proceedings of the seventh international conference on Information and knowledge management · doi:10.1145/288627.288651 · Cited by 1,461
Conditional Likelihood Maximisation: A Unifying Framework for Mutual Information Feature Selection
Brown, G., Pocock, A., Zhao, M., & Luján, M. (2012) · Research Explorer (The University of Manchester) · Cited by 1,359
(2011) · Cited by 1,258
Web document clustering: a feasibility demonstration
Zamir, O., & Etzioni, O. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.290956 · Cited by 1,055
Feature Selection via Concave Minimization and Support Vector Machines
Bradley, P. S., & Mangasarian, O. L. (1998) · Cited by 984
Distributional clustering of English words
Pereira, F., Tishby, N., & Lee, L. (1993) · Proceedings of the 31st annual meeting on Association for Computational Linguistics - · doi:10.3115/981574.981598 · Cited by 974
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
1-norm Support Vector Machines
Zhu, J., Rosset, S., Tibshirani, R. J., & Hastie, T. J. (2003) · neural information processing systems · Cited by 948
Self organization of a massive document collection
Kohonen, T., Kaski, S., Lagus, K., Salojarvi, J., Honkela, J., Paatero, V., & Saarela, A. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.846729 · Cited by 908
Reexamining the cluster hypothesis: scatter/gather on retrieval results
Hearst, M. A., & Pedersen, J. O. (1996) · Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '96 · doi:10.1145/243199.243216 · Cited by 822
Strong Rules for Discarding Predictors in Lasso-Type Problems
Tibshirani, R., Bien, J., Friedman, J., Hastie, T., Simon, N., Taylor, J., & Tibshirani, R. J. (2012) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2011.01004.x · Cited by 653
Optimal Thresholding of Classifiers to Maximize F1 Measure
Lipton, Z. C., Elkan, C., & Naryanaswamy, B. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-44851-9_15 · Cited by 596
Fast Binary Feature Selection with Conditional Mutual Information
FleuretFrançois (2004) · Journal of Machine Learning Research · doi:10.5555/1005332.1044711 · Cited by 593
An Interior-Point Method for Large-Scale '1-Regularized Logistic Regression
Koh, K., Kim, S.-J., & Boyd, S. (2007) · Cited by 579
WEBSOM – Self-organizing maps of document collections
Kaski, S., Honkela, T., Lagus, K., & Kohonen, T. (1998) · Neurocomputing · doi:10.1016/s0925-2312(98)00039-3 · Cited by 495
Document clustering using word clusters via the information bottleneck method
Slonim, N., & Tishby, N. (2000) · Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/345508.345578 · Cited by 474
A survey of Web clustering engines
Carpineto, C., Osiński, S., Romano, G., & Weiss, D. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541884 · Cited by 399
Data Visualization and Feature Selection: New Algorithms for Nongaussian Data
Yang, H. H., & Moody, J. E. (1999) · Cited by 392
Automatic labeling of multinomial topic models
Mei, Q., Shen, X., & Zhai, C. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281246 · Cited by 384
Grafting: fast, incremental feature selection by gradient descent in function space
Perkins, S. J., Lacker, K., & Theiler, J. P. (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944976 · Cited by 359
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
LIBLINEAR: A Library for Large Linear Classification
FanRong-En, ChangKai-Wei, HsiehCho-Jui, WangXiang-Rui, & LinChih-Jen (2008) · Journal of Machine Learning Research · doi:10.5555/1390681.1442794 · Cited by 328
Automatic Labelling of Topic Models
Lau, J. H., Grieser, K., Newman, D. J., & Baldwin, T. (2011) · Cited by 285
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
Information-Theoretic Feature Selection in Microarray Data Using Variable Complementarity
Meyer, P. E., Schretter, C., & Bontempi, G. (2008) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2008.923858 · Cited by 280
Entropy and Correlation: Some Comments
Kvalseth, T. O. (1987) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1987.4309069 · Cited by 253
An Interior-Point Method for Large-Scale l1-Regularized Logistic Regression
KohKwangmoo, KimSeung-Jean, & BoydStephen (2007) · Journal of Machine Learning Research · doi:10.5555/1314498.1314550 · Cited by 231
Design rationale: Concepts, techniques, and use
Dillon, A. P. (1997) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199708)48:8<718::aid-asi5>3.0.co;2-v · Cited by 227
Integrating Document Clustering and Topic ModelingPreprint
Xie, P., & Xing, E. P. (2013) · arXiv (Cornell University) · doi:10.1184/r1/6475811 · Cited by 222
Constant interaction-time scatter/gather browsing of very large document collections
Cutting, D. R., Karger, D. R., & Pedersen, J. O. (1993) · Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '93 · doi:10.1145/160688.160706 · Cited by 207
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
Greedy Sparsity-Constrained OptimizationPreprint
Bahmani, S., Raj, B., & Boufounos, P. T. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1203.5483 · Cited by 162
Learning Understandable Neural Networks With Nonnegative Weight Constraints
Chorowski, J., & Zurada, J. M. (2015) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2014.2310059 · Cited by 161
Towards Ultrahigh Dimensional Feature Selection for Big Data
Tan, M., Tsang, I. W.-H., & Wang, L. (2012) · DR-NTU (Nanyang Technological University) · doi:10.48550/arxiv.1209.5260 · Cited by 142
A cartographic approach to visualizing conference abstracts
Skupin, A. (2002) · IEEE Computer Graphics and Applications · doi:10.1109/38.974518 · Cited by 134
Document clustering via adaptive subspace iteration
Li, T., Ma, S., & Ogihara, M. (2004) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1008992.1009031 · Cited by 127
Topical clustering of search results
Scaiella, U., Ferragina, P., Marino, A., & Ciaramita, M. (2012) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2124295.2124324 · Cited by 116
Keyword selection method for characterizing text document maps
Lagus, K. (1999) · International Conference on Artificial Neural Networks · doi:10.1049/cp:19991137 · Cited by 111
Grouped Orthogonal Matching Pursuit for Variable Selection and Prediction
Świrszcz, G., Abe, N., & Lozano, A. C. (2009) · neural information processing systems · Cited by 110
Full-Subtopic Retrieval with Keyphrase-Based Search Results Clustering
Bernardini, A., Carpineto, C., & D’Amico, M. (2009) · IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT) · doi:10.1109/wi-iat.2009.37 · Cited by 68
Generic title labeling for clustered documents
Tseng, Y. (2009) · Expert Systems with Applications · doi:10.1016/j.eswa.2009.07.048 · Cited by 53
The Use of Categories and Clusters for Organizing Retrieval Results
Hearst, M. A. (1999) · Text, speech and language technology · doi:10.1007/978-94-017-2388-6_14 · Cited by 42
Hierarchical Theme and Topic Modeling
Chien, J. (2015) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2015.2414658 · Cited by 36
A THEMATIC ANALYSIS OF THE AIDS LITERATURE
Wilbur, W. J. (2001) · Pacific Symposium on Biocomputing (PSB) · doi:10.1142/9789812799623_0036 · Cited by 32
Parsimonious Topic Models with Salient Word Discovery
Soleimani, H., & Miller, D. J. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2345378 · Cited by 26
1 Parsimonious Topic Models with Salient Word DiscoveryPreprint
Soleimani, H., & Miller, D. J. (2016) · Cited by 25
Representing topics labels for exploring digital libraries
Αλέτρας, Ν., Baldwin, T., Lau, J. H., & Stevenson, M. (2014) · ACM/IEEE Joint Conference on Digital Libraries · doi:10.1109/jcdl.2014.6970174 · Cited by 21
A classification approach to Boolean query reformulation
French, J. C., Brown, D. E., & Kim, N. (1997) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199708)48:8<694::aid-asi3>3.0.co;2-n · Cited by 21
Mu, T., Goulermas, J. Y., Korkontzelos, I., & Ananiadou, S. (2014) · Journal of the Association for Information Science and Technology · doi:10.1002/asi.23374 · Cited by 19
Self-citationRepresenting Topics Labels for Exploring Digital Libraries
Αλέτρας, Ν., Baldwin, T., Lau, J. H., & Stevenson, M. (2015) · Cited by 19
Towards subjectifying text clustering
Dasgupta, S., & Ng, V. (2010) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1835449.1835530 · Cited by 7
Research works printed but not linked: 2
- Salton, 1971, The SMART Retrieval SystemExperiments in Automatic Document Processing
- 10.1177/147447409700400103 · doi:10.1177/147447409700400103
Cited by
Artificial intelligence for literature reviews: opportunities and challenges
Bolaños, F., Salatino, A., Osborne, F., & Motta, E. (2024) · Artificial Intelligence Review · doi:10.1007/s10462-024-10902-3 · Cited by 246
“It also incorporates a statistical selection process for identifying the key terms characterising each cluster [98].”
Prioritising references for systematic reviews with RobotAnalyst: A user study
Przybyła, P., Brockmeier, A. J., Kontonatsios, G., Le Pogam, M., McNaught, J., von Elm, E., Nolan, K., & Ananiadou, S. (2018) · Research Synthesis Methods · doi:10.1002/jrsm.1311 · Cited by 148
“The number of keywords used for each cluster is selected by statistical model order selection using the Bayesian information criterion 79 after fitting a model to predict the cluster membership based on the presence of the keywords.”
BackgroundMethodSelf-citationPhrase2Vec: Phrase embedding based on parsing
Wu, Y., Zhao, S., & Li, W. (2019) · Information Sciences · doi:10.1016/j.ins.2019.12.031 · Cited by 63
Using neural networks to support high-quality evidence mapping
Røst, T. B., Slaughter, L. A., Nytrø, Ø., Muller, A. E., & Vist, G. E. (2021) · BMC Bioinformatics · doi:10.1186/s12859-021-04396-x · Cited by 11
Venkanna, G., & Bharati, K. F. (2021) · The Computer Journal · doi:10.1093/comjnl/bxab013 · Cited by 9
Metadata
- Authors
- Brockmeier, A. J., Mu, T., Ananiadou, S., & Goulermas, J. Y.
- Affiliations
- University of Liverpool (GB)
- University of Manchester (GB)
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2018-10-01
- Volume
- 30
- Issue
- 10
- Pages
- 1929-1942
- ISSN
- 1041-4347 (ISSN-L)
- 1558-2191
- 2326-3865
- OpenAlex
- W2774568884
- Cited by
- 15
- References
- 93
- Citations by year
- 2024: 2 · 2023: 2 · 2022: 2 · 2021: 4 · 2020: 2 · 2019: 1 · 2018: 2
- FWCI
- 1.26
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Locations
- IEEE Transactions on Knowledge and Data Engineering (publishedVersion, cc-by)
- Research Explorer (The University of Manchester) (publishedVersion, other-oa)
- Funders
- Medical Research Council (MR/L01078X/1, MR/N015665/1)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Advanced Clustering Algorithms Research
- Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
- Physical Sciences › Computer Science › Artificial Intelligence › Text and Document Classification Technologies
- Keywords
- document clustering, autoencoder, cluster description, feature selection, automatic cluster number selection, sparse feature representation, topic organization, logistic regression, multinomial regression
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.