Sciweavers

55 search results - page 7 / 11
» MAFIA: A Maximal Frequent Itemset Algorithm for Transactiona...
Sort
View
CIKM
2006
Springer
13 years 11 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
KDD
2003
ACM
194views Data Mining» more  KDD 2003»
14 years 8 months ago
Finding recent frequent itemsets adaptively over online data streams
A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Consequently, the knowledge embedded in a data stream is more likely to be c...
Joong Hyuk Chang, Won Suk Lee
LWA
2004
13 years 9 months ago
Efficient Frequent Pattern Mining in Relational Databases
Data mining on large relational databases has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind ...
Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist
CAEPIA
2003
Springer
14 years 23 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,...
KDD
2007
ACM
170views Data Mining» more  KDD 2007»
14 years 8 months ago
From frequent itemsets to semantically meaningful visual patterns
Data mining techniques that are successful in transaction and text data may not be simply applied to image data that contain high-dimensional features and have spatial structures....
Junsong Yuan, Ying Wu, Ming Yang