Sciweavers

1314 search results - page 57 / 263
» Approximate data mining in very large relational data
Sort
View
CORR
2008
Springer
114views Education» more  CORR 2008»
15 years 1 months ago
Dynamic index selection in data warehouses
Analytical queries defined on data warehouses are complex and use several join operations that are very costly, especially when run on very large data volumes. To improve response...
Stéphane Azefack, Kamel Aouiche, Jér...
161
Voted
VLDB
2002
ACM
154views Database» more  VLDB 2002»
15 years 1 months ago
I/O-Conscious Data Preparation for Large-Scale Web Search Engines
Given that commercial search engines cover billions of web pages, efficiently managing the corresponding volumes of disk-resident data needed to answer user queries quickly is a f...
Maxim Lifantsev, Tzi-cker Chiueh
CIKM
2009
Springer
15 years 8 months ago
Large margin transductive transfer learning
Recently there has been increasing interest in the problem of transfer learning, in which the typical assumption that training and testing data are drawn from identical distributi...
Brian Quanz, Jun Huan
ICDM
2003
IEEE
98views Data Mining» more  ICDM 2003»
15 years 7 months ago
On the Privacy Preserving Properties of Random Data Perturbation Techniques
Privacy is becoming an increasingly important issue in many data mining applications. This has triggered the development of many privacy-preserving data mining techniques. A large...
Hillol Kargupta, Souptik Datta, Qi Wang, Krishnamo...
BMCBI
2006
93views more  BMCBI 2006»
15 years 1 months ago
A summarization approach for Affymetrix GeneChip data using a reference training set from a large, biologically diverse database
Background: Many of the most popular pre-processing methods for Affymetrix expression arrays, such as RMA, gcRMA, and PLIER, simultaneously analyze data across a set of predetermi...
Simon Katz, Rafael A. Irizarry, Xue Lin, Mark Trip...