Archive

Archive for January, 2012

Sketch-based Approach for Graphs

We discussed these two papers about sketch-based approach today:

This key of sketch-based approach is finding the landmarks by random sampling for every node in a graph. Some comments:

  • The assumption for sketch-based approach is the nodes are uniformly selected. This assumption is only suitable for random graphs. For scale-free graphs, nodes have distinct priority, so the uniform sampling technique may be not the case;
  • Making whatever incremental computation based on sketch-based approach seems an explored research topic;
  • The combination of sketch-based approach and random walk may generate some very fast algorithms for PageRank/SimRank on large graphs.
Advertisements
Categories: Graph Data Management Tags:

Mass Data Storage

Categories: Structured Storage

How to Set Up Twitter4J Quickly in Your Java Project

1. Go to http://twitter4j.org/en/index.html and download the most recently stable version.

2. Add twitter4j-core-2.2.5.jar into project for general use. If you want to use streaming API, add twitter4j-stream-2.2.5.jar into your project.

3. Copy Twitter API property file into your project/bin directory.

4. Test your code example:

public static void main(String[] args) throws Exception {

        Twitter twitter = new TwitterFactory().getInstance();
        int hits = twitter.getRateLimitStatus().getRemainingHits();
        System.out.println(hits);
        Status status = twitter.updateStatus("Really weird!");
        System.out.println("Successfully updated the status to ["
                + status.getText() + "].");

}

Categories: Social Web Tags: