Sciweavers

12863 search results - page 777 / 2573
» Dynamic Data Mining
Sort
View
SIGMOD
2001
ACM
193views Database» more  SIGMOD 2001»
16 years 7 months ago
Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
Christian Böhm, Bernhard Braunmüller, Fl...
166
Voted
ICDM
2009
IEEE
122views Data Mining» more  ICDM 2009»
16 years 2 months ago
Detecting and Interpreting Variable Interactions in Observational Ornithology Data
In this paper we demonstrate a practical approach to interaction detection on real data describing the abundance of different species of birds in the prairies east of the souther...
Daria Sorokina, Rich Caruana, Mirek Riedewald, Wes...
PAKDD
2007
ACM
184views Data Mining» more  PAKDD 2007»
16 years 1 months ago
A Fast Algorithm for Finding Correlation Clusters in Noise Data
Abstract. Noise significantly affects cluster quality. Conventional clustering methods hardly detect clusters in a data set containing a large amount of noise. Projected clusterin...
Jiuyong Li, Xiaodi Huang, Clinton Selke, Jianming ...
ICDM
2005
IEEE
138views Data Mining» more  ICDM 2005»
16 years 1 months ago
Labeling Unclustered Categorical Data into Clusters Based on the Important Attribute Values
Sampling has been recognized as an important technique to improve the efficiency of clustering. However, with sampling applied, those points which are not sampled will not have t...
Hung-Leng Chen, Kun-Ta Chuang, Ming-Syan Chen
KDD
1999
ACM
104views Data Mining» more  KDD 1999»
15 years 11 months ago
Learning Rules from Distributed Data
In this paper a concern about the accuracy (as a function of parallelism) of a certain class of distributed learning algorithms is raised, and one proposed improvement is illustrat...
Lawrence O. Hall, Nitesh V. Chawla, Kevin W. Bowye...