1314 search results - page 112 / 263 » Approximate data mining in very large relational data |
99
Voted
ICIP
2005
IEEE
16 years 3 months ago
2005
IEEE
Anisotropic Gaussian filters are useful for adaptive smoothing and feature extraction. In our application, micro - tomographic images of fibers were smoothed by anisotropic Gaussi...
CINQ
2004
Springer
15 years 7 months ago
2004
Springer
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...
96
Voted
KDD
2000
ACM
15 years 5 months ago
2000
ACM
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...
129
click to vote
SIGMOD
1998
ACM
15 years 6 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...
111
click to vote
ICDM
2009
IEEE
15 years 8 months ago
2009
IEEE
A pervasive problem in large relational databases is identity uncertainty which occurs when multiple entries in a database refer to the same underlying entity in the world. Relati...