search for: kleinberg

Has anyone here implemented Jon Kleinberg's burst detection algorithm ("Bursty and Hierarchical Structure in Streams" http://www.cs.cornell.edu/home/kleinber/bhs.pdf)? I'd rather not reimplement if there's already running code available.... Thanks, -s [[alternative HTML version deleted]]

igraph is a package for graphs and networks. It has a C core and uses a simple and fast graph representation allowing millions of vertices and edges. NEW FEATURES: - We use the ARPACK library for graph related eigenvalue problems, like Page Rank calculation, Kleinberg's hub and authority scores, eigenvector centrality, etc. There is also a generic interface if someone wants to use ARPACK for a different (not necessarily graph-related) problem. - We support the BLISS graph isomorphism algorithm, and the implementation of the VF2 algorithm can calc...

igraph is a package for graphs and networks. It has a C core and uses a simple and fast graph representation allowing millions of vertices and edges. NEW FEATURES: - We use the ARPACK library for graph related eigenvalue problems, like Page Rank calculation, Kleinberg's hub and authority scores, eigenvector centrality, etc. There is also a generic interface if someone wants to use ARPACK for a different (not necessarily graph-related) problem. - We support the BLISS graph isomorphism algorithm, and the implementation of the VF2 algorithm can calc...