Skip to content

Commit

Permalink
more readme updates
Browse files Browse the repository at this point in the history
  • Loading branch information
drewverlee committed Jan 11, 2014
1 parent 8af6b0b commit 08557ff
Showing 1 changed file with 21 additions and 13 deletions.
34 changes: 21 additions & 13 deletions README.md
Expand Up @@ -6,17 +6,20 @@ at my University.
Using Twitter to find the happiest state
==============================================================================

+ Data_Science/
+ Introduction to Data science

+ Folder: Data_Science/
+ Check The ReadMe: For how To run the code and discover for yourself which state is happiest
+ Class: Introduction to Data science Through Coursera
+ Washington University
+ Class Certification: https://drive.google.com/file/d/0B1C_HgqJ_YTrQmYyakdrWXdvV1E/edit?usp=sharing
+ Check The ReadMe: For how To run the code and discover for yourself

Every wounder which state is the happiest? This code tries to find out. It
This code

+ Access the Twitter Programming Interface(API) using Python.
+ We estimate the public's perception (the sentiment) of a particular term or phrase.
+ analyzed the relationship between location and mood based on a sample of twitter data.
+ estimates the public's perception (the sentiment) of a particular term or phrase.
+ analyzes the relationship between location and mood based on a sample of twitter data.

* The sample size is MUCH to small in order to fit within githubs suggested file size.


Machine Learning
Expand All @@ -27,15 +30,18 @@ Machine Learning
+ Stanford University
+ No Certification yet - class in progress

Vectorized backpropagation which allowed for a better trained Neural Network.
This code is accomplishes Vectorized backpropagation, which allows for a
better trained Neural Network.

Dijstra's Algorithm
=============================================================================

+ dijkstra/
+ Algorithms: Design and Analysis, Part 1
+ Stanford University
+ Class Certification: https://drive.google.com/file/d/0B1C_HgqJ_YTrQmhHVWcxWnVJUTA/edit?usp=sharing

+ dijkstra/
+ Check the infile readme for how to create your own test cases.
+ Algorithms: Design and Analysis, Part 1
+ Stanford University
+ Class Certification: https://drive.google.com/file/d/0B1C_HgqJ_YTrQmhHVWcxWnVJUTA/edit?usp=sharing

I had learned this algorithm in an early class so i jumped on the
opportunity to code up a test_generator.py that produce test_files and
Expand All @@ -46,10 +52,11 @@ Take a look at the Readme in the file for more!
Linear Algebra ... with code??!?
==============================================================================


+ linear_algebra.py
+ I was class Promoted to class Teacher Assistant
+ Coding the Matrix: Linear Algebra through Computer Science
+ Brown University
+ I was class TA
+ Class Certification: https://drive.google.com/file/d/0B1C_HgqJ_YTrajRtZ1dzemkyVkE/edit?usp=sharing

Think back to linear Algebra... to painful? This file gives a sample of
Expand All @@ -61,12 +68,13 @@ Algorithm Analysis: DFS vs Source Removal
==========================================================================

+ topology/
+ Check infile readme for how to run the code
+ Algorithms Design and Analysis
+ Wayne State
+ Degree expected Dec, 2014

The code in directory explains which algorithm has the better running time
By using Pythongs Timeit module.For the final score check the Readme. I employed
By using Pythons Timeit module. For the final score check the Readme. I employed
some rather unorthodox data structures in both algorithms. For instance, my DFS and
source removal both benefit from a slight running time boost from using sets
to keep track of visited nodes.
Expand Down

0 comments on commit 08557ff

Please sign in to comment.