The DOI matches its Crossref record; 100 of the 100 references it cites were found in a registry or an index.
Data Streams: Algorithms and Applications
Abstract
In the data stream scenario, input arrives very rapidly and there is limited memory to store the input. Algorithms have to work with one or few passes over the data, space less than linear in the input size or time significantly less than the input size. In the past few years, a new theory has emerged for reasoning about algorithms that work within these constraints on space, time, and number of passes. Some of the methods rely on metric embeddings, pseudo-random computations, sparse approximation theory and communication complexity. The applications for this scenario include IP network traffic analysis, mining text message streams and processing massive data sets in general. Researchers in Theoretical Computer Science, Databases, IP Networking and Computer Systems are working on the data stream challenges. This article is an overview and survey of data stream algorithmics and is an updated version of [175].
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
(1979) · Cited by 43,841
Donoho, D. L. (2004) · Cited by 16,703
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
Wireless sensor networks for habitat monitoring
Mainwaring, A., Culler, D., Polastre, J., Szewczyk, R., & Anderson, J. (2002) · Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications · doi:10.1145/570738.570751 · Cited by 4,166
Greed is Good: Algorithmic Results for Sparse Approximation
Tropp, J. A. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834793 · Cited by 3,635
THE POPULATION FREQUENCIES OF SPECIES AND THE ESTIMATION OF POPULATION PARAMETERS
GOOD, I. J. (1953) · Biometrika · doi:10.1093/biomet/40.3-4.237 · Cited by 3,437
A threshold of ln n for approximating set cover
Feige, U. (1998) · Journal of the ACM · doi:10.1145/285055.285059 · Cited by 3,086
Sparse Approximate Solutions to Linear Systems
Natarajan, B. K. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792240406 · Cited by 2,783
Protocols for secure computations
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.88 · Cited by 2,661
Models and issues in data stream systems
Babcock, B., Babu, S., Datar, M., Motwani, R., & Widom, J. (2002) · Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/543613.543615 · Cited by 2,495
DeVore, R. A., & Lorentz, G. G. (1993) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-662-02888-9 · Cited by 2,352
Human Behavior and the Principle of Least Effort: An Introduction to Human Ecology
Chao, Y. R., & Zipf, G. K. (1950) · Language · doi:10.2307/409735 · Cited by 2,193
Zur Theorie der orthogonalen Funktionensysteme: Erste Mitteilung
Haar, A. (1910) · Mathematische Annalen · doi:10.1007/bf01456326 · Cited by 2,138
Juang, P., Oki, H., Wang, Y., Martonosi, M., Peh, L. S., & Rubenstein, D. (2002) · Proceedings of the 10th international conference on Architectural support for programming languages and operating systems · doi:10.1145/605397.605408 · Cited by 1,804
An improved data stream summary: the count-min sketch and its applications
Cormode, G., & Muthukrishnan, S. (2005) · Journal of Algorithms · doi:10.1016/j.jalgor.2003.12.001 · Cited by 1,743
Self-citation(2005) · Complexity Theory · doi:10.1007/3-540-27477-4_15 · Cited by 1,629
(2000) · Choice Reviews Online · doi:10.5860/choice.37-5723 · Cited by 1,616
Aurora: a new model and architecture for data stream management
Abadi, D. J., Carney, D., �etintemel, U., Cherniack, M., Convey, C., Lee, S., Stonebraker, M., Tatbul, N., & Zdonik, S. (2003) · The VLDB Journal The International Journal on Very Large Data Bases · doi:10.1007/s00778-003-0095-z · Cited by 1,495
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Knuth, D. E. (1998) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 1,421
Finding frequent items in data streams
Charikar, M., Chen, K., & Farach-Colton, M. (2004) · Theoretical Computer Science · doi:10.1016/s0304-3975(03)00400-6 · Cited by 1,278
Efficient Private Matching and Set Intersection
Freedman, M. J., Nissim, K., & Pinkas, B. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_1 · Cited by 1,266
Approximate frequency counts over data streams
Manku, G. S., & Motwani, R. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2367502.2367508 · Cited by 1,178
Adaptive greedy approximations
Davis, G., Mallat, S., & Avellaneda, M. (1997) · Constructive Approximation · doi:10.1007/bf02678430 · Cited by 1,166
Bursty and hierarchical structure in streams
Kleinberg, J. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775061 · Cited by 1,160
A linear space algorithm for computing maximal common subsequences
Hirschberg, D. S. (1975) · Communications of the ACM · doi:10.1145/360825.360861 · Cited by 1,093
NiagaraCQ: a scalable continuous query system for Internet databases
Chen, J., DeWitt, D. J., Tian, F., & Wang, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335432 · Cited by 1,022
On the hardness of approximating minimization problems
Lund, C., & Yannakakis, M. (1994) · Journal of the ACM · doi:10.1145/185675.306789 · Cited by 872
The space complexity of approximating the frequency moments
Alon, N., Matias, Y., & Szegedy, M. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237823 · Cited by 822
Efficient Computation of Frequent and Top-k Elements in Data Streams
Metwally, A., Agrawal, D., & El Abbadi, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30570-5_27 · Cited by 681
Guha, S., Mishra, N., Motwani, R., & O'Callaghan, L. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892124 · Cited by 623
Exploratory Data Mining and Data Cleaning
Dasu, T., & Johnson, T. (2003) · Wiley Series in Probability and Statistics · doi:10.1002/0471448354 · Cited by 618
An information statistics approach to data stream and communication complexity
Bar-Yossef, Z., Jayram, T. S., Kumar, R., & Sivakumar, D. (2004) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2003.11.006 · Cited by 606
New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice
Estan, C., & Varghese, G. (2003) · ACM Transactions on Computer Systems · doi:10.1145/859716.859719 · Cited by 539
What's hot and what's not: tracking most frequent items dynamically
Cormode, G., & Muthukrishnan, S. (2005) · ACM Transactions on Database Systems · doi:10.1145/1061318.1061325 · Cited by 533
Self-citationSketch-based change detection: methods, evaluation, and applications
Krishnamurthy, B., Sen, S., Zhang, Y., & Chen, Y. (2003) · Proceedings of the 2003 ACM SIGCOMM conference on Internet measurement - IMC '03 · doi:10.1145/948205.948236 · Cited by 528
Synopsis diffusion for robust aggregation in sensor networks
Nath, S., Gibbons, P. B., Seshan, S., & Anderson, Z. R. (2004) · Proceedings of the 2nd international conference on Embedded networked sensor systems · doi:10.1145/1031495.1031525 · Cited by 510
Misra, J., & Gries, D. (1982) · Science of Computer Programming · doi:10.1016/0167-6423(82)90012-0 · Cited by 507
A simple algorithm for finding frequent elements in streams and bags
Karp, R. M., Shenker, S., & Papadimitriou, C. H. (2003) · ACM Transactions on Database Systems · doi:10.1145/762471.762473 · Cited by 491
Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
Drineas, P., Kannan, R., & Mahoney, M. W. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539704442684 · Cited by 487
Counting Distinct Elements in a Data Stream
Bar-Yossef, Z., Jayram, T. S., Kumar, R., Sivakumar, D., & Trevisan, L. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45726-7_1 · Cited by 460
Space-efficient online computation of quantile summaries
Greenwald, M., & Khanna, S. (2001) · Proceedings of the 2001 ACM SIGMOD international conference on Management of data · doi:10.1145/375663.375670 · Cited by 451
Cryptographic techniques for privacy-preserving data mining
Pinkas, B. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/772862.772865 · Cited by 430
Privacy-preserving distributed k-means clustering over arbitrarily partitioned data
Jagannathan, G., & Wright, R. N. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081942 · Cited by 420
Henzinger, M., Raghavan, P., & Rajagopalan, S. (1999) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/050/05 · Cited by 418
On graph problems in a semi-streaming model
Joan Feigenbaum, A., Kannan, S., McGregor, A., Suri, S., & Zhang, J. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.09.013 · Cited by 402
Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries
Gilbert, A. C., Kotidis, Y., Muthukrishnan, S., & Strauss, M. J. (2001) · Cited by 376
Self-citationMin-wise independent permutations (extended abstract)
Broder, A. Z., Charikar, M., Frieze, A. M., & Mitzenmacher, M. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276781 · Cited by 364
Incremental clustering and dynamic information retrieval
Charikar, M., Chekuri, C., Feder, T., & Motwani, R. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258657 · Cited by 354
Approximate counts and quantiles over sliding windows
Arasu, A., & Manku, G. S. (2004) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1055558.1055598 · Cited by 346
Automatically inferring patterns of resource consumption in network traffic
Estan, C., Savage, S., & Varghese, G. (2003) · Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/863955.863972 · Cited by 286
Seidel, R., & Aragon, C. R. (1996) · Algorithmica · doi:10.1007/bf01940876 · Cited by 281
On computing correlated aggregates over continual data streams
Gehrke, J., Korn, F., & Srivastava, D. (2001) · Proceedings of the 2001 ACM SIGMOD international conference on Management of data · doi:10.1145/375663.375665 · Cited by 278
STREAM: the stanford stream data manager (demonstration description)
Arasu, A., Babcock, B., Babu, S., Datar, M., Ito, K., Nishizawa, I., Rosenstein, J., & Widom, J. (2003) · Proceedings of the 2003 ACM SIGMOD international conference on Management of data · doi:10.1145/872757.872854 · Cited by 264
Near-optimal sparse fourier representations via sampling
Gilbert, A. C., Guha, S., Indyk, P., Muthukrishnan, S., & Strauss, M. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.509933 · Cited by 259
Self-citationGeometric Approximation via Coresets
Agarwal, P. K., Har-Peled, S., & Varadarajan, K. R. (2005) · Combinatorial and Computational Geometry · doi:10.1017/9781009701259.002 · Cited by 256
Maintaining stream statistics over sliding windows: (extended abstract)
Datar, M., Gionis, A., Indyk, P., & Motwani, R. (2002) · doi:10.5555/545381.545466 · Cited by 253
Fast, small-space algorithms for approximate histogram maintenance
Gilbert, A. C., Guha, S., Indyk, P., Kotidis, Y., Muthukrishnan, S., & Strauss, M. J. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.509966 · Cited by 242
Self-citationStable distributions, pseudorandom generators, embeddings and data stream computation
Indyk, P. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892082 · Cited by 238
Random sampling for histogram construction
Chaudhuri, S., Motwani, R., & Narasayya, V. R. (1998) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/276304.276343 · Cited by 234
Better streaming algorithms for clustering problems
Charikar, M., O'Callaghan, L., & Panigrahy, R. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780548 · Cited by 230
Estimating simple functions on the union of data streams
Gibbons, P. B., & Tirthapura, S. (2001) · doi:10.1145/378580.378687 · Cited by 217
Tracking join and self-join sizes in limited storage
Alon, N., Gibbons, P. B., Matias, Y., & Szegedy, M. (1999) · doi:10.1145/303976.303978 · Cited by 211
Dynamic multidimensional histograms
Thaper, N., Guha, S., Indyk, P., & Koudas, N. (2002) · Proceedings of the 2002 ACM SIGMOD international conference on Management of data · doi:10.1145/564691.564741 · Cited by 206
Improved time bounds for near-optimal sparse Fourier representations
Gilbert, A. C., Muthukrishnan, S., & Strauss, M. (2005) · SPIE Proceedings · doi:10.1117/12.615931 · Cited by 204
Self-citationComparing information without leaking it
Fagin, R., Naor, M., & Winkler, P. (1996) · Communications of the ACM · doi:10.1145/229459.229469 · Cited by 200
Finding Hierarchical Heavy Hitters in Data Streams
Cormode, G., Korn, F. R., Muthukrishnan, S., & Srivastava, D. (2003) · Elsevier eBooks · doi:10.1016/b978-012722442-8/50048-3 · Cited by 199
Self-citationOnline identification of hierarchical heavy hitters
Zhang, Y., Singh, S. R., Sen, S. B., Duffield, N. G., & Lund, C. (2004) · ACM Internet Measurement Conference (IMC) · doi:10.1145/1028788.1028802 · Cited by 198
Cortes, C., Pregibon, D., & Volinsky, C. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44816-0_11 · Cited by 192
Comparing Data Streams Using Hamming Norms (How to Zero In)
Cormode, G., Datar, M., Indyk, P., & Muthukrishnan, S. (2002) · Elsevier eBooks · doi:10.1016/b978-155860869-6/50037-8 · Cited by 190
Self-citationMining database structure; or, how to build a data quality browser
Dasu, T., Johnson, T. J., Muthukrishnan, S., & Shkapenyuk, V. (2002) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/564691.564719 · Cited by 183
Self-citationApproximation of functions over redundant dictionaries using coherence
Gilbert, A. C., Muthukrishnan, S., & Strauss, M. J. (2003) · doi:10.5555/644108.644149 · Cited by 183
Self-citationHancock: a language for extracting signatures from data streams
Cortes, C., Fisher, K., Pregibon, D., & Rogers, A. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347094 · Cited by 179
Gilbert, A. C., Kotidis, Y., Muthukrishnan, S., & Strauss, M. J. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50047-0 · Cited by 173
Self-citationFast computation of low rank matrix approximations
Achlioptas, D., & McSherry, F. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380858 · Cited by 172
An Approximate L p-Difference Algorithm for Massive Data Streams: Extended Abstract
Fong, J. H., & Strauss, M. J. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-46541-3_16 · Cited by 163
Secure Computation of the k th -Ranked Element
Aggarwal, G., Mishra, N., & Pinkas, B. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_3 · Cited by 158
Flajolet, P., & Martin, G. N. (1983) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1983.46 · Cited by 155
Tight lower bounds for the distinct elements problem
Indyk, P., & Woodruff, D. P. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2003.1238202 · Cited by 153
Identifying frequent items in sliding windows over on-line packet streams
Golab, L., DeHaan, D., Demaine, E. D., López-Ortíz, A., & Munro, J. I. (2003) · ACM Internet Measurement Conference (IMC) · doi:10.1145/948205.948227 · Cited by 152
Optimal space lower bounds for all frequency moments
Woodruff, D. P. (2004) · Cited by 147
Coresets in dynamic geometric data streams
Frahling, G., & Sohler, C. (2005) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1060590.1060622 · Cited by 129
Space efficient mining of multigraph streams
Cormode, G., & Muthukrishnan, S. (2005) · ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1065167.1065201 · Cited by 129
Self-citationEfficient approximate and dynamic matching of patterns using a labeling paradigm
Sahinalp, C., & Vishkin, U. (2002) · doi:10.1109/sfcs.1996.548491 · Cited by 118
Signature-Based Methods for Data Streams
Cortes, C., & Pregibon, D. (2001) · Data Mining and Knowledge Discovery · doi:10.1023/a:1011464915332 · Cited by 113
Flow sampling under hard resource constraints
Duffield, N. G., Lund, C., & Thorup, M. (2004) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/1005686.1005699 · Cited by 110
What's new: Finding significant differences in network data streams
Cormode, G., & Muthukrishnan, S. (2004) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2004.1354567 · Cited by 89
Self-citationApproximate nearest neighbors and sequence comparison with block operations
Muthukrishnan, S., & Şahinalp, S. C. (2000) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/335305.335353 · Cited by 85
Self-citationThe string edit distance matching problem with moves
Cormode, G., & Muthukrishnan, S. (2002) · Symposium on Discrete Algorithms · doi:10.5555/545381.545470 · Cited by 85
Self-citationMining deviants in time series data streams
Muthukrishnan, S., Shah, R. R., & Vitter, J. S. (2004) · doi:10.1109/ssdbm.2004.51 · Cited by 52
Self-citationBetter algorithms for high-dimensional proximity problems via asymmetric embeddings
Indyk, P. (2003) · Cited by 47
Estimating Dominance Norms of Multiple Data Streams
Cormode, G., & Muthukrishnan, S. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39658-1_16 · Cited by 44
Self-citationGupta, A., & Zane, F. (2003) · doi:10.5555/644108.644150 · Cited by 42
Locating Hidden Groups in Communication Networks Using Hidden Markov Models
Magdon‐Ismail, M., Goldberg, M., Wallace, W. A., & Siebecker, D. (2003) · Lecture notes in computer science · doi:10.1007/3-540-44853-5_10 · Cited by 39
Clifford algebras and approximating the permanent
Chien, S., Rasmussen, L. E., & Sinclair, A. (2002) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/509907.509944 · Cited by 37
On the difficulty of scalably detecting network attacks
Levchenko, K., Paturi, R., & Varghese, G. (2004) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1030083.1030087 · Cited by 37
A one-pass sequential Monte Carlo method for Bayesian analysis of massive datasets
Balakrishnan, S., & Madigan, D. (2006) · Bayesian Analysis · doi:10.1214/06-ba112 · Cited by 37
Permutation Editing and Matching via Embeddings
Cormode, G., Muthukrishnan, S., & Şahinalp, S. C. (2001) · Lecture notes in computer science · doi:10.1007/3-540-48224-5_40 · Cited by 30
Self-citationExperimental Analysis of Privacy-Preserving Statistics Computation
Subramaniam, H., Wright, R. N., & Yang, Z. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30073-1_5 · Cited by 29
Deterministic sampling and range counting in geometric data streams
Bagchi, A., Chaudhary, A., Eppstein, D., & Goodrich, M. T. (2004) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/997817.997842 · Cited by 27
Range counting over multidimensional data streams
Suri, S., Tóth, C. D., & Zhou, Y. (2004) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/997817.997844 · Cited by 26
Cited by
Computational Methods for Sparse Solution of Linear Inverse Problems
Tropp, J. A., & Wright, S. J. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2044010 · Cited by 1,046
Signal Processing With Compressive Measurements
Davenport, M. A., Boufounos, P. T., Wakin, M. B., & Baraniuk, R. G. (2010) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2009.2039178 · Cited by 623
Beyond streams and graphs: dynamic tensor analysis
Sun, J., Tao, D., & Faloutsos, C. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150445 · Cited by 462
Dias de Assunção, M., da Silva Veith, A., & Buyya, R. (2018) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2017.12.001 · Cited by 304
Berthet-Rayne, P., Leibrandt, K., Gras, G., Fraisse, P., Crosnier, A., & Yang, G.-Z. (2018) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2018.2812907 · Cited by 58
Metadata
- Authors
- Muthukrishnan, S.
- Venue
- Foundations and Trends® in Theoretical Computer Science
- Publisher
- Emerald
- Published
- 2005
- Volume
- 1
- Issue
- 2
- Pages
- 117-236
- ISSN
- 1551-305X (ISSN-L)
- 1551-3068
- OpenAlex
- W1995484833
- Cited by
- 718
- References
- 100
- FWCI
- 32.89
- Type
- journal article
- 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.
