Sciweavers

126 search results - page 17 / 26
» Database Reverse Engineering based on Association Rule Minin...
Sort
View
DIS
2008
Springer
13 years 9 months ago
Constructing Iceberg Lattices from Frequent Closures Using Generators
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, R...
ER
2003
Springer
150views Database» more  ER 2003»
14 years 17 days ago
EITH - A Unifying Representation for Database Schema and Application Code in Enterprise Knowledge Extraction
The integration of heterogeneous legacy databases requires understanding of database structure and content. We previously developed a theoretical and software infrastructure to sup...
Mark S. Schmalz, Joachim Hammer, Mingxi Wu, Oguzha...
AMT
2006
Springer
108views Multimedia» more  AMT 2006»
13 years 9 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
BMCBI
2010
149views more  BMCBI 2010»
13 years 7 months ago
KID - an algorithm for fast and efficient text mining used to automatically generate a database containing kinetic information o
Background: The amount of available biological information is rapidly increasing and the focus of biological research has moved from single components to networks and even larger ...
Stephanie Heinen, Bernhard Thielen, Dietmar Schomb...
VLDB
2004
ACM
94views Database» more  VLDB 2004»
14 years 20 days ago
Whither Data Mining?
The last decade has witnessed tremendous advances in data mining. We take a retrospective look at these developments, focusing on association rules discovery, and discuss the chal...
Rakesh Agrawal, Ramakrishnan Srikant