1083 search results - page 160 / 217 » Efficient Discovery of Confounders in Large Data Sets |
PRL
2010
13 years 3 months ago
2010
It is desirable to find unusual data objects by Ramaswamy et al's distance-based outlier definition because only a metric distance function between two objects is required. It...
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
BMCBI
2006
13 years 9 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
KDD
2003
ACM
14 years 9 months ago
2003
ACM
We address the issues of discovering significant binary relationships in transaction datasets in a weighted setting. Traditional model of association rule mining is adapted to han...
BMCBI
2005
13 years 8 months ago
2005
Background: Most proteins function by interacting with other molecules. Their interaction interfaces are highly conserved throughout evolution to avoid undesirable interactions th...