Sciweavers

113 search results - page 18 / 23
» Efficient Discovery of Frequent Approximate Sequential Patte...
Sort
View
KDD
1997
ACM
154views Data Mining» more  KDD 1997»
13 years 11 months ago
Autonomous Discovery of Reliable Exception Rules
This paper presents an autonomous algorithm for discovering exception rules from data sets. An exception rule, which is defined as a deviational pattern to a well-known fact, exhi...
Einoshin Suzuki
BMCBI
2007
141views more  BMCBI 2007»
13 years 7 months ago
HeliCis: a DNA motif discovery tool for colocalized motif pairs with periodic spacing
Background: Correct temporal and spatial gene expression during metazoan development relies on combinatorial interactions between different transcription factors. As a consequence...
Erik Larsson, Per Lindahl, Petter Mostad
KDD
2004
ACM
168views Data Mining» more  KDD 2004»
14 years 8 months ago
Mining, indexing, and querying historical spatiotemporal data
In many applications that track and analyze spatiotemporal data, movements obey periodic patterns; the objects follow the same routes (approximately) over regular time intervals. ...
Nikos Mamoulis, Huiping Cao, George Kollios, Mario...
IPCCC
2006
IEEE
14 years 1 months ago
dRamDisk: efficient RAM sharing on a commodity cluster
Recent work on distributed RAM sharing has largely focused on leveraging low-latency networking technologies to optimize remote memory access. In contrast, we revisit the idea of ...
Vassil Roussev, Golden G. Richard III, Daniel Ting...
CIKM
2008
Springer
13 years 9 months ago
On effective presentation of graph patterns: a structural representative approach
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
Chen Chen, Cindy Xide Lin, Xifeng Yan, Jiawei Han