Sciweavers

1413 search results - page 37 / 283
» Mining Multiple Large Databases
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
VLDB
1998
ACM
312views Database» more  VLDB 1998»
13 years 12 months ago
WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases
Many applications require the management of spatial data. Clustering large spatial databases is an important problem which tries to find the densely populated regions in the featu...
Gholamhosein Sheikholeslami, Surojit Chatterjee, A...
CIKM
2001
Springer
13 years 11 months ago
SQL Database Primitives for Decision Tree Classifiers
Scalable data mining in large databases is one of today's challenges to database technologies. Thus, substantial effort is dedicated to a tight coupling of database and data ...
Kai-Uwe Sattler, Oliver Dunemann
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
14 years 8 months ago
Scalable discovery of hidden emails from large folders
The popularity of email has triggered researchers to look for ways to help users better organize the enormous amount of information stored in their email folders. One challenge th...
Giuseppe Carenini, Raymond T. Ng, Xiaodong Zhou
ADC
2008
Springer
110views Database» more  ADC 2008»
14 years 2 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