Sciweavers

1950 search results - page 255 / 390
» Informative sampling for large unbalanced data sets
Sort
View
132
Voted
CDES
2008
123views Hardware» more  CDES 2008»
15 years 5 months ago
R-tree: A Hardware Implementation
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
Xiang Xiao, Tuo Shi, Pranav Vaidya, Jaehwan John L...
128
Voted
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
16 years 4 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
132
Voted
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 4 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
129
Voted
VIS
2007
IEEE
192views Visualization» more  VIS 2007»
16 years 4 months ago
LiveSync: Deformed Viewing Spheres for Knowledge-Based Navigation
Although real-time interactive volume rendering is available even for very large data sets, this visualization method is used quite rarely in the clinical practice. We suspect this...
Peter Kohlmann, Stefan Bruckner, Armin Kanitsar,...
IACR
2011
87views more  IACR 2011»
14 years 3 months ago
Is privacy compatible with truthfulness?
In the area of privacy-preserving data mining, a differentially private mechanism intuitively encourages people to share their data truthfully because they are at little risk of ...
David Xiao