Sciweavers

165 search results - page 15 / 33
» Discovering Frequent Closed Itemsets for Association Rules
Sort
View
FIMI
2004
175views Data Mining» more  FIMI 2004»
13 years 9 months ago
CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure
Frequent itemset mining (FIM) is an essential part of association rules mining. Its application for other data mining tasks has also been recognized. It has been an active researc...
Yudho Giri Sucahyo, Raj P. Gopalan
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 8 months ago
Dense itemsets
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
Heikki Mannila, Jouni K. Seppänen
CINQ
2004
Springer
157views Database» more  CINQ 2004»
13 years 11 months ago
Inductive Databases and Multiple Uses of Frequent Itemsets: The cInQ Approach
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
Jean-François Boulicaut
CAEPIA
2003
Springer
14 years 26 days ago
Text Mining Using the Hierarchical Syntactical Structure of Documents
One of the most important tasks for determining association rules consists of calculating all the maximal frequent itemsets. Specifically, some methods to obtain these itemsets hav...
Roxana Dánger, José Ruiz-Shulcloper,...
JIS
2007
95views more  JIS 2007»
13 years 7 months ago
Combined association rules for dealing with missing values
With the rapid increase in the use of databases, the problem of missing values inevitably arises. The techniques developed to effectively recover these missing values should be hi...
Jau-Ji Shen, Chin-Chen Chang, Yu-Chiang Li