Sciweavers

184 search results - page 21 / 37
» Mining Quantitative Associations in Large Database
Sort
View
ICDM
2005
IEEE
177views Data Mining» more  ICDM 2005»
14 years 3 months ago
Average Number of Frequent (Closed) Patterns in Bernouilli and Markovian Databases
In data mining, enumerate the frequent or the closed patterns is often the first difficult task leading to the association rules discovery. The number of these patterns represen...
Loïck Lhote, François Rioult, Arnaud S...
WAIM
2004
Springer
14 years 3 months ago
Mining Inheritance Rules from Genealogical Data
Data mining extracts implicit, previously unknown and potentially useful information from databases. Many approaches have been proposed to extract information, and one of the most ...
Yen-Liang Chen, Jing-Tin Lu
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
14 years 10 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
AMT
2006
Springer
108views Multimedia» more  AMT 2006»
13 years 11 months ago
Efficient Frequent Itemsets Mining by Sampling
As the first stage for discovering association rules, frequent itemsets mining is an important challenging task for large databases. Sampling provides an efficient way to get appro...
Yanchang Zhao, Chengqi Zhang, Shichao Zhang
DAWAK
1999
Springer
14 years 2 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 ...