Sciweavers

1950 search results - page 47 / 390
» Informative sampling for large unbalanced data sets
Sort
View
SIGMOD
1998
ACM
99views Database» more  SIGMOD 1998»
13 years 12 months ago
CURE: An Efficient Clustering Algorithm for Large Databases
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
CVPR
1998
IEEE
14 years 9 months ago
The Sample Tree: A Sequential Hypothesis Testing Approach to 3D Object Recognition
A method is presented for e cient and reliable object recognition within noisy, cluttered, and occluded range images. The method is based on a strategy which hypothesizes the inte...
Michael A. Greenspan
WSDM
2009
ACM
125views Data Mining» more  WSDM 2009»
14 years 2 months ago
Less is more: sampling the neighborhood graph makes SALSA better and faster
In this paper, we attempt to improve the effectiveness and the efficiency of query-dependent link-based ranking algorithms such as HITS, MAX and SALSA. All these ranking algorith...
Marc Najork, Sreenivas Gollapudi, Rina Panigrahy
SOFSEM
2001
Springer
14 years 4 days ago
How Can Computer Science Contribute to Knowledge Discovery?
Knowledge discovery, that is, to analyze a given massive data set and derive or discover some knowledge from it, has been becoming a quite important subject in several fields incl...
Osamu Watanabe
HPDC
2000
IEEE
14 years 4 days ago
dQUOB: Managing Large Data Flows using Dynamic Embedded Queries
The dQUOB system satis es client need for speci c information from high-volume data streams. The data streams we speak of are the ow of data existing during large-scale visualizat...
Beth Plale, Karsten Schwan