Sciweavers

627 search results - page 22 / 126
» Privacy-Preserving k-NN for Small and Large Data Sets
Sort
View
VLDB
2008
ACM
147views Database» more  VLDB 2008»
15 years 11 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
ICCS
2004
Springer
15 years 4 months ago
Chunking-Coordinated-Synthetic Approaches to Large-Scale Kernel Machines
We consider a kernel-based approach to nonlinear classification that coordinates the generation of “synthetic” points (to be used in the kernel) with “chunking” (working wi...
Francisco J. González-Castaño, Rober...
CORR
2011
Springer
185views Education» more  CORR 2011»
14 years 6 months ago
Large-Scale Collective Entity Matching
There have been several recent advancements in Machine Learning community on the Entity Matching (EM) problem. However, their lack of scalability has prevented them from being app...
Vibhor Rastogi, Nilesh N. Dalvi, Minos N. Garofala...
60
Voted
APVIS
2009
15 years 11 days ago
Point-based tree representation: A new approach for large hierarchies
Space-filling layout techniques for tree representations are frequently used when the available screen space is small or the data set is large. In this paper, we propose a new app...
Hans-Jörg Schulz, Steffen Hadlak, Heidrun Sch...
TVCG
2011
132views more  TVCG 2011»
14 years 6 months ago
Point-Based Visualization for Large Hierarchies
—Space-filling layout techniques for tree representations are frequently used when the available screen space is small or the data set is large. In this paper, we propose an ef...
Hans-Jörg Schulz, Steffen Hadlak, Heidrun Sch...