Sciweavers

390 search results - page 66 / 78
» Virtual Attribute Subsetting
Sort
View
ICDE
2006
IEEE
135views Database» more  ICDE 2006»
14 years 11 months ago
Reverse Nearest Neighbors Search in Ad-hoc Subspaces
Given an object q, modeled by a multidimensional point, a reverse nearest neighbors (RNN) query returns the set of objects in the database that have q as their nearest neighbor. I...
Man Lung Yiu, Nikos Mamoulis
KDD
2008
ACM
264views Data Mining» more  KDD 2008»
14 years 10 months ago
Stable feature selection via dense feature groups
Many feature selection algorithms have been proposed in the past focusing on improving classification accuracy. In this work, we point out the importance of stable feature selecti...
Lei Yu, Chris H. Q. Ding, Steven Loscalzo
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
14 years 9 months ago
Covering indexes for branching path queries
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...
MOBIHOC
2002
ACM
14 years 9 months ago
Comparison of broadcasting techniques for mobile ad hoc networks
Network wide broadcasting in Mobile Ad Hoc Networks provides important control and route establishment functionality for a number of unicast and multicast protocols. Considering i...
Brad Williams, Tracy Camp
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
14 years 6 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...