Sciweavers

1224 search results - page 218 / 245
» Concept Search
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 10 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
GIS
2007
ACM
14 years 11 months ago
Partition-based lazy updates for continuous queries over moving objects
Continuous spatial queries posted within an environment of moving objects produce as their results a time-varying set of objects. In the most ambitious case both queries and data ...
Yu-Ling Hsueh, Roger Zimmermann, Haojun Wang, Wei-...
SIGMOD
2007
ACM
161views Database» more  SIGMOD 2007»
14 years 10 months ago
Homeviews: peer-to-peer middleware for personal data sharing applications
This paper presents HomeViews, a peer-to-peer middleware system for building personal data management applications. HomeViews provides abstractions and services for data organizat...
Roxana Geambasu, Magdalena Balazinska, Steven D. G...
EDBT
2008
ACM
111views Database» more  EDBT 2008»
14 years 10 months ago
Micro-aggregation-based heuristics for p-sensitive k-anonymity: one step beyond
Micro-data protection is a hot topic in the field of Statistical Disclosure Control (SDC), that has gained special interest after the disclosure of 658000 queries by the AOL searc...
Agusti Solanas, Francesc Sebé, Josep Doming...
WWW
2010
ACM
14 years 5 months ago
Generalized distances between rankings
Spearman’s footrule and Kendall’s tau are two well established distances between rankings. They, however, fail to take into account concepts crucial to evaluating a result set...
Ravi Kumar, Sergei Vassilvitskii