Sciweavers

960 search results - page 128 / 192
» CURE: An Efficient Clustering Algorithm for Large Databases
Sort
View
151
Voted
MST
2002
128views more  MST 2002»
15 years 3 months ago
A Simple and Efficient Parallel Disk Mergesort
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
Rakesh D. Barve, Jeffrey Scott Vitter
155
Voted
KDD
2006
ACM
130views Data Mining» more  KDD 2006»
16 years 4 months ago
Efficient anonymity-preserving data collection
The output of a data mining algorithm is only as good as its inputs, and individuals are often unwilling to provide accurate data about sensitive topics such as medical history an...
Justin Brickell, Vitaly Shmatikov
162
Voted
ADC
2008
Springer
110views Database» more  ADC 2008»
15 years 10 months ago
Graph Mining based on a Data Partitioning Approach
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
Son N. Nguyen, Maria E. Orlowska, Xue Li
KDD
2000
ACM
110views Data Mining» more  KDD 2000»
15 years 7 months ago
An empirical analysis of techniques for constructing and searching k-dimensional trees
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...
Douglas A. Talbert, Douglas H. Fisher
123
Voted
CIKM
1997
Springer
15 years 8 months ago
Using a Sequential Index in Terrain-Aided Navigation
Terrain-aided navigation is a database application in which an aeroplane locates itself by matching the height trajectory with a terrain-elevation map on board the aircraft. Witho...
Ling Lin, Tore Risch