Sciweavers

1083 search results - page 14 / 217
» Efficient Discovery of Confounders in Large Data Sets
Sort
View
PRL
2002
67views more  PRL 2002»
13 years 7 months ago
A pseudo-nearest-neighbor approach for missing data recovery on Gaussian random data sets
Missing data handling is an important preparation step for most data discrimination or mining tasks. Inappropriate treatment of missing data may cause large errors or false result...
Xiaolu Huang, Qiuming Zhu
KDD
1994
ACM
125views Data Mining» more  KDD 1994»
13 years 11 months ago
Knowledge Discovery in Large Image Databases: Dealing with Uncertainties in Ground Truth
This paper discusses the problem of knowledge discovery in image databases with particular focus on the issues which arise when absolute ground truth is not available. It is often...
Padhraic Smyth, Michael C. Burl, Usama M. Fayyad, ...
BMCBI
2008
166views more  BMCBI 2008»
13 years 7 months ago
Learning transcriptional regulatory networks from high throughput gene expression data using continuous three-way mutual informa
Background: Probability based statistical learning methods such as mutual information and Bayesian networks have emerged as a major category of tools for reverse engineering mecha...
Weijun Luo, Kurt D. Hankenson, Peter J. Woolf
WECWIS
2006
IEEE
114views ECommerce» more  WECWIS 2006»
14 years 1 months ago
Large-Scale Service Composition in Semantic Service Discovery
Self-Healing and self-optimizing service based applications are important steps towards the self-organizing Service Oriented Architectures (SOA). Self-Organizing SOAs replace serv...
Steffen Bleul, Thomas Weise, Kurt Geihs
IDEAL
2003
Springer
14 years 25 days ago
Improving the Efficiency of Frequent Pattern Mining by Compact Data Structure Design
Mining frequent patterns has been a topic of active research because it is computationally the most expensive step in association rule discovery. In this paper, we discuss the use ...
Raj P. Gopalan, Yudho Giri Sucahyo