舉報 
會員
Haskell Data Analysis Cookbook
最新章節：
Index
Step-by-steprecipesfilledwithpracticalcodesamplesandengagingexamplesdemonstrateHaskellinpractice,andthentheconceptsbehindthecode.ThisbookshowsfunctionaldevelopersandanalystshowtoleveragetheirexistingknowledgeofHaskellspecificallyforhigh-qualitydataanalysis.Agoodunderstandingofdatasetsandfunctionalprogrammingisassumed.
最新章節
- Index
- Exporting matrix values to a file
- Personalizing messages using a text template
- Creating a LaTeX table to display results
- Presenting results in an HTML web page
- Saving data to a MongoDB database
品牌：中圖公司
上架時間：2021-12-08 12:28:18
出版社：Packt Publishing
本書數字版權由中圖公司提供，并由其授權上海閱文信息技術有限公司制作發行
- Index 更新時間：2021-12-08 12:44:09
- Exporting matrix values to a file
- Personalizing messages using a text template
- Creating a LaTeX table to display results
- Presenting results in an HTML web page
- Saving data to a MongoDB database
- Using SQLite to store data
- Exporting data as JSON
- Exporting data to a CSV file
- Introduction
- Chapter 12. Exporting and Presenting
- Diagramming a path from a list of vectors
- Rendering a scatter plot in JavaScript using D3.js
- Rendering a bar graph in JavaScript using D3.js
- Customizing the looks of a graph network diagram
- Visualizing a graph network
- Interacting with points in a three-dimensional space
- Displaying a scatter plot of two-dimensional points
- Displaying a line graph using gnuplot
- Plotting bar graphs using Google's Chart API
- Plotting a pie chart using Google's Chart API
- Plotting a line chart using Google's Chart API
- Introduction
- Chapter 11. Visualizing Data
- Streaming camera frames for template matching
- Detecting faces and eyes through a camera stream
- Communicating in real time through sockets
- Detecting real-time file directory changes
- Polling a web server for latest updates
- Responding to IRC messages
- Reading IRC chat room messages
- Streaming Twitter for real-time sentiment analysis
- Introduction
- Chapter 10. Real-time Data
- Benchmarking runtime performance in the terminal
- Using the criterion package to measure performance
- Benchmarking runtime performance in Haskell
- Manipulating images in parallel using Repa
- Implementing MapReduce to count word frequencies
- Accessing tuple elements in parallel
- Mapping over a list in parallel
- Parallelizing pure functions using the Par monad
- Killing forked threads
- Communicating with a forked I/O action
- Forking I/O actions for concurrency
- Controlling parallel algorithms in sequence
- Evaluating a procedure in parallel
- Using the Haskell Runtime System options
- Introduction
- Chapter 9. Parallel and Concurrent Design
- Visualizing points using Graphics.EasyPlot
- Implementing a k-Nearest Neighbors classifier
- Implementing a decision tree classifier
- Training a parts-of-speech tagger
- Identifying key words in a corpus of text
- Classifying the parts of speech of words
- Clustering words by their lexemes
- Finding the number of clusters
- Using a hierarchical clustering library
- Implementing hierarchical clustering
- Implementing the k-means clustering algorithm
- Introduction
- Chapter 8. Clustering and Classification
- Creating a neural network perceptron
- Creating n-grams from a list
- Using a Markov chain to generate text
- Creating a data structure for playing cards
- Evaluating a Bayesian network
- Using the Pearson correlation coefficient
- Finding all unique pairings in a list
- Obtaining the covariance matrix from samples
- Approximating a quadratic regression
- Approximating a linear regression
- Calculating a moving median
- Calculating a moving average
- Introduction
- Chapter 7. Statistics and Analysis
- Determining whether any two graphs are isomorphic
- Finding maximal cliques in a graph
- Working with hexagonal and square grid networks
- Using Directed Acyclic Word Graphs
- Visualizing a graph using Graphviz
- Traversing a graph breadth-first
- Traversing a graph depth-first
- Conducting a topological sort on a graph
- Representing a graph from an adjacency list
- Representing a graph from a list of edges
- Introduction
- Chapter 6. Graph Fundamentals
- Decoding a Huffman code
- Encoding a string using a Huffman tree
- Implementing a min-heap data structure
- Using a self-balancing tree
- Verifying the order property of a binary search tree
- Implementing a binary search tree data structure
- Calculating the height of a tree
- Implementing a Foldable instance for a tree
- Traversing a tree breadth-first
- Traversing a tree depth-first
- Defining a rose tree (multiway tree) data type
- Defining a binary tree data type
- Introduction
- Chapter 5. The Dance with Trees
- Measuring image similarity with perceptual hashes
- Running MurmurHash a simple but speedy hashing algorithm
- Using a bloom filter to remove unique items
- Computing a Geohash for location coordinates
- Using Google's CityHash hash functions for strings
- Using a high-performance hash table
- Performing fast comparisons between data types
- Running a cryptographic checksum on a file
- Running popular cryptographic hash functions
- Hashing a custom data type
- Hashing a primitive data type
- Introduction
- Chapter 4. Data Hashing
- Fixing spelling mistakes
- Finding strings within one-edit distance
- Computing the Jaro-Winkler distance between two strings
- Computing the edit distance
- Computing a phonetic code
- Finding the longest common subsequence
- Splitting a string on lines words or arbitrary tokens
- Searching a string using the Rabin-Karp algorithm
- Searching a string using the Boyer-Moore-Horspool algorithm
- Searching for a substring using Data.ByteString
- Reading a number from another base
- Displaying a number in another base
- Introduction
- Chapter 3. The Science of Words
- Comparing sparse data using cosine similarity
- Comparing scaled data using the Pearson correlation coefficient
- Computing the Euclidean distance
- Computing the Manhattan distance
- Implementing a frequency table using Data.MultiSet
- Implementing a frequency table using Data.List
- Deduplication of conflicting data items
- Deduplication of nonconflicting data items
- Lexing and parsing an e-mail address
- Validating records by matching regular expressions
- Coping with unexpected or missing input
- Ignoring punctuation and specific characters
- Trimming excess whitespace
- Introduction
- Chapter 2. Integrity and Inspection
- Exploring data from a SQLite database
- Reading from a remote MongoDB server
- Using MongoDB queries in Haskell
- Traversing online directories for data
- Learning how to perform HTTP POST requests
- Understanding how to perform HTTP GET requests
- Capturing table rows from an HTML page
- Reading an XML file using the HXT package
- Examining a JSON file with the aeson package
- Keeping and representing data from a CSV file
- Catching I/O code faults
- Accumulating text data from a file path
- Harnessing data from various sources
- Introduction
- Chapter 1. The Hunt for Data
- Customer support
- Reader feedback
- Conventions
- Who this book is for
- What you need for this book
- What this book covers
- Preface
- Support files eBooks discount offers and more
- www.PacktPub.com
- About the Reviewers
- About the Author
- Credits
- 版權頁
- 封面
- 封面
- 版權頁
- Credits
- About the Author
- About the Reviewers
- www.PacktPub.com
- Support files eBooks discount offers and more
- Preface
- What this book covers
- What you need for this book
- Who this book is for
- Conventions
- Reader feedback
- Customer support
- Chapter 1. The Hunt for Data
- Introduction
- Harnessing data from various sources
- Accumulating text data from a file path
- Catching I/O code faults
- Keeping and representing data from a CSV file
- Examining a JSON file with the aeson package
- Reading an XML file using the HXT package
- Capturing table rows from an HTML page
- Understanding how to perform HTTP GET requests
- Learning how to perform HTTP POST requests
- Traversing online directories for data
- Using MongoDB queries in Haskell
- Reading from a remote MongoDB server
- Exploring data from a SQLite database
- Chapter 2. Integrity and Inspection
- Introduction
- Trimming excess whitespace
- Ignoring punctuation and specific characters
- Coping with unexpected or missing input
- Validating records by matching regular expressions
- Lexing and parsing an e-mail address
- Deduplication of nonconflicting data items
- Deduplication of conflicting data items
- Implementing a frequency table using Data.List
- Implementing a frequency table using Data.MultiSet
- Computing the Manhattan distance
- Computing the Euclidean distance
- Comparing scaled data using the Pearson correlation coefficient
- Comparing sparse data using cosine similarity
- Chapter 3. The Science of Words
- Introduction
- Displaying a number in another base
- Reading a number from another base
- Searching for a substring using Data.ByteString
- Searching a string using the Boyer-Moore-Horspool algorithm
- Searching a string using the Rabin-Karp algorithm
- Splitting a string on lines words or arbitrary tokens
- Finding the longest common subsequence
- Computing a phonetic code
- Computing the edit distance
- Computing the Jaro-Winkler distance between two strings
- Finding strings within one-edit distance
- Fixing spelling mistakes
- Chapter 4. Data Hashing
- Introduction
- Hashing a primitive data type
- Hashing a custom data type
- Running popular cryptographic hash functions
- Running a cryptographic checksum on a file
- Performing fast comparisons between data types
- Using a high-performance hash table
- Using Google's CityHash hash functions for strings
- Computing a Geohash for location coordinates
- Using a bloom filter to remove unique items
- Running MurmurHash a simple but speedy hashing algorithm
- Measuring image similarity with perceptual hashes
- Chapter 5. The Dance with Trees
- Introduction
- Defining a binary tree data type
- Defining a rose tree (multiway tree) data type
- Traversing a tree depth-first
- Traversing a tree breadth-first
- Implementing a Foldable instance for a tree
- Calculating the height of a tree
- Implementing a binary search tree data structure
- Verifying the order property of a binary search tree
- Using a self-balancing tree
- Implementing a min-heap data structure
- Encoding a string using a Huffman tree
- Decoding a Huffman code
- Chapter 6. Graph Fundamentals
- Introduction
- Representing a graph from a list of edges
- Representing a graph from an adjacency list
- Conducting a topological sort on a graph
- Traversing a graph depth-first
- Traversing a graph breadth-first
- Visualizing a graph using Graphviz
- Using Directed Acyclic Word Graphs
- Working with hexagonal and square grid networks
- Finding maximal cliques in a graph
- Determining whether any two graphs are isomorphic
- Chapter 7. Statistics and Analysis
- Introduction
- Calculating a moving average
- Calculating a moving median
- Approximating a linear regression
- Approximating a quadratic regression
- Obtaining the covariance matrix from samples
- Finding all unique pairings in a list
- Using the Pearson correlation coefficient
- Evaluating a Bayesian network
- Creating a data structure for playing cards
- Using a Markov chain to generate text
- Creating n-grams from a list
- Creating a neural network perceptron
- Chapter 8. Clustering and Classification
- Introduction
- Implementing the k-means clustering algorithm
- Implementing hierarchical clustering
- Using a hierarchical clustering library
- Finding the number of clusters
- Clustering words by their lexemes
- Classifying the parts of speech of words
- Identifying key words in a corpus of text
- Training a parts-of-speech tagger
- Implementing a decision tree classifier
- Implementing a k-Nearest Neighbors classifier
- Visualizing points using Graphics.EasyPlot
- Chapter 9. Parallel and Concurrent Design
- Introduction
- Using the Haskell Runtime System options
- Evaluating a procedure in parallel
- Controlling parallel algorithms in sequence
- Forking I/O actions for concurrency
- Communicating with a forked I/O action
- Killing forked threads
- Parallelizing pure functions using the Par monad
- Mapping over a list in parallel
- Accessing tuple elements in parallel
- Implementing MapReduce to count word frequencies
- Manipulating images in parallel using Repa
- Benchmarking runtime performance in Haskell
- Using the criterion package to measure performance
- Benchmarking runtime performance in the terminal
- Chapter 10. Real-time Data
- Introduction
- Streaming Twitter for real-time sentiment analysis
- Reading IRC chat room messages
- Responding to IRC messages
- Polling a web server for latest updates
- Detecting real-time file directory changes
- Communicating in real time through sockets
- Detecting faces and eyes through a camera stream
- Streaming camera frames for template matching
- Chapter 11. Visualizing Data
- Introduction
- Plotting a line chart using Google's Chart API
- Plotting a pie chart using Google's Chart API
- Plotting bar graphs using Google's Chart API
- Displaying a line graph using gnuplot
- Displaying a scatter plot of two-dimensional points
- Interacting with points in a three-dimensional space
- Visualizing a graph network
- Customizing the looks of a graph network diagram
- Rendering a bar graph in JavaScript using D3.js
- Rendering a scatter plot in JavaScript using D3.js
- Diagramming a path from a list of vectors
- Chapter 12. Exporting and Presenting
- Introduction
- Exporting data to a CSV file
- Exporting data as JSON
- Using SQLite to store data
- Saving data to a MongoDB database
- Presenting results in an HTML web page
- Creating a LaTeX table to display results
- Personalizing messages using a text template
- Exporting matrix values to a file
- Index 更新時間：2021-12-08 12:44:09
