#### Filter Results:

- Full text PDF available (43)

#### Publication Year

2000

2017

- This year (5)
- Last 5 years (21)
- Last 10 years (45)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Margareta Ackerman, Shai Ben-David
- AISTATS
- 2009

We investigate measures of the clusterability of data sets. Namely, ways to define how â€˜strongâ€™ or â€˜conclusiveâ€™ is the clustering structure of a given data set. We address this issue with generality,â€¦ (More)

- Shai Ben-David, Margareta Ackerman
- NIPS
- 2008

Aiming towards the development of a general clustering theory, we discuss abstract axiomatization for clustering. In this respect, we follow up on the work of Kleinberg, ([1]) that showed anâ€¦ (More)

- Margareta Ackerman, Sanjoy Dasgupta
- NIPS
- 2014

The explosion in the amount of data available for analysis often necessitates a transition from batch to incremental clustering methods, which process one element at a time and typically store only aâ€¦ (More)

- Margareta Ackerman, Shai Ben-David, David Loker
- COLT
- 2010

Clustering is a central unsupervised learning task with a wide variety of applications. Not surprisingly, there exist many clustering algorithms. However, unlike classification tasks, in clustering,â€¦ (More)

- Margareta Ackerman, Shai Ben-David, David Loker
- NIPS
- 2010

Clustering is a basic data mining task with a wide variety of applications. Not surprisingly, there exist many clustering algorithms. However, clustering is an ill defined problem given a data set,â€¦ (More)

In this paper we investigate clustering in the weighted setting, in which every data point is assigned a real valued weight. We conduct a theoretical analysis on the influence of weighted data onâ€¦ (More)

- Margareta Ackerman, Shai Ben-David, David Loker, Sivan Sabato
- AISTATS
- 2013

We investigate the extent to which clustering algorithms are robust to the addition of a small, potentially adversarial, set of points. Our analysis reveals radical differences in the robustness ofâ€¦ (More)

We investigate measures of the clusterability of data sets. Namely, ways to define how â€˜strongâ€™ or â€˜conclusiveâ€™ is the clustering structure of a given data set. We address this issue with generality,â€¦ (More)

One important challenge of current search engines is to satisfy the users' needs when they provide a poorly formulated query. When the pages matching the user's original keywords are judged to beâ€¦ (More)

- Margareta Ackerman, Shai Ben-David
- IJCAI
- 2011

Selecting a clustering algorithm is a perplexing task. Yet since different algorithms may yield dramatically different outputs on the same data, the choice of algorithm is crucial. When selecting aâ€¦ (More)