Phil 5.3.17

7:00 – 8:00 Research

8:30 – 6:30 BRC

  • Workshop on deep learning
  • I think I’ll have the time to work with network graphs based on the temporal coherence work using the libraries mentioned in this post
    • Looking through graph-tool‘s documentation
    • First, add all the vertices, which are all the clusters and all the agents:
      v1 = g.add_vertex()

      Then, connect each agent to its clusters:

      e = g.add_edge(v1, v2)

      Then draw:

      graph_draw(g, vertex_text=g.vertex_index,output_size=(200, 200), output="two-nodes.png")

      After that, there seem to be all kinds of analytics

    • Aaron didn’t got to the conference, so we worked on rolling in all the chnges. The reducers work fantastically well, though there is a pile of testing that needs to be done.
    • And I learned that to get a row out of n numpy matrix, you do mat[row], rather than mat[row:]
    • Pretty pictures for the isomap run

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.