| | |
| | |
Stat |
Members: 3645 Articles: 2'501'711 Articles rated: 2609
19 April 2024 |
|
| | | |
|
Article overview
| |
|
Online Correlation Clustering | Claire Mathieu
; Ocan Sankur
; Warren Schudy
; | Date: |
6 Jan 2010 | Abstract: | We study the online clustering problem where data items arrive in an online
fashion. The algorithm maintains a clustering of data items into similarity
classes. Upon arrival of v, the relation between v and previously arrived items
is revealed, so that for each u we are told whether v is similar to u. The
algorithm can create a new cluster for v and merge existing clusters.
When the objective is to minimize disagreements between the clustering and
the input, we prove that a natural greedy algorithm is O(n)-competitive, and
this is optimal.
When the objective is to maximize agreements between the clustering and the
input, we prove that the greedy algorithm is .5-competitive; that no online
algorithm can be better than .834-competitive; we prove that it is possible to
get better than 1/2, by exhibiting a randomized algorithm with competitive
ratio .5+c for a small positive fixed constant c. | Source: | arXiv, 1001.0920 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |