Abstract | ||
---|---|---|
We study the 1-center problem with outliers in high- dimensional data streams. The problem denition is as follows: given a sequence of n points in d dimensions (with d arbitrarily large), enclose all but z points using a ball of minimum radius. |
Year | Venue | Keywords |
---|---|---|
2009 | CCCG | high dimensional data |
Field | DocType | Citations |
Discrete mathematics,Combinatorics,Data stream mining,Computer science,Outlier,Arbitrarily large | Conference | 5 |
PageRank | References | Authors |
0.46 | 15 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Hamid Zarrabi-Zadeh | 1 | 111 | 13.63 |
Asish Mukhopadhyay | 2 | 153 | 28.91 |