Sciweavers

1314 search results - page 41 / 263
» Approximate data mining in very large relational data
Sort
View
VC
2010
143views more  VC 2010»
14 years 8 months ago
A PDE method for patchwise approximation of large polygon meshes
Abstract Three-dimensional (3D) representations of complex geometric shapes, especially when they are reconstructed from magnetic resonance imaging (MRI) and computed tomography (C...
Yun Sheng, Alexei Sourin, Gabriela González...
119
Voted
KDD
2000
ACM
121views Data Mining» more  KDD 2000»
15 years 5 months ago
Mining high-speed data streams
Many organizations today have more than very large databases; they have databases that grow without limit at a rate of several million records per day. Mining these continuous dat...
Pedro Domingos, Geoff Hulten
BMCBI
2005
153views more  BMCBI 2005»
15 years 1 months ago
Mining published lists of cancer related microarray experiments: Identification of a gene expression signature having a critical
Background: Routine application of gene expression microarray technology is rapidly producing large amounts of data that necessitate new approaches of analysis. The analysis of a ...
Giacomo Finocchiaro, Francesco Mancuso, Heiko M&uu...
KDD
2001
ACM
163views Data Mining» more  KDD 2001»
16 years 2 months ago
The "DGX" distribution for mining massive, skewed data
Skewed distributions appear very often in practice. Unfortunately, the traditional Zipf distribution often fails to model them well. In this paper, we propose a new probability di...
Zhiqiang Bi, Christos Faloutsos, Flip Korn
JDWM
2006
84views more  JDWM 2006»
15 years 1 months ago
Discovering Surprising Instances of Simpson's Paradox in Hierarchical Multidimensional Data
This paper focuses on the discovery of surprising, unexpected patterns, based on a data mining method that consists of detecting instances of Simpson's paradox. By its very n...
Carem C. Fabris, Alex Alves Freitas