BICO 1.1

- Main Page
- Related Pages
- Namespaces
- Classes
- Files

All Classes Namespaces Files Functions Variables Typedefs Pages
BICO Documentation

BICO [1] is a data stream algorithm for the k-means problem that combines the data structure of the SIGMOD Test of Time award winning algorithm BIRCH [2] with the theoretical concept of coresets for clustering problems. It is implemented within the clustering library CluE. This documentation belongs to an extract from CluE with all files necessary to compile and run BICO. The algorithm itself is implemented in Bico / bico.h.

- If you are interested in using BICO have a look at the example
- If you are interested in understanding BICO have a look at the BICO website and [1]

## References

1. Hendrik Fichtenberger, Marc Gillé, Melanie Schmidt, Chris Schwiegelshohn, Christian Sohler: BICO: BIRCH Meets Coresets for k-Means Clustering. ESA 2013: 481-492
2. Tian Zhang, Raghu Ramakrishnan, Miron Livny: BIRCH: A New Data Clustering Algorithm and Its Applications. Data Min. Knowl. Discov. 1(2): 141-182 (1997)