Sciweavers

4886 search results - page 416 / 978
» Approximate Data Exchange
Sort
View
LSSC
2001
Springer
15 years 11 months ago
On the Parallelization of the Sparse Grid Approach for Data Mining
Abstract. Recently we presented a new approach [5, 6] to the classification problem arising in data mining. It is based on the regularization network approach, but in contrast to ...
Jochen Garcke, Michael Griebel
CIKM
1999
Springer
15 years 11 months ago
Requirement-Based Data Cube Schema Design
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
David Wai-Lok Cheung, Bo Zhou, Ben Kao, Hongjun Lu...
ISI
2008
Springer
15 years 6 months ago
Probabilistic frameworks for privacy-aware data mining
Often several cooperating parties would like to have a global view of their joint data for various data mining objectives, but cannot reveal the contents of individual records due...
Joydeep Ghosh
ICDM
2010
IEEE
264views Data Mining» more  ICDM 2010»
15 years 4 months ago
Block-GP: Scalable Gaussian Process Regression for Multimodal Data
Regression problems on massive data sets are ubiquitous in many application domains including the Internet, earth and space sciences, and finances. In many cases, regression algori...
Kamalika Das, Ashok N. Srivastava
ICDM
2010
IEEE
108views Data Mining» more  ICDM 2010»
15 years 4 months ago
Assessing Data Mining Results on Matrices with Randomization
Abstract--Randomization is a general technique for evaluating the significance of data analysis results. In randomizationbased significance testing, a result is considered to be in...
Markus Ojala