Sciweavers

917 search results - page 17 / 184
» Mining interesting sets and rules in relational databases
Sort
View
FQAS
2000
Springer
137views Database» more  FQAS 2000»
13 years 11 months ago
Towards the Tractable Discovery of Association Rules with Negations
Frequent association rules (e.g., AB C to say that when properties A and B are true in a record then, C tends to be also true) have become a popular way to summarize huge datasets...
Jean-François Boulicaut, Artur Bykowski, Ba...
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
14 years 8 months ago
An inductive database prototype based on virtual mining views
We present a prototype of an inductive database. Our system enables the user to query not only the data stored in the database but also generalizations (e.g. rules or trees) over ...
Élisa Fromont, Adriana Prado, Bart Goethals...
DAWAK
2009
Springer
14 years 9 days ago
Mining Violations to Relax Relational Database Constraints
Frequent constraint violations on the data stored in a database may suggest that the semantics of the represented reality is changing. In this work we propose a methodology and a t...
Mirjana Mazuran, Elisa Quintarelli, Rosalba Rossat...
TKDE
2011
362views more  TKDE 2011»
13 years 2 months ago
A Link Analysis Extension of Correspondence Analysis for Mining Relational Databases
—This work introduces a link-analysis procedure for discovering relationships in a relational database or a graph, generalizing both simple and multiple correspondence analysis. ...
Luh Yen, Marco Saerens, François Fouss
DASFAA
2008
IEEE
137views Database» more  DASFAA 2008»
13 years 9 months ago
Efficient Mining of Recurrent Rules from a Sequence Database
We study a novel problem of mining significant recurrent rules from a sequence database. Recurrent rules have the form "whenever a series of precedent events occurs, eventuall...
David Lo, Siau-Cheng Khoo, Chao Liu 0001