Sciweavers

917 search results - page 13 / 184
» Mining interesting sets and rules in relational databases
Sort
View
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
13 years 12 months ago
Scalable Parallel Data Mining for Association Rules
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
Eui-Hong Han, George Karypis, Vipin Kumar
CORR
2010
Springer
173views Education» more  CORR 2010»
13 years 5 months ago
Mining Multi-Level Frequent Itemsets under Constraints
Mining association rules is a task of data mining, which extracts knowledge in the form of significant implication relation of useful items (objects) from a database. Mining multi...
Mohamed Salah Gouider, Amine Farhat
PKDD
2007
Springer
95views Data Mining» more  PKDD 2007»
14 years 1 months ago
Pruning Relations for Substructure Discovery of Multi-relational Databases
Multirelational data mining methods discover patterns across multiple interlinked tables (relations) in a relational database. In many large organizations, such a multi-relational ...
Hongyu Guo, Herna L. Viktor, Eric Paquet
DAWAK
2004
Springer
14 years 1 months ago
A Tree Partitioning Method for Memory Management in Association Rule Mining
All methods of association rule mining require the frequent sets of items, that occur together sufficiently often to be the basis of potentially interesting rules, to be first com...
Shakil Ahmed, Frans Coenen, Paul H. Leng
RSFDGRC
2005
Springer
110views Data Mining» more  RSFDGRC 2005»
14 years 1 months ago
A Rough Set Based Model to Rank the Importance of Association Rules
Abstract. Association rule algorithms often generate an excessive number of rules, many of which are not significant. It is difficult to determine which rules are more useful, int...
Jiye Li, Nick Cercone