Sciweavers

88 search results - page 12 / 18
» Further Pruning for Efficient Association Rule Discovery
Sort
View
DAWAK
1999
Springer
13 years 12 months ago
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
CIKM
2006
Springer
13 years 11 months ago
Multi-evidence, multi-criteria, lazy associative document classification
We present a novel approach for classifying documents that combines different pieces of evidence (e.g., textual features of documents, links, and citations) transparently, through...
Adriano Veloso, Wagner Meira Jr., Marco Cristo, Ma...
CORR
2010
Springer
132views Education» more  CORR 2010»
13 years 7 months ago
ETP-Mine: An Efficient Method for Mining Transitional Patterns
A Transaction database contains a set of transactions along with items and their associated timestamps. Transitional patterns are the patterns which specify the dynamic behavior o...
B. Kiran Kumar
BMCBI
2007
121views more  BMCBI 2007»
13 years 7 months ago
A constrained polynomial regression procedure for estimating the local False Discovery Rate
Background: In the context of genomic association studies, for which a large number of statistical tests are performed simultaneously, the local False Discovery Rate (lFDR), which...
Cyril Dalmasso, Avner Bar-Hen, Philippe Broët
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
14 years 8 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