The DOI matches its Crossref record; 142 of the 142 references it cites were found in a registry or an index.
Foundations of Data Science
Abstract
This book provides an introduction to the mathematical and algorithmic foundations of data science, including machine learning, high-dimensional geometry, and analysis of large networks. Topics include the counterintuitive nature of data in high dimensions, important linear algebraic techniques such as singular value decomposition, the theory of random walks and Markov chains, the fundamentals of and important algorithms for machine learning, algorithms and analysis for clustering, probabilistic models for large networks, representation learning including topic modelling and non-negative matrix factorization, wavelets and compressed sensing. Important probabilistic techniques are developed including the law of large numbers, tail inequalities, analysis of random projections, generalization guarantees in machine learning, and moment methods for analysis of phase transitions in large random graphs. Additionally, important structural and complexity measures are discussed such as matrix norms and VC-dimension. This book is suitable for both undergraduate and graduate courses in the design and analysis of algorithms for data.
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
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Hierarchical Grouping to Optimize an Objective Function
Ward, J. H. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500845 · Cited by 20,598
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
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
A training algorithm for optimal margin classifiers
Boser, B. E., Guyon, I. M., & Vapnik, V. N. (1992) · Proceedings of the fifth annual workshop on Computational learning theory · doi:10.1145/130385.130401 · Cited by 11,992
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
Data clustering: 50 years beyond K-means
Jain, A. K. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2009.09.011 · Cited by 9,368
Learning Deep Architectures for AI
Bengio, Y. (2009) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000006 · Cited by 9,239
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Pattern Recognition and Machine Learning
(2007) · Kybernetes · doi:10.1108/03684920710743466 · Cited by 8,265
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
Robust principal component analysis?
Candès, E. J., Li, X., Ma, Y., & Wright, J. (2011) · Journal of the ACM · doi:10.1145/1970392.1970395 · Cited by 6,921
Whittaker, E. T., & Watson, G. N. (2021) · Cambridge University Press eBooks · doi:10.1017/9781009004091 · Cited by 6,850
Clustering by Passing Messages Between Data Points
Frey, B. J., & Dueck, D. (2007) · Science · doi:10.1126/science.1136800 · Cited by 6,758
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486
The wavelet transform, time-frequency localization and signal analysis
Daubechies, I. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.57199 · Cited by 6,483
The Evolution of Random Graphs
(1986) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/062/06 · Cited by 5,543
Blei, D. M. (2012) · Communications of the ACM · doi:10.1145/2133806.2133826 · Cited by 5,516
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
The Strength of Weak Learnability
Schapire, R. E. (1990) · Machine Learning · doi:10.1007/bf00116037 · Cited by 4,600
Semi-Supervised Learning Literature Survey
Zhu, X. (2005) · Minds at UW (University of Wisconsin) · Cited by 4,506
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
Strang, G., & Nguyen, T. Q. (1996) · Cited by 4,180
Perceptrons: An Introduction to Computational Geometry
Minsky, M., & Papert, S. A. (1969) · Cited by 3,720
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Semi-supervised learning using Gaussian fields and harmonic functions
Zhu, X., Zoubin Ghahramani, A., & Lafferty, J. (2003) · Cited by 3,509
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
Manipulation of Voting Schemes: A General Result
Gibbard, A. (1973) · Econometrica · doi:10.2307/1914083 · Cited by 3,202
The Symmetric Eigenvalue Problem
Parlett, B. N. (1998) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971163 · Cited by 3,192
Understanding Machine Learning: From Theory to Algorithms
Shalev-Shwartz, S., & Ben-David, S. (2014) · doi:10.1017/cbo9781107298019 · Cited by 3,115
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (2015) · Measures of Complexity · doi:10.1007/978-3-319-21852-6_3 · Cited by 3,105
Approximation Algorithms for NP-Hard Problems
(1997) · ACM SIGACT News · doi:10.1145/261342.571216 · Cited by 3,103
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
Donoho, D. L., & Elad, M. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0437847100 · Cited by 2,898
Satterthwaite, M. A. (1975) · Journal of Economic Theory · doi:10.1016/0022-0531(75)90050-2 · Cited by 2,821
Transductive Inference for Text Classification using Support Vector Machines
Joachims, T. (1999) · Cited by 2,723
Monte Carlo Strategies in Scientific Computing
Liu, J. S. (2004) · Springer Series in Statistics · doi:10.1007/978-0-387-76371-2 · Cited by 2,690
Bollobás, B. (2001) · doi:10.1017/cbo9780511814068 · Cited by 2,639
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (1971) · Theory of Probability & Its Applications · doi:10.1137/1116025 · Cited by 2,448
Concrete Mathematics: A Foundation for Computer Science
Graham, R. L., Knuth, D. E., Patashnik, O., & Liu, S. (1989) · Computers in Physics · doi:10.1063/1.4822863 · Cited by 2,407
A critical point for random graphs with a given degree sequence
Molloy, M., & Reed, B. (1995) · Random Structures & Algorithms · doi:10.1002/rsa.3240060204 · Cited by 2,351
Łuczak, T., Janson, S., & Ruciński, A. (2000) · Cited by 2,192
A Difficulty in the Concept of Social Welfare
Arrow, K. J. (1950) · Journal of Political Economy · doi:10.1086/256963 · Cited by 2,079
The Weighted Majority Algorithm
Littlestone, N., & Warmuth, M. K. (1994) · Information and Computation · doi:10.1006/inco.1994.1009 · Cited by 1,975
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
Bartlett, P. L., & Mendelson, S. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44581-1_15 · Cited by 1,949
The small-world phenomenon: an algorithmic perspective
Kleinberg, J. (2000) · Proceedings of the thirty-second annual ACM symposium on Theory of computing · doi:10.1145/335305.335325 · Cited by 1,882
Learnability and the Vapnik-Chervonenkis dimension
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1989) · Journal of the ACM · doi:10.1145/76359.76371 · Cited by 1,839
Probability and computing: randomized algorithms and probabilistic analysis
Mitzenmacher, M., & Upfal, E. (2005) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,824
Introduction to Wavelets and Wavelet Transforms: A Primer
Burrus, C. S., Gopinath, R. A., Guo, H., Odegard, J. E., & Selesnick, I. (1997) · Cited by 1,794
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Mitzenmacher, M., & Upfal, E. (2005) · Cambridge University Press eBooks · doi:10.1017/cbo9780511813603 · Cited by 1,733
Clustering to minimize the maximum intercluster distance
Gonzalez, T. F. (1985) · Theoretical Computer Science · doi:10.1016/0304-3975(85)90224-5 · Cited by 1,717
An Introduction to Computational Learning Theory
Kearns, M. J., & Vazirani, U. (1994) · doi:10.7551/mitpress/3897.001.0001 · Cited by 1,697
Athreya, K. B., & Ney, P. E. (1972) · Springer eBooks · doi:10.1007/978-3-642-65371-1 · Cited by 1,665
Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.850085 · Cited by 1,617
Understanding belief propagation and its generalizations
Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2003) · Cited by 1,594
Monte Carlo Strategies in Scientific Computing
Hesterberg, T. (2002) · Technometrics · doi:10.1198/tech.2002.s85 · Cited by 1,409
Online Learning for Latent Dirichlet Allocation
Hoffman, M. D., Blei, D. M., & Bach, F. (2010) · Cited by 1,363
Syntactic clustering of the Web
Broder, A. Z., Glassman, S. C., Manasse, M. S., & Zweig, G. (1997) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(97)00031-7 · Cited by 1,343
Probabilistic counting algorithms for data base applications
Flajolet, P., & Nigel Martin, G. (1985) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(85)90041-8 · Cited by 1,269
Alon, N. (1986) · Combinatorica · doi:10.1007/bf02579166 · Cited by 1,137
Analytic and Algorithmic Solution of Random Satisfiability Problems
Mézard, M., Parisi, G., & Zecchina, R. (2002) · Science · doi:10.1126/science.1073287 · Cited by 1,071
Random Walks and Electric Networks
Doyle, P., & Snell, J. (1984) · Carus Mathematical Monographs · doi:10.5948/upo9781614440222 · Cited by 1,061
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1987) · Information Processing Letters · doi:10.1016/0020-0190(87)90114-1 · Cited by 1,054
The Evolution of Random Graphs
Bollobas, B. (1984) · Transactions of the American Mathematical Society · doi:10.2307/1999405 · Cited by 1,023
An Introduction to Probability Theory and its Applications
Grubbs, F. E. (1967) · Technometrics · doi:10.1080/00401706.1967.10490472 · Cited by 1,017
Reversible Markov Chains and Random Walks on Graphs
Aldous, D., & Fill, J. A. (2014) · Cited by 973
Approximate Frequency Counts over Data Streams
Manku, G. S., & Motwani, R. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50038-x · Cited by 941
Proceedings of the 27th International Conference on Very Large Data Bases
Apers, P. M. G., Atzeni, P., Ceri, S., Paraboschi, S., Ramamohanarao, K., & Snodgrass, R. T. (2001) · Cited by 845
On clusterings: Good, bad and spectral
Kannan, R., Vempala, S., & Vetta, A. (2004) · Journal of the ACM · doi:10.1145/990308.990313 · Cited by 834
Self-citationA survey of kernel and spectral methods for clustering
Filippone, M., Camastra, F., Masulli, F., & Rovetta, S. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2007.05.018 · Cited by 827
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Spielman, D. A., & Teng, S.-H. (2004) · Journal of the ACM · doi:10.1145/990308.990310 · Cited by 825
Estimation of Dependences Based on Empirical Data.
Shoesmith, E., Vapnik, V., & Kotz, S. (1984) · The Statistician · doi:10.2307/2988246 · Cited by 764
Approximate counting, uniform generation and rapidly mixing Markov chains
Sinclair, A., & Jerrum, M. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90067-9 · Cited by 735
AN INTRODUCTION TO HIDDEN MARKOV MODELS AND BAYESIAN NETWORKS
GHAHRAMANI, Z. (2001) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001401000836 · Cited by 700
A random polynomial-time algorithm for approximating the volume of convex bodies
Dyer, M., Frieze, A., & Kannan, R. (1991) · Journal of the ACM · doi:10.1145/102782.102783 · Cited by 693
Self-citationWhen Does Non-Negative Matrix Factorization Give a Correct Decomposition into Parts?
Donoho, D. L., & Stodden, V. (2004) · doi:10.7916/d88d05n7 · Cited by 685
Sharp thresholds of graph properties, and the $k$-sat problem
Friedgut, E., & Jean Bourgain, A. B. (1999) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-99-00305-7 · Cited by 678
(2015) · Chapman & Hall/CRC eBooks · doi:10.1201/b19706 · Cited by 643
Cesa-Bianchi, N., Freund, Y., Haussler, D., Helmbold, D. P., Schapire, R. E., & Warmuth, M. K. (1997) · Journal of the ACM · doi:10.1145/258128.258179 · Cited by 634
Proceedings of the 24th International Conference on World Wide Web - WWW '15
(2015) · doi:10.1145/2736277 · Cited by 631
Spectral partitioning of random graphs
McSherry, F. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959929 · Cited by 584
On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
Weiss, Y., & Freeman, W. T. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910585 · Cited by 581
Frieze, A., & Karoński, M. (2015) · doi:10.1017/cbo9781316339831 · Cited by 576
Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
Drineas, P., Kannan, R., & Mahoney, M. W. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539704442696 · Cited by 552
Self-citation(2002) · Cited by 542
Vempala, S. (2005) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/065 · Cited by 538
Structural risk minimization over data-dependent hierarchies
Shawe-Taylor, J., Bartlett, P. L., Williamson, R. C., & Anthony, M. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.705570 · Cited by 527
Thrun, S., & Mitchell, T. M. (1995) · Robotics and Autonomous Systems · doi:10.1016/0921-8890(95)00004-y · Cited by 509
Misra, J., & Gries, D. (1982) · Science of Computer Programming · doi:10.1016/0167-6423(82)90012-0 · Cited by 507
Quick Approximation to Matrices and Applications
Frieze, A., & Kannan, R. (1999) · Combinatorica · doi:10.1007/s004930050052 · Cited by 502
Self-citationFast monte-carlo algorithms for finding low-rank approximations
Frieze, A., Kannan, R., & Vempala, S. (2004) · Journal of the ACM · doi:10.1145/1039488.1039494 · Cited by 500
Self-citationFast 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
Self-citationAre randomly grown graphs really random?
Callaway, D. S., Hopcroft, J. E., Kleinberg, J. M., Newman, M. E. J., & Strogatz, S. H. (2001) · Physical Review E · doi:10.1103/physreve.64.041902 · Cited by 448
Self-citationSurvey propagation: An algorithm for satisfiability
Braunstein, A., Mézard, M., & Zecchina, R. (2005) · Random Structures & Algorithms · doi:10.1002/rsa.20057 · Cited by 433
25th Annual Symposium on Foundations of Computer Science
(1986) · IEEE Computer Graphics and Applications · doi:10.1109/mcg.1986.276611 · Cited by 433
Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Miller, G. L. (1996) · Cited by 401
The Perceptron: A Model for Brain Functioning. I
Block, H. D. (1962) · Reviews of Modern Physics · doi:10.1103/revmodphys.34.123 · Cited by 396
generatingfunctionology: Third Edition
Wilf, H. S. (2005) · A K Peters/CRC Press eBooks · doi:10.1201/b10576 · Cited by 390
The birth of the giant component
Janson, S., Knuth, D. E., Łuczak, T., & Pittel, B. (1993) · Random Structures & Algorithms · doi:10.1002/rsa.3240040303 · Cited by 389
Advanced mean field methods: theory and practice
Opper, M., & Saad, D. (2001) · Cited by 385
Settling the Polynomial Learnability of Mixtures of Gaussians
Moitra, A., & Valiant, G. (2010) · 2010 IEEE 51st Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.15 · Cited by 252
Dasgupta, S. (2011) · Theoretical Computer Science · doi:10.1016/j.tcs.2010.12.054 · Cited by 247
Sur la liaison et la division des points d'un ensemble fini
Florek, K., Łukaszewicz, J., Perkal, J., Steinhaus, H., & Zubrzycki, S. (1951) · Colloquium Mathematicum · doi:10.4064/cm-2-3-4-282-285 · Cited by 245
On Spectral Learning of Mixtures of Distributions
Achlioptas, D., & McSherry, F. (2005) · Lecture notes in computer science · doi:10.1007/11503415_31 · Cited by 237
Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
Bayati, M., Shah, D., & Sharma, M. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.915695 · Cited by 224
Probably approximately correct: nature's algorithms for learning and prospering in a complex world
(2014) · Choice Reviews Online · doi:10.5860/choice.51-2716 · Cited by 222
Mick gets some (the odds are on his side) (satisfiability)
Chvatal, V., & Reed, B. (1992) · Proceedings., 33rd Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1992.267789 · Cited by 215
The transitive closure of a random digraph
Karp, R. M. (1990) · Random Structures & Algorithms · doi:10.1002/rsa.3240010106 · Cited by 215
Computational Transition at the Uniqueness Threshold
Sly, A. (2010) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.34 · Cited by 215
A Newton-like method for solving rank constrained linear matrix inequalities
Orsi, R., Helmke, U., & Moore, J. B. (2006) · Automatica · doi:10.1016/j.automatica.2006.05.026 · Cited by 194
Chapter 2 Satisfiability Solvers
(2008) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(07)03002-7 · Cited by 176
Balcan, M.-F., Beygelzimer, A., & Langford, J. (2009) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2008.07.003 · Cited by 169
From External to Internal Regret
Blum, A. L., & Monsour, Y. (2018) · Figshare · doi:10.1184/r1/6605876 · Cited by 163
Self-citationA discriminative framework for clustering via similarity functions
Balcan, M.-F., Blum, A., & Vempala, S. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374474 · Cited by 161
Self-citationA spectral algorithm for learning mixtures of distributions
Vempala, S., & Wang, G. J. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2002.1181888 · Cited by 144
What can you do with a Web in your Pocket
Brin, S., Motwani, R., Page, L. M., & Winograd, T. A. (1998) · Cited by 140
A Probabilistic Analysis of EM for Mixtures of Separated, Spherical Gaussians
Dasgupta, S., & Schulman, L. J. (2007) · CaltechAUTHORS (California Institute of Technology) · doi:10.5555/1248659.1248666 · Cited by 134
A discriminative model for semi-supervised learning
Balcan, M.-F., & Blum, A. L. (2010) · Journal of the ACM · doi:10.1145/1706591.1706599 · Cited by 119
Self-citationHidden community detection in social networks
He, K., Li, Y., Soundarajan, S., & Hopcroft, J. E. (2017) · Information Sciences · doi:10.1016/j.ins.2017.10.019 · Cited by 112
Self-citationThe phase transition in random graphs: A simple proof
Krivelevich, M., & Sudakov, B. (2012) · Random Structures and Algorithms · doi:10.1002/rsa.20470 · Cited by 111
Uncovering the Small Community Structure in Large Networks: A Local Spectral Approach
Li, Y., He, K., Bindel, D., & Hopcroft, J. E. (2015) · International World Wide Web Conference (WWW) · doi:10.1145/2736277.2741676 · Cited by 111
Self-citationLearning Mixtures of Product Distributions using Correlations and Independence
Chaudhuri, K., & Rao, S. B. (n.d.) · Cited by 103
Explanation-Based Neural Network Learning
Thrun, S. (1996) · Kluwer international series in engineering and computer science · doi:10.1007/978-1-4613-1381-6 · Cited by 103
Clustering under approximation stability
Balcan, M.-F., Blum, A. L., & Gupta, A. (2013) · Journal of the ACM · doi:10.1145/2450142.2450144 · Cited by 103
Self-citationRobust Hierarchical ClusteringPreprint
Balcan, M.-F., Liang, Y., & Gupta, P. (2014) · arXiv (Cornell University) · doi:10.1184/r1/6476297 · Cited by 100
Learning mixtures of separated nonspherical Gaussians
Arora, S., & Kannan, R. (2005) · The Annals of Applied Probability · doi:10.1214/105051604000000512 · Cited by 94
Self-citationDeep Manifold Traversal: Changing Labels with Convolutional FeaturesPreprint
Gardner, J. R., Upchurch, P., Kusner, M. J., Li, Y., Weinberger, K. Q., Bala, K., & Hopcroft, J. E. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1511.06421 · Cited by 84
Self-citationLocal Computation of PageRank Contributions
Andersen, R., Borgs, C., Chayes, J., Hopcroft, J. E., Mirrokni, V., & Teng, S. (2008) · Internet Mathematics · doi:10.1080/15427951.2008.10129302 · Cited by 83
Self-citationDetecting Overlapping Communities from Local Spectral Subspaces
He, K., Sun, Y., Bindel, D., Hopcroft, J. E., & Li, Y. (2015) · Proceedings · doi:10.1109/icdm.2015.89 · Cited by 79
Self-citationFrom External to Internal Regret
BlumAvrim, & MansourYishay (2007) · Journal of Machine Learning Research · doi:10.5555/1314498.1314543 · Cited by 75
Mathematical Foundations of the Markov Chain Monte Carlo Method
Jerrum, M. (1998) · Algorithms and combinatorics · doi:10.1007/978-3-662-12788-9_4 · Cited by 62
Balyo, T., Biere, A., Iser, D.-I. M., & Sinz, C. (2016) · Artificial Intelligence · doi:10.1016/j.artint.2016.08.007 · Cited by 60
A provable SVD-based algorithm for learning topics in dominant admixture corpusPreprint
Bansal, T., Bhattacharyya, C., & Kannan, R. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1410.6991 · Cited by 45
Self-citationActive Learning - Modern Learning Theory
Balcan, M.-F., & Urner, R. (2014) · Springer eBooks · doi:10.1007/978-3-642-27848-8_769-2 · Cited by 23
A New Probability Inequality Using Typical Moments and Concentration Results
Kannan, R. (2009) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2009.20 · Cited by 21
Self-citationValiant, L. G. (2026) · Foundations of Computation and Machine Learning · doi:10.1145/3749740.3749746
Cited by
Asymmetric Transitivity Preserving Graph Embedding
Ou, M., Cui, P., Pei, J., Zhang, Z., & Zhu, W. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939751 · Cited by 1,248
COVID-19 Vaccine–Related Discussion on Twitter: Topic Modeling and Sentiment Analysis
Lyu, J. C., Han, E. L., & Luli, G. K. (2021) · Journal of Medical Internet Research · doi:10.2196/24435 · Cited by 337
Binder 2.0 - Reproducible, interactive, sharable environments for science at scale
Jupyter, P., Bussonnier, M., Forde, J., Freeman, J., Granger, B., Head, T., Holdgraf, C., Kelley, K., Nalvarte, G., Osheroff, A., et al. (2018) · Proceedings of the Python in Science Conference · doi:10.25080/majora-4af1f417-011 · Cited by 302
Revisiting User Mobility and Social Relationships in LBSNs: A Hypergraph Embedding Approach
Yang, D., Qu, B., Yang, J., & Cudre-Mauroux, P. (2019) · The World Wide Web Conference · doi:10.1145/3308558.3313635 · Cited by 299
Organizing memories for generalization in complementary learning systems
Sun, W., Advani, M., Spruston, N., Saxe, A., & Fitzgerald, J. E. (2023) · Nature Neuroscience · doi:10.1038/s41593-023-01382-9 · Cited by 103
Metadata
- Authors
- Blum, A., Hopcroft, J., & Kannan, R.
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 2020-01-17
- OpenAlex
- W2304387544
- Cited by
- 304
- References
- 142
- FWCI
- 18.04
- Type
- book
- 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.