1083 search results - page 39 / 217 » Efficient Discovery of Confounders in Large Data Sets |
NIPS
2001
13 years 11 months ago
2001
We investigate the following data mining problem from Computational Chemistry: From a large data set of compounds, find those that bind to a target molecule in as few iterations o...
BMCBI
2010
13 years 10 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
TKDE
1998
13 years 10 months ago
1998
—In this paper, we explore a new data mining capability that involves mining path traversal patterns in a distributed information-providing environment where documents or objects...
KDD
1998
ACM
14 years 2 months ago
1998
ACM
This paper presents an algorithm for discovering conjunction rules with high reliability from data sets. The discovery of conjunction rules, each of which is a restricted form of ...
CINQ
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...