Sciweavers

165 search results - page 13 / 33
» Discovering Frequent Closed Itemsets for Association Rules
Sort
View
DMKD
1997
ACM
198views Data Mining» more  DMKD 1997»
13 years 11 months ago
Clustering Based On Association Rule Hypergraphs
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad...
DATAMINE
1999
152views more  DATAMINE 1999»
13 years 7 months ago
Discovery of Frequent DATALOG Patterns
Discovery of frequent patterns has been studied in a variety of data mining settings. In its simplest form, known from association rule mining, the task is to discover all frequent...
Luc Dehaspe, Hannu Toivonen
DASFAA
2007
IEEE
234views Database» more  DASFAA 2007»
14 years 2 months ago
Estimating Missing Data in Data Streams
Networks of thousands of sensors present a feasible and economic solution to some of our most challenging problems, such as real-time traffic modeling, military sensing and trackin...
Nan Jiang, Le Gruenwald
ISCI
2007
99views more  ISCI 2007»
13 years 7 months ago
Privacy-preserving algorithms for distributed mining of frequent itemsets
Standard algorithms for association rule mining are based on identification of frequent itemsets. In this paper, we study how to maintain privacy in distributed mining of frequen...
Sheng Zhong
DKE
2008
124views more  DKE 2008»
13 years 7 months ago
A MaxMin approach for hiding frequent itemsets
In this paper, we are proposing a new algorithmic approach for sanitizing raw data from sensitive knowledge in the context of mining of association rules. The new approach (a) rel...
George V. Moustakides, Vassilios S. Verykios