93 search results - page 15 / 19 » Memory Placement Techniques for Parallel Association Mining |
SIGMOD
1999
ACM
13 years 11 months ago
1999
ACM
In recent years, many data mining methods have been proposed for finding useful and structured information from market basket data. The association rule model was recently propos...
SISAP
2011
IEEE
12 years 10 months ago
2011
IEEE
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
KDD
2001
ACM
14 years 7 months ago
2001
ACM
In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneo...
LCTRTS
2007
Springer
14 years 1 months ago
2007
Springer
Set-associative caches are traditionally managed using hardwarebased lookup and replacement schemes that have high energy overheads. Ideally, the caching strategy should be tailor...
ICDM
2002
IEEE
14 years 12 days ago
2002
IEEE
Clustering large data sets of high dimensionality has always been a serious challenge for clustering algorithms. Many recently developed clustering algorithms have attempted to ad...