<?xml version="1.0" encoding="UTF-8" ?>
<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xmlns:slims="http://slims.web.id" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3" id="21459">
 <titleInfo>
  <title>Foundations of Data Science</title>
 </titleInfo>
 <name type="Personal Name" authority="">
  <namePart>Avrim Blum , John Hopcroft , Ravindran Kannan</namePart>
  <role>
   <roleTerm type="text">Additional Author</roleTerm>
  </role>
 </name>
 <typeOfResource manuscript="no" collection="yes">mixed material</typeOfResource>
 <genre authority="marcgt">bibliography</genre>
 <originInfo>
  <place>
   <placeTerm type="text">Islamabad</placeTerm>
   <publisher>Al Hafiz Traders</publisher>
   <dateIssued>2020</dateIssued>
  </place>
 </originInfo>
 <language>
  <languageTerm type="code">en</languageTerm>
  <languageTerm type="text">English</languageTerm>
 </language>
 <physicalDescription>
  <form authority="gmd">Book</form>
  <extent>432</extent>
 </physicalDescription>
 <note>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</note>
 <note type="statement of responsibility">Avrim Blum , John Hopcroft , Ravindran Kannan</note>
 <subject authority="">
  <topic>Computer Science Data Science</topic>
 </subject>
 <subject authority="">
  <topic>1. Computer Science 2. Software Engineering 3. Dat</topic>
 </subject>
 <subject authority="">
  <topic>Data Science Information Technology</topic>
 </subject>
 <classification>006..312</classification>
 <identifier type="isbn">9781108485067</identifier>
 <location>
  <physicalLocation>NUML LIBRARY RAWALPINDI (National University of Modern Languages) NUML library is the state of art which equipped “RESEARCH FACILITATION CENTRE” with latest computers for readers to access the digital library of more than 23000 research journals and 130000 online books and E-Library of NUML-Rawalpindi.</physicalLocation>
  <shelfLocator>006..312</shelfLocator>
  <holdingSimple>
   <copyInformation>
    <numerationAndChronology type="1">14207</numerationAndChronology>
    <sublocation></sublocation>
    <shelfLocator></shelfLocator>
   </copyInformation>
  </holdingSimple>
 </location>
 <slims:image>14207.jpg.jpg</slims:image>
 <recordInfo>
  <recordIdentifier>21459</recordIdentifier>
  <recordCreationDate encoding="w3cdtf">2025-09-04 18:32:53</recordCreationDate>
  <recordChangeDate encoding="w3cdtf">2026-02-03 16:53:52</recordChangeDate>
  <recordOrigin>machine generated</recordOrigin>
 </recordInfo>
</mods>
</modsCollection>