| Projects on Google Code | Results 1 - 10 of 90 |
[Tutorial_ja Tutorial in Japanese]
[Tutorial_en Tutorial in English]
== Overview ==
*Bayon* is a simple and fast hard-clustering tool.
*Bayon* supports Repeated Bisection clustering and K-means clustering.
== Install ==
{{{
% ./configure
% make
% sudo make install
}}}
== Usage ...
This software package allows the user to perform various consensus clustering operations on any numerical data using PCA to select informative features.
===News===
*NEW* - The power of consensus clustering with the speed of the GPU: The first alpha of [http://code.google.com/p/cuda-consensus-c...
Barrio is a dependency analyzer for object-oriented programs implemented in Java. It discovers and visualizes community structures in the dependency graph which might represent opportunities to refactor the program into a more modular structure. For instance, a package containing two independent clu...
CCVisu is a tool for force-directed graph layout with special support for visual graph clustering. The tool is based on the simple input/output formats RSF, SVG, and VRML. It supports several energy models for different graph layout goals.
Clustering,
Graph,
Layout,
Force-directed,
Visualization,
Decomposition,
Extractor,
Utility,
RSF,
CVS,
Java,
Co-Change,
Software-graph
Harnessing the power of the GPU to mine numerical data
Project details and documentation coming soon. In the meantime, feel free to checkout the SVN and have a look around.
web search clustering using yahoo+lingpipe
HiveMaps was created to make it super simple to mashup thousands of data markers onto a Google Map and have everything just work.
The current usability limit is between 2-5k markers using the supplied version of MarkerClusterer and depending on the browser and other JavaScript activity on the p...
pspectralclustering is a parallel C++ implementation of Parallel Spectral Clustering. We are expecting to present a highly optimized parallel implemention of all the steps of spectral clustering. We use [http://www.caam.rice.edu/~kristyn/parpack_home.html PARPACK] as underlying eigenvalue decompos...
This project contains implementations of cluster editing algorithms with search trees of sizes O(3^k^), O(2.62^k^) and O(2^k^). It also contains a partial implementation of a cluster editing algorithm with search tree of size O(1.82^k^).
The O(2.62^k^)-, O(2^k^)-, and O(1.82^k^)-algorithms are de...
==Text Analysis==
The goal of this project is to provide a java implementation, with an easy to use API and full unit-test coverage, of some techniques to perform the following analysis:
* Text Language Detection
* Keywords and keyphrases extraction
* Text Classification
* Text Cluste...