4085 search results - page 474 / 817 » Benchmarking Data Mining Algorithms |
170
click to vote
DMDW
2000
15 years 7 months ago
2000
As views in a data warehouse become more complex, the view maintenance process can become very complicated and potentially very inefficient. Storing auxiliary views in the warehou...
184
click to vote
SIGMOD
1998
ACM
15 years 10 months ago
1998
ACM
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
176
Voted
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
The MapReduce framework is increasingly being used to analyze large volumes of data. One important type of data analysis done with MapReduce is log processing, in which a click-st...
199
Voted
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
164
click to vote
WSDM
2009
ACM
16 years 1 months ago
2009
ACM
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...