1314 search results - page 33 / 263 » Approximate data mining in very large relational data |
108
click to vote
KDD
2004
ACM
16 years 1 months ago
2004
ACM
Detection of near duplicate documents is an important problem in many data mining and information filtering applications. When faced with massive quantities of data, traditional d...
102
click to vote
INFOCOM
2010
IEEE
15 years 17 hour ago
2010
IEEE
— Quantiles are very useful in characterizing the data distribution of an evolving dataset in the process of data mining or network monitoring. The method of Stochastic Approxima...
127
click to vote
CCGRID
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--Large high dimension datasets are of growing importance in many fields and it is important to be able to visualize them for understanding the results of data mining appro...
220
click to vote
ICDE
2006
IEEE
16 years 2 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
213
click to vote
ICDE
2002
IEEE
16 years 2 months ago
2002
IEEE
Network, web, and disk I/O traffic are usually bursty, self-similar [9, 3, 5, 6] and therefore can not be modeled adequately with Poisson arrivals[9]. However, we do want to model...