Sciweavers

262 search results - page 6 / 53
» Generalized Closed Itemsets for Association Rule Mining
Sort
View
ICANN
2005
Springer
15 years 5 months ago
Principles of Employing a Self-organizing Map as a Frequent Itemset Miner
This work proposes a theoretical guideline in the specific area of Frequent Itemset Mining (FIM). It supports the hypothesis that the use of neural network technology for the prob...
Vicente O. Baez-Monroy, Simon O'Keefe
ICDT
1999
ACM
93views Database» more  ICDT 1999»
15 years 4 months ago
Discovering Frequent Closed Itemsets for Association Rules
Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotf...
CIKM
2006
Springer
15 years 3 months ago
An integer programming approach for frequent itemset hiding
The rapid growth of transactional data brought, soon enough, into attention the need of its further exploitation. In this paper, we investigate the problem of securing sensitive k...
Aris Gkoulalas-Divanis, Vassilios S. Verykios
DMKD
2004
ACM
136views Data Mining» more  DMKD 2004»
15 years 5 months ago
Mining association rules with non-uniform privacy concerns
Privacy concerns have become an important issue in data mining. A popular way to preserve privacy is to randomize the dataset to be mined in a systematic way and mine the randomiz...
Yi Xia, Yirong Yang, Yun Chi
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
16 years 2 days ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan