Sciweavers

1768 search results - page 22 / 354
» Mining Very Large Databases
Sort
View
SAC
2005
ACM
14 years 3 months ago
Mining concept associations for knowledge discovery in large textual databases
In this paper, we describe a new approach for mining concept associations from large text collections. The concepts are short sequences of words that occur frequently together acr...
Xiaowei Xu, Mutlu Mete, Nurcan Yuruk
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
14 years 10 months ago
Very sparse random projections
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
Ping Li, Trevor Hastie, Kenneth Ward Church
ICDE
2004
IEEE
151views Database» more  ICDE 2004»
14 years 11 months ago
Improved File Synchronization Techniques for Maintaining Large Replicated Collections over Slow Networks
We study the problem of maintaining large replicated collections of files or documents in a distributed environment with limited bandwidth. This problem arises in a number of impo...
Torsten Suel, Patrick Noel, Dimitre Trendafilov
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
14 years 7 months ago
Top-k Correlative Graph Mining.
Correlation mining has been widely studied due to its ability for discovering the underlying occurrence dependency between objects. However, correlation mining in graph databases ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
KDD
2000
ACM
121views Data Mining» more  KDD 2000»
14 years 1 months ago
Mining high-speed data streams
Many organizations today have more than very large databases; they have databases that grow without limit at a rate of several million records per day. Mining these continuous dat...
Pedro Domingos, Geoff Hulten