1314 search results - page 50 / 263 » Approximate data mining in very large relational data |
120
click to vote
DATAMINE
2006
15 years 1 months ago
2006
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
124
click to vote
RCIS
2010
15 years 4 hour ago
2010
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
117
click to vote
VLDB
2000
ACM
15 years 5 months ago
2000
ACM
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...
208
click to vote
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
117
click to vote
KDD
2001
ACM
16 years 2 months ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...