Sciweavers

539 search results - page 9 / 108
» Recurrence relations and fast algorithms
Sort
View
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
14 years 7 months ago
Fast discovery of unexpected patterns in data, relative to a Bayesian network
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
Szymon Jaroszewicz, Tobias Scheffer
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
14 years 8 months ago
Fast Identification of Relational Constraint Violations
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
Amit Chandel, Nick Koudas, Ken Q. Pu, Divesh Sriva...
ICDE
1995
IEEE
139views Database» more  ICDE 1995»
14 years 8 months ago
Set-Oriented Mining for Association Rules in Relational Databases
We describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less escient than special-purpose...
Maurice A. W. Houtsma, Arun N. Swami
BIOADIT
2004
Springer
13 years 11 months ago
Biologically Plausible Speech Recognition with LSTM Neural Nets
Abstract. Long Short-Term Memory (LSTM) recurrent neural networks (RNNs) are local in space and time and closely related to a biological model of memory in the prefrontal cortex. N...
Alex Graves, Douglas Eck, Nicole Beringer, Jü...
BMCBI
2010
164views more  BMCBI 2010»
13 years 7 months ago
Gene regulatory networks modelling using a dynamic evolutionary hybrid
Background: Inference of gene regulatory networks is a key goal in the quest for understanding fundamental cellular processes and revealing underlying relations among genes. With ...
Ioannis A. Maraziotis, Andrei Dragomir, Dimitris T...